[Date Index] [Thread Index] [Author Index]
Re: MultiplicativeOrder[k,n] ?
In a message dated 6/30/99 9:55:47 PM, piovere at flash.net writes: >I am trying to figure out what MultiplicativeOrder[k,n] is. The book >says this function gives the smallest integer m such that k^m = (3 >lines as if this is a definition) 1 mod n. I understand what Mod[k,n] >means but I dont' understand what "1 mod n" means. Could someone >please help me - I've found nothing in the math books on the subject. > k^m \[Congruent] 1 mod n means Mod[k^m, n] == 1 is True. MultiplicativeOrder[k, n] returns the smallest value of m for which the above is True. To understand the use of MultiplicativeOrder better, see the "Further Examples" for MultiplicativeOrder. Bob Hanlon