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

Home > Numbers
All but one (Posted on 2013-03-13) Difficulty: 2 of 5
Prove there is no positive integer n such that 2n divided by n gives a remainder of 1.

See The Solution Submitted by Jer    
No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
Some Thoughts odd single-digit values for n under a billion | Comment 1 of 2

list
   10   for N= 1 to 999999999
   18    P=modpow(2,N,N)
   20    if P<10 and p @ 2 = 1  then print N,P
   30   next
OK
run

n            2^n mod n
 25      7
 1727    7
 19147   5
 2228071         9
 3830879         7
 16888457        9
 33554425        7
 352978207       9
OK

Both 1 and 3 are missing from this list, which doesn't mean that they won't show up with higher n.


  Posted by Charlie on 2013-03-14 00:10:02
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 (4)
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