Find the least possible value of the positive integer n, such that 2013n can be represented as a difference of two perfect cubes of positive integers.
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.
2 0 1 3 ∣ a 3 − b 3 = > 3 . 1 1 . 6 1 ∣ a 3 − b 3 = > 3 . 1 1 . 6 1 ∣ ( a − b ) ( a 2 + a b + b 2 )
3 ∣ a 3 − b 3 = > 3 ∣ a − b
1 1 ∣ a 3 − b 3 = > 1 1 ∣ a − b
if 6 1 ∣ a − b = > 2 0 1 3 ∣ a − b and the smallest n is 2 0 1 3 ( 2 ∗ 2 0 1 3 ) 3 − 2 0 1 3 2 else 6 1 ∣ a 2 + a b + b 2 and 3 3 ∣ a − b so b = a + 3 3 k . for k = 1 6 1 ∣ ( a + 3 3 ) 2 + a ( a + 3 3 ) + a 2 < = > 6 1 ∣ a 2 + 3 3 a − 3 = > a 2 + 3 3 a − 3 = 6 1 p < = > a 2 + 3 3 a − 3 − 6 1 p = 0 Suppose there are integer solutoins for a = > discriminant is perfect square of odd integer. For 1, 3, 5 there is no sulution. For discriminant equal 7 2 = > n = 2 0 1 3 4 3 3 − 1 0 3 = 3 9