MathGroup Archive 1999

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: MultiplicativeOrder[k,n] ?

  • To: mathgroup at
  • Subject: [mg18448] Re: [mg18373] MultiplicativeOrder[k,n] ?
  • From: BobHanlon at
  • Date: Wed, 7 Jul 1999 00:11:33 -0400
  • Sender: owner-wri-mathgroup at

In a message dated 6/30/99 9:55:47 PM, piovere at 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


	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

  • Prev by Date: Series[] problem
  • Next by Date: [no subject]
  • Previous by thread: Series[] problem
  • Next by thread: Re: MultiplicativeOrder[k,n] ?