
Number Theory Number Theory Math Forum 
 LinkBack  Thread Tools  Display Modes 
December 2nd, 2007, 08:57 PM  #1 
Member Joined: Sep 2007 Posts: 77 Thanks: 0  If a has order hk modulo n, then a^h has order k mod n. If a has order hk modulo n, then a^h has order k mod n. We are supposed to prove this and we can use Thm 8.3 to do it, which is: If the a has order k mod n, then a^h has order k/gcd(h,k) I know this is probably simple to most of you, but for some reason I am getting stuck when trying to write out the proof... Thanks 
December 2nd, 2007, 09:21 PM  #2 
Member Joined: Sep 2007 Posts: 77 Thanks: 0 
Nevermind, I figured it out. Sorry to waste anyone's time!


Tags 
mod, modulo, order 
Search tags for this page 
Click on a term to search for related topics.

Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Order Adequacy "Q is Order Adequette..."  M_Strauss  Applied Math  0  October 31st, 2013 10:37 AM 
Proof that group of order 2k containts order k subgroup  Kappie  Abstract Algebra  0  April 22nd, 2012 02:52 PM 
Modulo, GCD, Order of Group  Newton31619  Number Theory  1  April 2nd, 2012 09:41 AM 
Reduction of second order ode to first order  Grayham1990  Calculus  2  March 30th, 2012 07:24 AM 
Transform 2nd order ODE to two 1st order ODE using matrices  Norm850  Calculus  2  March 7th, 2012 05:08 PM 