Prime Numbers are really Prime!

Find the sum of all primes p p such that p 2 + 2543 p^2 + 2543 has less than 16 distinct positive divisors.


The answer is 2.

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.

1 solution

If p = 2 p=2 , then p 2 + 2543 = 2547 = 3 2 × 283 p^2+2543=2547=3^2\times 283 has 6 6 positive divisors, satisfied.

If p = 3 p=3 , then p 2 + 2543 = 2552 = 2 3 × 11 × 29 p^2+2543=2552=2^3\times11\times29 has 16 16 positive divisors, not satisfied.

If p > 3 p>3 , we have p 2 1 ( m o d 3 ) p^2\equiv 1\pmod{3} and p 2 1 ( m o d 8 ) p^2\equiv 1 \pmod{8} .

Thus, p 2 + 2543 0 ( m o d 3 ) p^2+2543\equiv0\pmod{3} and p 2 + 2543 ( m o d 8 ) p^2+2543\equiv\pmod{8} .

So, p 2 + 2543 = 2 3 + α 1 . 3 1 + α 2 . p 3 α 3 p k α k p^2+2543=2^{3+\alpha_1}.3^{1+\alpha_2}.p_3^{\alpha_3}\ldots p_k^{\alpha_k}

Hence the number positive integers of p 2 + 2543 p^2+2543\, is

( α 1 + 4 ) ( α 2 + 2 ) ( α 3 + 1 ) ( α k + 1 ) 16 \qquad(\alpha_1+4)(\alpha_2+2)(\alpha_3+1)\ldots(\alpha_k+1)\ge16 , a contradiction.

So, p = 2 p=2 is unique solution.

why do you choose mod8 and 3?

Dev Sharma - 5 years, 9 months ago

and what is the steps after, 'so'

Dev Sharma - 5 years, 9 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...