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

Home > Just Math
An exponent and prime problem (Posted on 2007-01-06) Difficulty: 2 of 5
Given that n is a positive prime number. Determine analytically all possible n such that 2n + n2 is a prime number.

See The Solution Submitted by K Sengupta    
Rating: 4.0000 (2 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
re: needs a second attempt | Comment 3 of 6 |
(In reply to needs a second attempt by elementofsurprize)

The fundamental tenets inclusive of the problem under reference
may not be satisfied for all odd numbers n.
For example, when n= 11; we obtain, 2^11 + 11^2 = 2169 which is divisible by 9.
It may also be noted that according to conditions of the problem, n is a positive prime number.

  Posted by K Sengupta on 2007-01-06 14:52:11
Please log in:
Remember me:
Sign up! | Forgot password

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

Copyright © 2002 - 2019 by Animus Pactum Consulting. All rights reserved. Privacy Information