Do you know the identity to solve this?

For all positive integers n n , is 250 0 n + n 2500 2500^n+n^{2500} a prime number?

Either Neither No Yes

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 solutions

Satvik Golechha
Sep 10, 2014

N o o t i i c e e t h h a t t 2500 = 5 0 2 = 4. 5 4 2500=50^2=4.5^4 .

The identity to solve this is the SG identity.

If n n were even, it (the number) would never be a prime.

So, n n is odd. Let n = 2 k + 1 n=2k+1 .

Then, 250 0 n + n 2500 = 2500.250 0 2 k + n 2500 2500^n+n^{2500}=2500.2500^{2k}+n^{2500} , which can further be written as:- 4. ( 5 × 5 0 k ) 4 + ( n 625 ) 4 4.(5 \times 50^k)^4+(n^{625})^4 , which can even further be written as 4 a 4 + b 4 4a^4+b^4 , which is factorisable.

b 4 + 4 a 4 = ( b 2 + 2 a b + 2 a 2 ) ( b 2 2 a b + 2 a 2 ) \bullet \quad b^4+4a^4 = (b^2+2ab+2a^2)(b^2-2ab+2a^2)

@Satvik Golechha , you said it is factorizable but for all people who visit, you should show how it is factorized. I have edited it for you.

(Not all people know Sophie Germain identity,so telling it will make your solution more enriched, right ?)

Aditya Raut - 6 years, 9 months ago
Ivan Sekovanić
Oct 3, 2014

We can not generalize this for all positive integers. As a simple counter example, for ANY n n that is a divisor of 2500 2500 this identity does not hold.

For example, let us check for n = 50 n=50 .

250 0 50 + 5 0 2500 = 50 ( 5 0 50 + 5 0 2499 ) 2500^{50}+50^{2500}=50(50^{50}+50^{2499}) , meaning in this case the number we get from the expression is divisible by 50 50 , therefore it is not a prime number.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...