Insights Blog
-- Browse All Articles --
Physics Articles
Physics Tutorials
Physics Guides
Physics FAQ
Math Articles
Math Tutorials
Math Guides
Math FAQ
Education Articles
Education Guides
Bio/Chem Articles
Technology Guides
Computer Science Tutorials
Forums
Intro Physics Homework Help
Advanced Physics Homework Help
Precalculus Homework Help
Calculus Homework Help
Bio/Chem Homework Help
Engineering Homework Help
Trending
Featured Threads
Log in
Register
What's new
Search
Search
Search titles only
By:
Intro Physics Homework Help
Advanced Physics Homework Help
Precalculus Homework Help
Calculus Homework Help
Bio/Chem Homework Help
Engineering Homework Help
Menu
Log in
Register
Navigation
More options
Contact us
Close Menu
JavaScript is disabled. For a better experience, please enable JavaScript in your browser before proceeding.
You are using an out of date browser. It may not display this or other websites correctly.
You should upgrade or use an
alternative browser
.
Forums
Homework Help
Calculus and Beyond Homework Help
First time a^d = 1 mod n
Reply to thread
Message
[QUOTE="cutesteph, post: 4994189, member: 443314"] [h2]Homework Statement [/h2] For any positive integer d and n, find the first integer d such that a^d =1 mod n [h2]Homework Equations[/h2] Euler's totient function phi(n) = # of #s relatively prime to n Will solve the condition if a and n are coprime but not for the first d [h2]The Attempt at a Solution[/h2] If a and n are not coprime then there is no solution. I am not sure how to find the smallest d such the condition holds. I know that d will be a factor of Euler's totient function.[B] [/B] [/QUOTE]
Insert quotes…
Post reply
Forums
Homework Help
Calculus and Beyond Homework Help
First time a^d = 1 mod n
Back
Top