1/24/2015 AoPS Forum n|2^{n1}+1. Find n.
• Art of Problem Solving
n|2^{n1}+1. Find n.
Page 1 of 1
[ 7 posts ]
Author Message
randomasdf97 Jan 21, 2015, 2:07 pm • # 1 the Art of Problem Solving
Volume 2: and Beyond
Used for over 16 years! Lots
of AMC and AIME problems
Posts: 26
and topics!
Find all ( ).
zachman99323 Jan 21, 2015, 3:43 pm • # 2 Alcumus
Art of Problem Solving's FREE
innovative online learning
Solution below
Posts: 124 system. Over 3,500 problems
and solutions!
Attachments:
Screen shot 20150121 at 5.42.19 PM.png [ 59.72 KiB | Viewed 152 times ]
randomasdf97 Jan 21, 2015, 3:58 pm • # 3
Posts: 26 zachman99323 wrote:
Solution below
But . It's true that
, but unless we know that is a primitive root modulo , we can't say
that . How to prove this?
rightways Jan 21, 2015, 7:47 pm • # 4
Generalisation:
Posts: 317
Location: Republic of If and divides , then . Where is prime, is
Kazakhstan integer.
_________________
"God made the integers, all else He charged to man"
ComplexPhi Jan 22, 2015, 6:26 am • # 5
Solution:
http://www.artofproblemsolving.com/Forum/viewtopic.php?f=56&t=621928 1/3
1/24/2015 AoPS Forum n|2^{n1}+1. Find n. • Art of Problem Solving
Obviously is odd.
First start with a lemma:
If divides with prime and then
Proof of lemma:
It's obvious from the fact that the order of modulo is and from Fermat's little
Posts: 85 theorem.
Back to our problem :
Assume that .
is odd so write with odd.
Take a prime which divides .So divides .
Now from our lemma:
This happens for every prime which divides . From this we obtain :
divides
divides , a contradiction with odd.
The only solution is then
_________________
"God used beautiful mathematics in creating the world."
Paul Dirac
1 thanks
randomasdf97 Jan 22, 2015, 9:44 am • # 6
Could someone rigorously prove that (in the paper posted above)
Posts: 26
?
I know that , but is not necessarily the order (of modulo ) (FLT
doesn't say anything about it being the order of a particular base), thus we can't even know
that , let alone is the least such that .
ComplexPhi Jan 22, 2015, 10:51 am • # 7
rightways wrote:
Generalisation:
If and divides , then . Where is prime, is
integer.
Posts: 85
Solution:
Assume that .Take prime which divides .Let be the order of modulo .
From the condition:
http://www.artofproblemsolving.com/Forum/viewtopic.php?f=56&t=621928 2/3
1/24/2015 AoPS Forum n|2^{n1}+1. Find n. • Art of Problem Solving
So
Denote
From Fermat's little theorem:
divides , so divides .
This happens for every prime which divides , so :
, a contradiction with .
The only solution is .
_________________
"God used beautiful mathematics in creating the world."
Paul Dirac
Quick Reply
Tip: Make sure your message is constructive and adds to the conversation. Submit Full Editor
Display posts from previous: All posts Sort by Post time Ascending Go
Previous topic | Next topic
Community » Olympiad Section » Number Theory » Number Theory Unsolved Problems
All times are UTC 8 hours [ DST ]
Share:
Moderator: Olympiad Number Theory Moderators
Page 1 of 1 [ 7 posts ]
Login
Username: Password: Log me on automatically each visit Login
You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot post attachments in this forum
© Copyright 2015 AoPS Incorporated. All Rights Reserved.
"Art of Problem Solving" ® and "Beast Academy" ® are registered trademarks of AoPS Incorporated.
Contact Us • Privacy • Terms & Conditions
http://www.artofproblemsolving.com/Forum/viewtopic.php?f=56&t=621928 3/3
