In this month's issue, you'll find out why Benford's law applies to quantities that grow exponentially, how solutions to Diophantine equations seem to "repel" each other, how the Fourier transform can be used to derive the spherical means solution to the wave equation, and much more.

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

Kenneth A. Ross

Often data in the real world have the property that the first digit 1 appears about 30% of the time, the first digit 2 appears about 17% of the time, and so on with the first digit 9 appearing about 5% of the time. This phenomenon is known as Benford’s law. This paper provides a simple explanation, suitable for nonmathematicians, of why Benford’s law holds for data that have been growing (or shrinking) exponentially over time. Two theorems verify that Benford’s law holds if the initial values and rates of growth of the data appear at random.

Graham Everest and Thomas Ward

Problems related to the existence of integral and rational points on cubic curves date back at least to Diophantus. A significant step in the modern theory of these equations was made by Siegel, who proved that a nonsingular plane cubic equation has only finitely many integral solutions. Examples show that simple equations can have inordinately large integral solutions in comparison to the size of their coefficients. Nonetheless, a conjecture of Hall suggests a bound on the size of integral solutions in terms of the coefficients of the defining equation. It turns out that a similar phenomenon seems, conjecturally, to be at work for solutions which are close to being integral in another sense. We describe this conjecture as an illustration of an underlying motif—repulsion—in the theory of Diophantine equations.

Alberto Torchinsky

We solve the Cauchy problem for the *n*-dimensional wave equation using elementary properties of the Fourier transform.

W. Aitken and F. Lemmermeyer

This article explains the Hasse principle and gives a self-contained development of certain counterexamples to this principle. The counterexamples considered are similar to the earliest counterexample discovered by Lind and Reichardt. This type of counterexample is important in the theory of elliptic curves: today they are interpreted as nontrivial elements in Tate–Shafarevich groups.

In this paper we conjecture that the piecewise linear map *f* (*x*) = *px* for for which has an expanding, onto branch and a contracting branch, is eventually piecewise expanding. We give a partial proof of hte conjecture, in particular for values of *p *and *s *such that .

Hichem Ben-El-Mechaiekh and Robert W. Dimand

This note provides an elementary and simpler proof of the Nikaidô-Sion version of the von Neumann minimax theorem accessible to undergraduate students. The key ingredient is an alternative for quasiconvex/concave functions based on the separation of closed convex sets in finite dimension, a result discussed in a first course in optimization or game theory.

Luigi Pace

We give a short proof of the identity ζ (2) = π^{2}/6 using tools from elementary probability. Related identities, due to Euler, are also briefly discussed.

M. Ram Murty and V. Kumar Murty

In 1974, Harry Ruderman proposed the following problem in the problems section of this MONTHLY: if *m *> *n *≥ 0 are integers such that 2^{m }– 2^{n }divides 3^{m }– 3^{n }, then show that 2^{m }– 2^{n }divides *x*^{m }– *x*^{n }for all natural numbers *x*. This problem is still open. We prove that there are only finitely many pairs of natural numbers *m,* *n *such that 2^{m }– 2^{n }divides 3^{m }– 3^{n }. Since the proof involves the Schmidt subspace theorem, our bounds on *m *and *n *are ineffective. We discuss how an effective version of the *abc *conjecture can be used to derive effective bounds on *m *and *n*.

Alan F. Beardon

We give an elementary proof of the convergence, or nonconvergence, to zero in the “four numbers game.”__ __

*Famous Puzzles of Great Mathematicians*

By: Miodrag S. PetkoviÄ

Reviewed by: Peter Winkler