Let P be the number of integers n for which n 4 − 5 2 n 2 + 5 9 5 is prime, and let D be the number of distinct primes that can be represented in this form. Find P + D .
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.
Great question! Great solution as well :)
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 )
Thanks, I forgot about -1
A very nice question .....especially the -1 part
Thank you, @Brian Charlesworth ! You are always making great problems!
If n 2 = a and p = a 2 − 5 2 a + 5 9 5 and hence we have (by quadratic formula) a = 2 5 2 ± 5 2 2 − 2 3 8 0 + 4 p = 2 6 ± p + 8 1 which shows p + 8 1 = k 2 implies { p = k + 9 1 = k − 9 or { p = k − 9 1 = k + 9 as k > 0 thus we have k = 1 0 and p = 1 9 (from 1st case) which further gives n = 2 6 ± 1 0 = ± 4 , ± 6 giving us only a single prime so 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?
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 that is unclear. Another way of stating this is that, say, for k = 1 , n 1 is the smallest of all the positive integers n for which S ( n ) = 1 , and for k = 2 , n 2 is the smallest of all the positive integers n for which S ( n ) = 2 , and so on. Try figuring out the values for S ( 1 ) , S ( 2 ) , S ( 3 ) and so on first to get a feel for what n 0 , n 1 and so on might be. If you need any more clarification please feel free to ask. :)
Log in to reply
Thank you very much Sir. Finally I solved it..
It's a great problem!! :)
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
Problem Loading...
Note Loading...
Set Loading...
We have that n 4 − 5 2 n 2 + 5 9 5 = ( n 2 − 1 7 ) ( n 2 − 3 5 ) . For this to be prime we must have exactly one of n 2 − 1 7 or n 2 − 3 5 equal to ± 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 − 1 7 = − 1 when n = ± 4 , for which n 2 − 3 5 = − 1 9 , rendering the product 1 9 , a prime.
n 2 − 3 5 = 1 when n = ± 6 , for which n 2 − 1 7 = 1 9 , rendering the product 1 9 , a prime.
As all 4 suitable values for n yield the same prime, we find that P + D = 4 + 1 = 5 .