how to solve (x^y) mod z ?
- To: mathgroup at smc.vnet.net
- Subject: [mg21257] how to solve (x^y) mod z ?
- From: "Hyper4S" <Hyper4S at privacyx.com>
- Date: Mon, 20 Dec 1999 02:28:19 -0500 (EST)
- Sender: owner-wri-mathgroup at wolfram.com
Has anybody a method/program that can handle calculations of this sort?
(x^y) mod z
where x and z are numbers of at least 11 bits
y is a number of at least 6 bits
Please explain me your method!
Can anybody please explain me how the mod function of e.g. the windows 98
calculator works? I don't wanna know how to USE it(I know that!), I wanna
know what the calculator does to solve it, what methods it uses
Thanks!