*This project uses a sampling problem to compute certain...*

**Journal subscribers and MAA members:** Please login into the member portal by clicking on 'Login' in the upper right corner.

Peter Sarnak

We review the construction of integral Apollonian circle packings. There are a number of Diophantine problems that arise in the context of such packings. We discuss some of them and describe some recent advances.

Thomas C. Hull

Margharita P. Beloch was the first person, in 1936, to realize that origami (paperfolding) constructions can solve general cubic equations and thus are more powerful than straightedge and compass constructions. We present her proof. In doing this we use a delightful (and mostly forgotten?) geometric method due to Eduard Lill for finding the real roots of polynomial equations.

Heng Huat Chan, Ling Long, and YiFan Yang

It is well known that if *p* is a prime such that *p*≡ 1 (mod 4), then *p* can be expressed as a sum of two squares. Several proofs of this fact are known and one of them, due to E. Jacobsthal, involves the identity *p =x^{2} + y^{2}*, with

**H. M. Hilden, J. M. Montesinos, D. M. Tejada, and M. M. Toro**

It is well known that there are 17 crystallographic groups that determine the possible tessellations of the Euclidean plane. We approach them from an unusual point of view. Corresponding to each crystallographic group there is an orbifold. We show how to think of the orbifolds as artifacts that serve to create tessellations.** **

**Jaume Paradís, Pelegrí Viader, and Lluís Bibiloni**

A new continuous strictly increasing singular function is described with the help of the ternary and binary systems for real number representation; in this, our function is similar to Cantor’s function, but in other aspects it is quite unusual. We are able to determine a condition to identify many points for which the derivative vanishes or is infinite; for other singular functions constructed with the help of a system of representation of real numbers, this condition depends on some metrical properties of the growth of averages of the sum of all the digits of the representation, but in the case of this new function, it depends on the frequency of occurrence of the digit 2 in the usual ternary expansion of a number.

**Roger Cooke**

We examine and update an 1889 application of the theory of finite abelian groups to prove that there are at least *n- *1primes between the *n*th prime and the product of the first *n* primes.** **

**James Rickards**

In this note we explore when a polynomial *f*(*x*) can be expressed as a composition of other polynomials. First, we give a necessary and sufficient condition on the roots of *f*(*x*). Through a clever use of symmetric functions we then show how to determine if *f*(*x*) is expressible as a composition of polynomials without needing to know any of the roots of *f*(*x*).** **

**Pieter Moree**

If the equation 1^{k} = 2^{k} + --- + (*m*-2)^{k} = *m*^{k} has a solution with *k *≥ 2, then* *. Leo Moser showed this in 1953 by remarkably elementary methods. His proof rests on four identities he derives separately. It is shown here that Moser’s result can be derived from a von Staudt-Clausen type theorem (an easy proof of which is also presented here). In this approach the four identities can be derived uniformly. The mathematical arguments used in the proofs were already available during the lifetime of Lagrange (1736–1813).** **

*The Mathematics of Sex: How Biology and Society Conspire to Limit Talented Women and* *Girls.*

Stephen J. Ceci and Wendy M. Williams

Reviewed by: Susan Jane Colley