How many pairs of positive integers ( m , n ) are there satisfying m 3 − n 3 = 2 1 ?
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.
From the relation m 3 − n 3 = 2 1 we have that ( m − n ) ( m 2 + m n + n 2 ) = 3 ⋅ 7
If m and n are both integers then ( m − n ) and ( m 2 + m n + n 2 ) are also integers. So by the FTA there are only four possibilities to check:
Remember that a n 2 + b n + c = 0 may have integer solutions for n only if the discriminant Δ = b 2 − 4 a c is a square number.
Problem Loading...
Note Loading...
Set Loading...
Consider the cubes of consecutive integers n and n + 1 . The gap between their cubes is
( n + 1 ) 3 − n 3 = ( n 3 + 3 n 2 + 3 n + 1 ) − n 3 = 3 n 2 + 3 n + 1
which is clearly an increasing function for all positive n , i.e. the gap between consecutive cubes will grow as n grows.
The gaps between the first few consecutive cubes is
2 3 − 1 3 = 8 − 1 = 7
3 3 − 2 3 = 2 7 − 8 = 1 9
4 3 − 3 3 = 6 4 − 2 7 = 3 7
and the gaps will continue to grow so there are no consecutive cubes with a difference of 2 1 .
The only other difference of cubes which is small enough that it might be 2 1 is 3 3 − 1 3 but that equals 2 6 .
Thus the given equation has no solution over the positive integers.