g c d ( x , y ) = 1 , k > 1 and 3 n = x k + y k
Find the sum of all positive integers n for which there exist positive integers x,y and k such that(Russia 1996)
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.
Even if a and b are not co-prime, 3 n can not be equal to a 2 + b 2 if both a and b are positive.
Log in to reply
Infinite descent?
Log in to reply
A number can be the sum of two positive squares if and only if it has at least one 4 k + 1 -form prime factor and all the other 4 k + 3 -form prime factors have even powers.
Log in to reply
@Mursalin Habib – (y) Also setting a = 3 a 1 , b = 3 b 1 leads to infinite descent.
Log in to reply
@Jubayer Nirjhor – Works for any 4 k + 3 -form prime. I was going for a more general statement.
Log in to reply
@Mursalin Habib – It follows immediately from FLT
Simple if you know the following facts.
Fact 1 ) Zsigmondy's theorem
Fact 2 ) A positive integral power of 3 can not be the sum of squares of two positive integers.
Because of fact 2 , we can get rid of all even k 's.
Because of fact 1 , we cam get rid of all odd k 's with the exception of 2 3 + 1 3 which turns out to be a power of 3 .
So, 3 2 = 2 3 + 1 3 is the only possible answer and the sum of all n is just 2 .
There's some typo in your fact 2 since 9 = 1 + 8 = 2 + 7 = ⋯ .
Zeigmondy's theorem ???
Zsigmondy has a difficult proof.This problem is also solvable using lifting the exponent lemma.
Log in to reply
But Zsigmondy's is a really good olympiad gem. A lot of formidable looking NT problems get trivial when you use it. And who said anything about proving it?
Log in to reply
Of course,Zsigmondy can "explode" difficult problems sometimes.Knowing the proofs of every theorem that one uses isn't necessary,but a lot of people haven't probably read the elementary proof of Zsigmondy and so I thought mentioning the LTE approach might help some people.
Problem Loading...
Note Loading...
Set Loading...
Note that if k is even then we have 3 n as sum of squares. Bashing through quadratic residues modulo 3 then tells us that both x and y must be multiples of 3 , contradicting g cd ( x , y ) = 1 .
Now suppose k is odd. Then x + y ∣ x k + y k . By Zsigmondy's theorem x k + y k contains at least one prime factor that doesn't divide x + y . That means x k + y k has at least 2 prime factors, contradicting the fact that it's a prime power.
However, note that Zsigmondy's theorem has an exception 2 3 + 1 3 . We substitute x = 2 , y = 1 , k = 3 then solving gives n = 2 , a positive integer. Hence n = 2 is the only solution.