From: roob noob <lists@...>
Date: 2012-07-25T22:42:10+09:00
Subject: Re: modular exponentation with multiple exponents?

Jimmy Petersen wrote in post #1070154:
> Hi,
>
> a ** b ** c ** d ** e % f
>
> should solve your problem

I thought it might be so simple but the numbers are enormous and that 
will freeze everything and never get done. Each of the numbers are one 
thousand bits long. Are you sure that is what is being asked for when 
they say a ^ b c d e mod n (with a big a and the other letters above it 
like normal exponentiation) I might have not even written it correctly 
as a ^ b ^ c ^ d ^ e % f but that is how I am reading it.

-- 
Posted via http://www.ruby-forum.com/.