If a < b < c < d < e are five consecutive positive integers, find the smallest possible value of c so that b + c + d is a perfect square and a + b + c + d + e is a perfect cube.
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.
Let a < b < c < d < e be five consecutive positive integers such that b = a + 1 , c = a + 2 , d = a + 3 , e = a + 4 . If we require the smallest value of c such that b + c + d = 3 a + 6 = α 2 and a + b + c + d + e = 5 a + 1 0 = β 3 , then we have:
a + 2 = c = 3 α 2 = 5 β 3 ⇒ 5 α 2 = 3 β 3 . (i)
We require the prime factorizations α = 3 p 1 5 p 2 and β = 3 p 3 5 p 4 , which after substituting these into (i) yields:
3 2 p 1 5 2 p 2 + 1 = 3 3 p 3 + 1 5 3 p 4 ⇒ 2 p 1 = 3 p 3 + 1 , 2 p 2 + 1 = 3 p 4
which the smallest permissible positive integral values are p 1 = 2 , p 2 = p 3 = p 4 = 1 . The smallest possible values of α and β are α = 3 2 5 1 = 4 5 , β = 3 1 5 1 = 1 5 , and the smallest possible value for c computes to:
c = 3 α 2 = 5 β 3 ;
or c = 3 4 5 2 = 5 1 5 3 = 6 7 5 .
Problem Loading...
Note Loading...
Set Loading...
a < b < c < d < e are five consecutive integers,so set a = c − 2 , b = c − 1 , d = c + 1 , e = c + 2 .Therefore we have for some integers m , n : { b + c + d = m 2 ⟹ 3 c = m 2 ( 1 ) a + b + c + d + e = n 3 ⟹ 5 c = n 3 ( 2 ) From ( 1 ) we get that c = 3 k 2 for some k .
Putting this in ( 2 ) yields 1 5 k 2 = n 3 .Hence k must be of the form k = 1 5 p 3 for some p .
Hence c = 3 k 2 = 3 ( 1 5 p 3 ) 2 = 6 7 5 p 6 .The minimum value of c will occur when p = 1 .Hence the samllest possible value of c is c = 6 7 5 p 6 = 6 7 5
For some who might be a bit confused about why I put c = 3 k 2 or k = 1 5 p 3 .The reason is as follows.I'll explain why I put c = 3 k 2 .The expression for k follows similarly.
From ( 1 ) we get c = 3 m 2 .Now,we are given that c is a positive integer.But that means that c = 3 m 2 is a positive integer.Now what does that say about m ? Think about it.Our main problem is that 3 in the denominator.If c is an integer then upon simplifying 3 m 2 ,that 3 in the denominator must get cancelled out.Now that will only happen if m 2 has a factor of 3 in its factorization,which means that m is a multiple of 3.Therefore,setting m = 3 k ,we get c = 3 m 2 = 3 ( 3 k ) 2 = 3 9 k 2 = 3 k 2 ,as desired.