MPOTD 403

Albert added two perfect natural cubes together, resulting in a number with exactly one prime factor. Find all possible values for that factor. 403.1 Changes from the original problem The domain of the cubes to consider is restricted to the naturals. 403.2 Solution Sketch Attempt Lets write this problem in arithmetic parlance. We know that all numbers can be prime factored. Lets assume that there exists a prime number pk the sole prime factor of the sum of the two cubes, then lets rewrite those two cubes in terms of a and b, which are both relative prime to pk . (a peak )3 + (b pebk )3 = pn where eak <= ebk k k k The eak <= ebk gives us two natural cases to consider: 1. eak < ebk 2. eak = ebk Lets consider the rst case rst, where eak < ebk . I will show that assuming this is the case will lead to a contradiction. Proof sketch follows Assuming eak < ebk , then it must be the case that
e (a peak )3 + (b pebk )3 = a3 + (b pkbk eak )3 peak k k k n = pk ek 3 3 a + (b pk ) = pm k

However, if a3 + b3 p3ek = pm , then it must be the case that if pk | a3 + b3 p3ek k k k 3 3ek 3 pk |b pk = pk |a . However, weve dened a such that pk |a, hence assuming eak < ebk leads to a contradiction, which means that it must be the case that eak = ebk . Because eak = ebk , we can rewrite our problem as a3 + b 3 = p m k Where p |a p |b or the converse also holds. This again divides our problem into two classes since 1 is automatically coprime to every number, p is either coprime to a,b or p just doesnt divide a,b: 1. both a, b > 1 2. a = 1 or b = 1

Lets again consider the rst case that both a and b are coprime to p, and hence neither are 1. I will show that assuming this is the cass will again lead to a conotradiction. Proof sketch follows a3 + b3 = (a + b)(a2 ab + b2 ) = (a + b)((a + b)2 3ab) = pm k Because we have an expression of the form (a + b) x = pm , then because pk is prime, k we cant multiply powers of two dierent prime to get one power of prime, it must be the case that both pk |(a + b) pk |((a + b)2 3ab). You can see where the problem is now right? pk |(a + b) xpk = (a + b) pk |((a + b)2 3ab) pk |(x2 p2 3ab) k = pk |3ab So either pk |3 pk |a pk |b. Assuming that we restrict naturals to positive integers for now, we see that the only way to create a power of three using a3 + b3 is through 13 + 23 = 32 , which does not satify our conditions, sketch again as follows: Assume that pk = 3, then by the above argument, it must be the case that 3|((a + 2 2 b) 3ab), which would mean that (a+b) ab N. This gives rise to the following natural 3 system (a + b)2 = 3ab + 3 (a b)2 = 3 ab (a + b)2 + 3(a b)2 = 12 This system has one integral solutions a = 1, b = 1 1 , which does not satisfy the condition that a, b N, hence pk = 3 pk |3. Now we are just left with pk |a pk |b, however since we assumed that pk is coprime to both a and b, or pk |a pk |b. Our conclusion contradicts the premise, hence it cannot be the case that both a, b > 1. Hence, at least one of a, b must be 1. . Finally, xing a = 1, we consider our available solutions. The rst two are trivial 3 1 + 13 = 21 13 + 23 = 32 For all subsequent numbers b > 2, we use the same argument as above (1 + b)((1 + b)2 3b) = pm k So pk |(1 + b) pk |((1 + b)2 3b) = pk |3b. Weve already shown that pk = 3 unless a = 1, b = 2, so this means that pk |b, which contradicts the assumption that pk |b, hence b >2, and our only solution of problems are (a, b) = (1, 1) (1, 2).
1

http://bit.ly/MSbSum

403.3 Solutions If we consider natural numbers to only be positive, our solutions are (2n )3 + (2n )3 = 23n+1 (3n )3 + (2 3n )3 = 33n+2 If we allow 0 within the set of natural numbers, then we also consider all powers of primes. 03 + (pn )3 = (pn )3