MathGroup Archive 1999

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

Search the Archive

modular exponantiation

  • To: mathgroup at smc.vnet.net
  • Subject: [mg21231] modular exponantiation
  • From: "6Lawi" <sjb6lawi at hotmail.com>
  • Date: Mon, 20 Dec 1999 02:27:51 -0500 (EST)
  • Sender: owner-wri-mathgroup at wolfram.com

Does anybody know how to solve calculations like this in an easy way?

a^b mod c

where a and c are numbers of 10 bits or more and c a number of at least 6
bits



please explain me your method!

Thanks





  • Prev by Date: Re: Magnification on the ToolBar in Mathematica4
  • Next by Date: how to solve (x^y) mod z ?
  • Previous by thread: Re: Complex numbers and MathLink
  • Next by thread: how to solve (x^y) mod z ?