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

Home > Just Math
Truth or consequences (Posted on 2017-11-02) Difficulty: 4 of 5
Is it true that 2n-2 is not divisible by n when n is composite?

Prove or show a counterexample.

No Solution Yet Submitted by Ady TZIDON    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
No Subject Comment 2 of 2 |
Such numbers are known as Fermat pseudoprimes.  They continue   5461, 6601, 7957, 8321, 8481, 8911, 10261.



  Posted by xdog on 2017-11-02 18:12:58
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 (2)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

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