I get a substantially different result, using the LargeIntegers plugin:

	Time millisecondsToRun: [(855 raisedTo: 2753) \\ 3233]

155 milliseconds.  Of course, if you try to print the result of

	855 raisedTo: 2753

it will take a few weeks to compute the radix 10 representation.  On 
the other hand, executing the doIt:

	x := 855 raisedTo: 2753

is fast, really fast.  For me, printing the result of the expression:

	(855 raisedTo: 2753) \\ 3233

was virtually instantaneous.


At 3:29 PM +0200 8/3/00, Wouter Gazendam wrote:
>Hi All,
>
>I'm trying to build a RSA implementation in Squeak, and I came across the
>following problem:
>RSA works with incredibly large numbers (sometimes up to 10^1000),
>PrintIt-ing the next line takes about 8 secs to run:
>
>(855 raisedTo: 2753) \\ 3233
>
>Any ideas how to speed this up?
>
>Wouter Gazendam

-- 
Andrew C. Greenberg		acg at netwolves.com
V.P. Eng., R&D, 		813.885.2779 (office)
NetWolves Corporation		813.885.2380 (facsimile)
www.netwolves.com

Please use werdna at mucow.com instead of werdna at gate.net