Monthly Archives: August 2019

Mountain Houses Problem

It is always fascinating to look at problems from the past. This one, given by Thomas Whiting himself, is over 200 years old from Whiting’s 1798 Mathematical, Geometrical, and Philosophical Delights:

Question 2, by T. W. from Davison’s Repository.
There are two houses, one at the top of a lofty mountain, and the other at the bottom; they are both in the latitude of 45°, and the inhabitants of the summit of the mountain, are carried by the earth’s diurnal rotation, one mile an hour more than those at the foot.

Required the height of the mountain, supposing the earth a sphere, whose radius is 3982 miles.”

See the Mountain Houses Problem

Consecutive Product Square

This problem from Colin Hughes at Maths Challenge is a most surprising result that takes a bit of tinkering to solve.

We can see that 3 x 4 x 5 x 6 = 360 = 19² – 1. Prove that the product of four consecutive integers is always one less than a perfect square.”

The result is so mysterious at first that you begin to understand why the ancient Pythagoreans had a mystical relationship with mathematics.

See the Consecutive Product Square.

Mathematics, And The Excellence Of The Life It Brings

I am a regular reader of Ash Jogalekar’s blog Curious Wavefunction, but I found my way to his latest via the eclectic website 3 Quarks Daily, also highly recommended. I could not resist the title, “Mathematics, And The Excellence Of The Life It Brings”. The entirety of the post was about the mathematician Shing-Tung Yau’s recent memoir, The Shape of a Life, but Jogalekar’s introductory remarks about his personal involvement with mathematics stirred so many personal recollections of my own, that I thought I would provide an excerpt, followed by my own comments. Furthermore, he also addresses in passing the perennial question of whether math is invented or discovered.

See Math and the Excellence of Life

Maximum Product

This 2007 four-star problem from Colin Hughes at Maths Challenge is definitely a bit challenging.

For any positive integer, k, let Sk = {x1, x2, … , xn} be the set of [non-negative] real numbers for which x1 + x2 + … + xn = k and P = x1 x2 … xn is maximised. For example, when k = 10, the set {2, 3, 5} would give P = 30 and the set {2.2, 2.4, 2.5, 2.9} would give P = 38.25. In fact, S10 = {2.5, 2.5, 2.5, 2.5}, for which P = 39.0625.

Prove that P is maximised when all the elements of S are equal in value and rational.”

I took a different approach from Maths Challenge, but for me, it did not rely on remembering a somewhat obscure formula. (I don’t remember formulas well at my age—only procedures, processes, or proofs, which is ironic, since at a younger age it was just the opposite.) It is also clear from the Maths Challenge solution that the numbers were assumed to be non-negative.

See Maximum Product.

Impossible Car Riddle

This is another intriguing problem from Presh Talwalkar.

“A car travels 75 miles per hour (mph) downhill, 60 mph on flat roads, and 50 mph uphill. It takes 3 hours to go from town A to B, and it takes 3 hours and 30 minutes for return journey by the same route. What is the distance in miles between towns A and B?”

See the Impossible Car Riddle