A Prime Diversion

Let P P be the number of integers n n for which n 4 52 n 2 + 595 n^{4} - 52n^{2} + 595 is prime, and let D D be the number of distinct primes that can be represented in this form. Find P + D P + D .

9 None of these choices 5 6 3 7 4 8

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.

3 solutions

We have that n 4 52 n 2 + 595 = ( n 2 17 ) ( n 2 35 ) n^{4} - 52n^{2} + 595 = (n^{2} - 17)(n^{2} - 35) . For this to be prime we must have exactly one of n 2 17 n^{2} - 17 or n 2 35 n^{2} - 35 equal to ± 1 \pm 1 and the other term having an absolute value that is prime with a sign that allows for the product to be positive. The possible options are as follows:

  • n 2 17 = 1 n^{2} - 17 = -1 when n = ± 4 n = \pm 4 , for which n 2 35 = 19 n^{2} - 35 = -19 , rendering the product 19 19 , a prime.

  • n 2 35 = 1 n^{2} - 35 = 1 when n = ± 6 n = \pm 6 , for which n 2 17 = 19 n^{2} - 17 = 19 , rendering the product 19 19 , a prime.

As all 4 4 suitable values for n n yield the same prime, we find that P + D = 4 + 1 = 5 P + D = 4 + 1 = \boxed{5} .

Great question! Great solution as well :)

John Frank - 5 years, 4 months ago

Log in to reply

Thanks! :)

Brian Charlesworth - 5 years, 4 months ago

Yup.. First to get it right :-].. Indeed I was marking 6 before I realised 'D' asked for number of distinct primes...BTW nice explanation ( + 1 ) (\large\mathcal{+1})

Rishabh Jain - 5 years, 4 months ago

Log in to reply

Thanks, and congrats on being first! :)

Brian Charlesworth - 5 years, 4 months ago

Thanks, I forgot about -1

Hải Trung Lê - 5 years, 4 months ago

A very nice question .....especially the -1 part

Samarth Agarwal - 5 years, 4 months ago

Thank you, @Brian Charlesworth ! You are always making great problems!

Joshua Lowrance - 2 years, 4 months ago

Log in to reply

Thanks! I'm glad you enjoy them. :)

Brian Charlesworth - 2 years, 4 months ago
Naren Bhandari
Feb 14, 2019

If n 2 = a n^2=a and p = a 2 52 a + 595 p=a^2-52a+595 and hence we have (by quadratic formula) a = 52 ± 5 2 2 2380 + 4 p 2 = 26 ± p + 81 a = \dfrac{52\pm \sqrt{{52^2-2380+4p}}}{2}=26\pm \sqrt{p+81} which shows p + 81 = k 2 p+81=k^2 implies { p = k + 9 1 = k 9 or { p = k 9 1 = k + 9 \begin{cases}p = k+9 \\ 1=k-9\end{cases} \ \ \text{or} \ \ \begin{cases}p = k-9 \\ \ 1=k+9\end{cases} as k > 0 k>0 thus we have k = 10 k=10 and p = 19 p=19 (from 1st case) which further gives n = 26 ± 10 = ± 4 , ± 6 n= \sqrt{26\pm 10}= \pm 4 \ , \ \pm 6 giving us only a single prime so P + D = 5 P+D=5 .

A nice problem

Sir , @Brian Charlesworth , I don't understand the statement of the this problem which belongs to you. Can you help me out?

Naren Bhandari - 2 years, 4 months ago

Log in to reply

Nice solution! As for "A summoning of sums", I'm guessing that it is the second sentence of the problem statement and the definition of n k n_{k} that is unclear. Another way of stating this is that, say, for k = 1 k = 1 , n 1 n_{1} is the smallest of all the positive integers n n for which S ( n ) = 1 S(n) = 1 , and for k = 2 k = 2 , n 2 n_{2} is the smallest of all the positive integers n n for which S ( n ) = 2 S(n) = 2 , and so on. Try figuring out the values for S ( 1 ) , S ( 2 ) , S ( 3 ) S(1), S(2), S(3) and so on first to get a feel for what n 0 , n 1 n_{0}, n_{1} and so on might be. If you need any more clarification please feel free to ask. :)

Brian Charlesworth - 2 years, 4 months ago

Log in to reply

Thank you very much Sir. Finally I solved it..

It's a great problem!! :)

Naren Bhandari - 2 years, 3 months ago
Edwin Gray
Feb 14, 2019

n^4 - 52n^2 + 595 = (n^2 - 35)*(n^2 - 17). If the product is to be a prime, one of the factors must be 1, or -1 if the other factor is negative. We see this happens for n = 6, n = -6, n = 4, n = -4, and in all cases, the prime is 19. So P = 4 and D = 1, P + D = 5.

Brian, I enjoy your problems; thanks so much

Edwin Gray - 2 years, 4 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...