Let and be distinct positive integers, such that their arithmetic mean (AM), geometric mean (GM), and harmonic mean (HM) are all integers.
Input your answer as the sum of the five integers mentioned, when the sum is minimized.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The AM, GM, and HM form a geometric sequence. Therefore, they can be expressed as k m 2 , k m n , and k n 2 respectively, where k , m , and n are all integers.
Then, using the definitions of the harmonic mean: x + y 2 x y = k n 2
Manipulating with the equation: 2 x y − k n 2 x − k n 2 y = 0 2 x ( 2 y − k n 2 ) − 2 k n 2 y = 0 2 x ( 2 y − k n 2 ) − 2 k n 2 y + k 2 n 4 = k 2 n 4 ( 2 x − k n 2 ) ( 2 y − k n 2 ) = k 2 n 4
Splitting the product gives: 2 x − k n 2 = k n 2 ( b a ) 2 y − k n 2 = k n 2 ( a b ) where a and b are coprime.
Changing the subject: x = 2 b k n 2 ( a + b ) y = 2 a k n 2 ( a + b )
Since x y is a perfect square, a b is also a perfect square. Then, we can split it into d c p and c d p where a b = p 2 , and c and d are coprime.
Then: x = c 2 d p k n 2 ( d c p + c d p ) = 2 d 2 k n 2 ( c 2 + d 2 ) y = d 2 c p k n 2 ( d c p + c d p ) = 2 c 2 k n 2 ( c 2 + d 2 )
Now, c and d are free variables, while k and n are semi-free variables.
AM = 4 c 2 d 2 k n 2 ( c 2 + d 2 ) 2 GM = 2 c d k n 2 ( c 2 + d 2 ) HM = k n 2
Since ( c 2 + d 2 ) is not divisible by c 2 d 2 because c and d are coprime, k n 2 must be divisible by c 2 d 2 . Let the quotient be q : x = 2 q c 2 ( c 2 + d 2 ) y = 2 q d 2 ( c 2 + d 2 ) AM = 4 q ( c 2 + d 2 ) 2 GM = 2 q c d ( c 2 + d 2 ) HM = q c 2 d 2
Apparently the solution is obtained when c and d are as low as possible, i.e. 2 and 1 . This yields x = 4 0 , y = 1 0 , AM = 2 5 , GM = 2 0 , HM = 1 6 , and the required sum would be 1 1 1 .
However notice that the solution might be smaller when c 2 + d 2 is divisible by 2 . Then, we shall try c = 3 and d = 1 , which gives us x = 4 5 , y = 5 , AM = 2 5 , GM = 1 5 , HM = 9 , and the required sum would be 99 , which is even smaller than 1 1 1 .
When c and d get bigger, so does the sum. Therefore 9 9 is the minimum.