Day 15: Squaring the primes

p 2 + q 2 + r 2 = 2014 p^2 + q^2 + r^2 = 2014

Three prime numbers p p , q q and r r satisfy the equation above. Find the sum of all possible values of p p .

This problem is part of the set Advent Calendar 2014 .


The answer is 0.

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.

5 solutions

Discussions for this problem are now closed

Samuel Li
Dec 15, 2014

Because the sum is even, one of the primes must be 2. (Not all three can be 2).

WLOG assume that p=2. Then q 2 + r 2 = 2010 q^2+r^2=2010 . All squares are 0 or 1 mod 3. 2010 is 0 mod 3, so both squares must also be 0 mod 3. However, this means that both primes must be 3, which does not work. Therefore, no solutions exist.

Yup, modular arithmetic is very useful for disproving a certain statement by showing if it fails modulo k, it cannot occur. Mod 3, 4 and 8 are the simplest to disprove statements. :)

Mukul Rathi - 6 years, 5 months ago
Jason Martin
Mar 11, 2015

First note that 2 2 is not a possible value of p p . If it were, 2010 2010 would be expressible as a sum of two squares. However, only numbers of the form 2 k a b 2 2^k \cdot a \cdot b^2 , where a a is a product of primes congruent to 1 1 mod 4 4 and b b is a product of primes congruent to 3 3 mod 4 4 , can be represented as a sum of two squares, and 2010 2010 does not have this form. Thus, 2 2 is not a possible value of p p .

Therefore, p p , q q , and r r are all odd, so p 2 + q 2 + r 2 p^2+q^2+r^2 is odd. However, 2014 2014 is even. Thus, no such primes exist, so the sum is 0 0

Michael Ng
Dec 14, 2014

All primes are 1 m o d 3 1 \bmod 3 except for 3 3 which is 0 m o d 3 0 \bmod 3 . Now notice that the RHS is 1 m o d 3 1 \bmod 3 . Therefore the primes' squares must be 1 , 0 , 0 m o d 3 1, 0, 0 \bmod 3 in some order. But that means that p 2 = 1996 p^2 = 1996 (for some prime p p ) for which there are no solutions.

Therefore there are no solutions and so the answer is 0 \boxed{0} .

can we say that expect 2 as one of the p,q,r , we will always get L.H.S as odd number where as R.H.S is even which is not possible , thus no odd prime number.( which is all prime numbers - 2) . now checking for 2 we do not get a prime number , therefore no solutions .

Nice solution

U Z - 6 years, 6 months ago

i followed this point! :D

Asif Hasan - 6 years, 5 months ago

Thanks! That is a great point.

Michael Ng - 6 years, 6 months ago

All primes 1 mod 3.??? R u sure??? What abt 11, 41, 17 and all?

Swetha Selvaraj - 6 years, 6 months ago

I'm pretty sure he meant that all squares are 0 or 1 mod 3.

Samuel Li - 6 years, 6 months ago
Dheeraj Agarwal
Dec 14, 2014

every prime no. can be written in the form of either 6n+1 or 6n-1 ; now if we see that whole squaring either of the squares, we get 1 as the remainder but 2014 is exactly divisible by 2014 so none of the values of "p", "q",or "r" are possible. note-: the rule that prime no's are in the form 6n=1 or 6n-1 is applicable for all primes greater then or equal to 5.

Moderator note:

This solution is incomplete. You first need to state that primes 2 , 3 2,3 don't satisfy the diophantine equation. Then only you can move on to claim that the primes must be of the form 6 n ± 1 6n \pm 1 .

Can EVERY prime no be written as either 6n+1 or 6n-1? Wat abt the number 2?

Swetha Selvaraj - 6 years, 6 months ago
Adarsh Kumar
Dec 14, 2014

First of all,we know that all the primes, p , q , r p,q,r can't be odd as if they are,then L . H . S L.H.S would be odd \Rightarrow one of the primes has to be 2. 2. Let us say that p = 2. q 2 + r 2 = 2010. p=2.\Rightarrow\ q^2+r^2=2010. Now,all squares are 0 , 1 , 4 , 9 ( m o d 16 ) . \equiv0,1,4,9\pmod{16}. In this case L . H . S L.H.S is 10 ( m o d 16 ) . \equiv10\pmod{16}. The only combination that fits is 1 , 9. 1,9. Let us say that q 1 ( m o d 16 ) . q\equiv1\pmod{16}. Now,for r r we have these possibilities, { 16 y + 3 16 y + 5 16 y + 11 16 y + 13 \begin{cases}\\16y+3\\16y+5\\16y+11\\16y+13\end{cases} Checking the first case gives, 256 ( x 2 + y 2 ) + 32 x + 96 y = 2000. 256(x^2+y^2)+32x+96y=2000. Dividing both sides by 16 gives, 16 ( x 2 + y 2 ) + 2 x + 6 y = 125. 16(x^2+y^2)+2x+6y=125. Now,the L . H . S L.H.S is divisible by 2 2 but the R . H . S R.H.S isn't.Thus,no solutions exist.A similar thing would happen for all the other cases.Thus,no solutions exist.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...