If n^4+n^2+1 is a prime no. find the possible values of n
will mark brainliest
Answers
Answered by
3
Answer:
Step-by-step explanation:
Obviously, n has to be a prime number. So there is no need to test n=0 or n=1.
Then, with n=2, we see that n+2 can't prime because that's obviously divisible by 2. No need to look at n=4 either. In fact, we don't need to consider any other even n.
Moving on to n=3, we obtain the primes 3, 5, 7. Ding, ding, ding!
With n=5, we get the prime 7 but also 9=32.
And with n=7, we get n+4=11, but n+2=9=32.
Look at this problem modulo 6: if n is odd, it has to be 1 or 5(mod6) to not be a multiple of 3. But if n≡1(mod6), then n+2≡3(mod6), or if n≡5(mod6), then n+4≡3(mod6)
pls mark me brainliest
Answered by
1
Answer:
I hope it may help you
Plz mark as brainliest
Attachments:
Similar questions
Science,
5 months ago
Hindi,
5 months ago
Social Sciences,
5 months ago
Physics,
10 months ago
Computer Science,
1 year ago
Math,
1 year ago
English,
1 year ago