Newsgroups: comp.lang.pascal
Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!sarah!mooney.nldn.albany.edu!charlie
From: charlie@baron.nldn.albany.edu (Charlie Murphy)
Subject: Help with arbitrary precision integer arithmetic
Message-ID: <1991Apr17.101153.14642@sarah.albany.edu>
Originator: charlie@mooney.nldn.albany.edu
Sender: news@sarah.albany.edu (News Administrator)
Nntp-Posting-Host: mooney.nldn.albany.edu
Organization: National Lightning Detection Network
Distribution: usa
Date: Wed, 17 Apr 91 10:11:53 GMT
Lines: 21

I'm currently working on trying to find the prime factorization of
100 - 500 digit integers (for the RSA challange) and have written 
a number of routines using a SUN arbitrary precision language tool.
However, that language does not support a number of features that I
will need, and therefore I must write arbitrary arithmetic procedures.

What I need help with is an integer division algorithm. I have written
one but it is horribly inefficient. My implementation is with arrays.
I think my other routines (+,-,*, and others) are fairly efficient, but
I could use help with any and all of them.

Is my implementation fastest? should I use linked lists? Any suggestions?

Thanks in advance.

-charlie
-- 
| charlie murphy				   |    """ """    /   \__
| charlie@mooney.nldn.albany.edu		   |	(o) (o)   /       \
| National Lightning Detection Network		   |       <      \        \_
| Disclaimer: who started the disclaimer nonsense? |	  \__/	  /          \