The Product Meets The Square

Are there any three consecutive positive integers [ a , b , c ] [a, b, c] , such that their product a b c abc is a perfect square?

No Yes

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.

3 solutions

Brian Moehring
Aug 15, 2018

Let a , b , c a,b,c denote three consecutive integers (in that order) such that their product a b c abc is a perfect square. Since they are consecutive, we have a = b 1 a=b-1 and c = b + 1 , c=b+1, so that b ( b 2 1 ) = ( b 1 ) ( b ) ( b + 1 ) = a b c b(b^2-1) = (b-1)(b)(b+1) = abc

Now, since gcd ( b , b 2 1 ) = 1 \gcd(b,b^2-1) = 1 and their product is a square, we must have that b 2 1 = n 2 b^2 - 1 = n^2 is a perfect square, or written another way, ( b n ) ( b + n ) = b 2 n 2 = 1. (b-n)(b+n) = b^2 - n^2 = 1. Since the only way to write 1 1 as the product of two integers is 1 × 1 = 1 = 1 × 1 , 1 \times 1 = 1 = -1 \times -1, it follows that 2 b = ( b n ) + ( b + n ) = 2 × ( ± 1 ) = ± 2 b = ± 1 b 2 1 = 0 2b = (b-n)+(b+n) = 2\times (\pm 1) = \pm 2 \implies b = \pm 1 \implies b^2 - 1 = 0

However, then a b c = b ( b 2 1 ) = 0 abc = b(b^2-1) = 0 so that at least one of a , b , c a,b,c is zero, showing that no, \boxed{\text{no,}} there aren't any three consecutive positive integers such that their product is a perfect square.

Andrei Li
Aug 15, 2018

Write b = n b=n , such that a = n 1 a=n-1 and c = n + 1 c=n+1 . Then,

n ( n 1 ) ( n + 1 ) = m 2 n(n-1)(n+1)=m^2

for some integer m m . Combine the factors on the left to obtain:

n 3 n = m 2 n^3-n=m^2

or

x 3 x = y 2 x^3-x=y^2

an elliptic curve. A bit of tinkering with a computer algebra program then shows that it has no integral solutions. Thus, there are no integers a , b , c , a, b, c, and m m such that

a b c = m 2 abc=m^2

thus, any n n which satisfies the equation above must have even exponents in their prime factors in n n , n 1 n-1 , and n + 1 n+1 . In other words, n n , n 1 n-1 , and n + 1 n+1 must be squares.

This requires all three to be pairwise relatively prime, and that's not necessarily true. We can conclude n n is a square, but all that we know about n 1 n-1 and n + 1 n+1 is that gcd ( n 1 , n + 1 ) = 1 or 2 . \gcd(n-1,n+1) = 1 \text{ or } 2\text{.} If it's 1 , 1, then they would both be squares, but if it's 2 , 2, they would each be twice a square.

Brian Moehring - 2 years, 9 months ago
Edwin Gray
Sep 5, 2018

Let the consecutive integers be x - 1, x , and x + 1. Then x(x^2 -1) = y^2 Let r = gcd(x,y), so that x = ra, y = rb with (a,b) = 1. Substituting and dividing by r, a(r^2 a^2 - 1) = rb^2. Since (a,b) = 1, this implies that a|r. Let r = am. Substituting and dividing by a, a^4 m^2 - 1 = mb^2. Then m = 1, and a^4 - 1 = b^2, or a^4 - b^2 = 1, which is impossible, Since the difference of 2 positive squares cannot equal 1. Ed Gray

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...