My Math Forum If a has order hk modulo n, then a^h has order k mod n.

 Number Theory Number Theory Math Forum

 December 2nd, 2007, 07: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, 08: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

,

,

# if a has order hk modulo n then ah has order k modulo n

Click on a term to search for related topics.
 Thread Tools Display Modes Linear Mode

 Similar Threads Thread Thread Starter Forum Replies Last Post M_Strauss Applied Math 0 October 31st, 2013 09:37 AM Kappie Abstract Algebra 0 April 22nd, 2012 01:52 PM Newton31619 Number Theory 1 April 2nd, 2012 08:41 AM Grayham1990 Calculus 2 March 30th, 2012 06:24 AM Norm850 Calculus 2 March 7th, 2012 04:08 PM

 Contact - Home - Forums - Cryptocurrency Forum - Top