Heronian triangles are triangles with integer sides and area. In [1], a classical result about squares in arithmetic progression was obtained by proving that it is not possible for the altitude of a Heronian triangle to divide the base in the ratio of 1 : 2. In this article we shall investigate general ratios of the form 1 : n, where n is a positive integer. These base ratios do not appear to have received previous attention despite the wealth of results about other aspects of Heronian triangles [2].

The following theorems are famous landmarks in the history of number theory.

Theorem 1 (Fermat-Euler): A number is representable as a sum of two squares if, and only if, it has the form PQ2, where P is free of prime divisors q ≡ 3 (mod 4).

Theorem 2 (Lagrange): Every number is representable as a sum of four squares.

Theorem 3 (Gauss-Legendre): A number is representable as a sum of three squares if, and only if, it is not of the form 4a (8n + 7).

Most spirals are continuous spirals, certainly those famous in history such as the traditional Archimedean spiral (r = a + bθ) and the logarithmic spirals (r = aebθ. Here we consider ‘discrete spirals’.

The Lyness equation(1)

\begin{equation}{X_{n + 1}} = \frac{{{X_n} + a}}{{{X_{n - 1}}}},\,(a,{x_1},{x_2} > 0)\end{equation}

Folded paper road maps are found next to sextants in the pile of obsolete navigation tools. GPS navigation apps like Waze and Google Maps, accurate to within a few metres, are available on all smartphones and most new cars. These apps provide drivers with real time traffic conditions and suggest minimum drive time routes, giving drivers the ability to avoid congestion and delays caused by heavy traffic, accidents, road construction and other hindrances.

In this paper we state the original identity proved by Euler, and we provide an alternative proof of this result. We then extend the approach to derive a further identity for the sum of reciprocals of squares, along with two other related identities. We conclude by obtaining yet another extension of the identity, and this is accomplished by means of a probability density function, or pdf.

Given a differentiable function f with argument x, its critical points are those values of x, if any, in its domain for which either f′ (x) = 0 or f′ (x) is undefined. The first derivative test is a number line test that tells us, definitively, whether a given critical point, x = c, of f(x) is a local maximum, a local minimum, or neither. The second derivative test is not a number line test, but can also be applied to classify the critical points of f(x). Unfortunately, the second derivative test is, under certain conditions, inconclusive.

Geometry is a very interesting, applicable and beautiful part of mathematics. However, geometry is often difficult for students to understand and demanding for teachers to teach [1]. Constructing proofs in geometric problems turns out to be particularly difficult, even for high attaining students [2]. Sometimes, students do not even know where to start when trying to solve these [3].

Nowadays there is considerable agreement among educators that learning mathematics fundamentally involves making mathematics [1]. Students learn mathematics while working on tasks that they consider meaningful and worthwhile, and their interest is aroused when they can see the point of what they are being asked to do. Given that learning mathematics involves a process of meaning-making - the use of mathematical language, symbols and representations as learners negotiate ideas – activities should provide students with a variety of challenging experiences through which they can actively construct mathematical meanings for themselves.

After several years of teaching an introduction to probability and statistics for engineering degree students, my attention has been captured by some variations on the familiar general addition law of probability. Network analysis of components connected in parallel is one of many applications.

We elaborate the idea behind Markov chain Monte Carlo (MCMC) methods in a mathematically coherent, yet simple and understandable way. To this end, we prove a pivotal convergence theorem for finite Markov chains and a minimal version of the Perron-Frobenius theorem. Subsequently, we briefly discuss two fundamental MCMC methods, the Gibbs and Metropolis-Hastings sampler. Only very basic knowledge about matrices, convergence of real sequences and probability theory is required.

The solution set of an equation f(x,y) = g(x,y) over ℝ2 is the set of all pairs of real numbers (x,y) such that the equation holds.

This article finds equations whose solution sets are the boundaries (in Cartesian coordinates) of different shapes.

In [1], Dalzell proved that $\pi= \frac{{22}}{7} - \int_0^1 {\frac{{{t^4}{{(1 - t)}^4}}}{{1 + {t^2}}}}$. He then used this equation to derive a new series converging to π. In [2], Backhouse studied the general case of integrals of the form $\int_0^1 {\frac{{{t^m}{{(1 - t)}^m}}}{{1 + {t^2}}}dt}$ and derived conditions on m and n so that they could be used to evaluate π. As a sequel, he derived accurate rational approximations of π. This work was extended in [3] where new rational approximations of π are obtained. Some related integrals of the forms $\int_0^1 {\frac{{{t^m}{{(1 - t)}^m}}}{{1 + {t^2}}}P(t)\,dt}$ and $\int_0^1 {\frac{{{t^m}{{(1 - t)}^m}}}{{\sqrt {1 - {t^2}} }}P(t)dt}$ with P(t) being of polynomial form are also investigated. In [4] the author gives more new approximations and new series for the case m = n = 4k. In [5] new series for π are obtained with the integral $\int_0^a {\frac{{{t^{12m}}{{(a - t)}^{12m}}}}{{1 + {t^2}}}dt}$ where $a = 2 - \sqrt 3$. The general problem of improving the convergence speed of the arctan series by transformation of the argument has also been considered in [6, 7]. In the present work the author considers an alternative form for the denominators in integrals. As a result, new series are obtained for multiples of π by some algebraic numbers.