February 21st, 2017, 04:48 PM  #1 
Newbie Joined: Feb 2017 From: LA Posts: 2 Thanks: 0  Euler's Theorum
Compute ø (45); Compute 7^48 mod 45 using Euler’s Theorem

February 21st, 2017, 06:04 PM  #2 
Global Moderator Joined: Dec 2006 Posts: 20,826 Thanks: 2160 
What progress have you made so far?

February 21st, 2017, 07:18 PM  #3 
Newbie Joined: Feb 2017 From: LA Posts: 2 Thanks: 0 
a = 7 n = 45 phi n = 24 gcd (7, 45) = 1 7^24 = 1 mod 24 not sure what to do. Last edited by qwaz; February 21st, 2017 at 07:20 PM. 
February 21st, 2017, 07:26 PM  #4 
Senior Member Joined: Sep 2015 From: USA Posts: 2,500 Thanks: 1372 
Euler's Theorem if $n$ and $a$ are coprime $a^{\phi(n)}\equiv 1 \pmod{n}$ $7$ and $45$ are coprime $\phi(45)=24$ $7^{48} = 7^{24\cdot 2} = (7^{24})^2$ you finish 

Tags 
euler, theorum 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Euler Paths and Euler Circuits  MMath  Elementary Math  11  May 27th, 2016 12:01 AM 
Euler method/ Euler formula  FalkirkMathFan  Calculus  1  November 5th, 2011 12:57 AM 
Euler method/ Euler formula  FalkirkMathFan  Real Analysis  0  November 4th, 2011 04:08 AM 
Euler method/ Euler formula  FalkirkMathFan  Calculus  0  November 3rd, 2011 04:52 PM 
Euler Phi  brangelito  Number Theory  18  August 9th, 2010 11:58 PM 