perplexus.info :: Just Math : Three Power Verification

Three Power Verification (Posted on 2016-01-20)

M is a positive integer such that 4^M + 2^M +1 is a prime number.

Can there be any instance where M is not a power of 3?

Give reasons for your answer.

No Solution Yet Submitted by K Sengupta

No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)

Proved in 1978

Comment 4 of 4 |

Took a little searching, but I found this:

Cyclotomic Polynomials and Factorization Theorems

Solomon W. Golomb

The American Mathematical Monthly

Vol. 85, No. 9 (Nov., 1978), pp. 734-737

Golomb specifically calls out this problem in the introduction!

Posted by Brian Smith on 2016-01-21 11:01:09

Please log in:

Login:
Password:
Remember me:

Sign up! \| Forgot password

Search:

Search body:

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

Chatterbox:


perplexus dot info