Find the sum of all prime numbers which satisfy for some primes (not necessarily distinct) , and .
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.
d^4mod5=1 for gcd(d,5)=1 and 0 otherwise.if all a,b and c are coprime to 5 RHS would be greater than 5 and a multiple of 5 so we let a=5. Now RHS does not equal 2 and LHS is prime so RHS must be odd so b^4+c^4 is odd. Thus one of b or c is even. Hence we let b = 2. We have 638+c^4=p. Now if gcd(c,3)=1 then c^4mod3=1 and 638+c^4 would be a multiple of 3. Thus c must be 3. We have to now check whether 719 is a prime. Using the fact that if none of the primes less than (719)^0.5 divide the number we conclude that 719 is prime