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

 Does it continue? 5: powers of 2 (Posted on 2017-09-24)
Before trying the problem "note your opinion as to whether the observed pattern is known to continue, known not to continue, or not known at all."

For integers greater than 1,
2n is never congruent to 1 (mod n)
2n is congruent to 2 (mod n) whenever n is prime, and sometimes when it isn't,
is 2n ever congruent to 3 (mod n)?

 No Solution Yet Submitted by Jer Rating: 5.0000 (1 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
 solution | Comment 1 of 6
My intuition was yes for two reasons
1) first, depending on your interpretation of 3 mod n when n<3, then n=1 could work since 3 mod 1 = 0 and 2^1 mod 1 = 0
2) I would expect 2^n mod n to be fairly chaotic so I would expect there would eventually be a value 3 mod n.

A quick search of OEIS and we are given http://oeis.org/A050259 which has the first value other than 1 (depending if you want to count it) is 4700063497

 Posted by Daniel on 2017-09-24 13:12:51

 Search: Search body:
Forums (0)