All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Just Math
Prime Number Arithmetic (Posted on 2004-11-19) Difficulty: 4 of 5

Find all primes p such that 2^p + p^2 is also prime.

Prove there are no others.

See The Solution Submitted by Erik O.    
Rating: 4.1250 (8 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution Solution with mini-proof | Comment 1 of 7

First, we see that it is not true for p=2, and it is for p=3. The only possible answer is 3, since for all primes p>3, 2^p+p^2 is a multiple of 3.

To see this consider (for p>3):

(p^2 -1) + (2^p + 1) =
(p-1)(p+1) + (2^p + 1)

Now since p can't be a multiple of 3, either (p-1) or (p+1) must be a multiple of three, so (p-1)(p+1) is a multiple of 3. Also, since p is odd, 2^p + 1 is a multiple of 3, so the whole number must be a multple of 3.

Edited on November 19, 2004, 9:57 pm
  Posted by SteveH on 2004-11-19 21:55:13

Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (1)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (6)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information