From: Andrew.Spring@ping.be (Andrew Spring)
To: cypherpunks@toad.com
Message Hash: 3eb94c5cff819e1d6a2c679177eec947a15bed85eb5a257ea332ed2391f8a83a
Message ID: <v01510102ac6e97a01432@[193.74.217.9]>
Reply To: N/A
UTC Datetime: 1995-09-03 10:04:39 UTC
Raw Date: Sun, 3 Sep 95 03:04:39 PDT
From: Andrew.Spring@ping.be (Andrew Spring)
Date: Sun, 3 Sep 95 03:04:39 PDT
To: cypherpunks@toad.com
Subject: Re: sums with BIG numbers
Message-ID: <v01510102ac6e97a01432@[193.74.217.9]>
MIME-Version: 1.0
Content-Type: text/plain
Deranged Mutant wrote:
>>
>What do you mean? How big numbers are added (trivially easier than
>multiplication
>or division) or how it handles numbers that are too large for the variable's
>size?
and Ray Cromwell wrote :
To add two bignums, P(x) and Q(x) simply sum coefficients of like
terms like you would with any polynomial addition, with one simple
modification. If a_k is the coefficient of the x^k term of P(x), and
etc, etc.
Just a quick clarification, people:
In the UK, and, presumably Australia, "doing sums" refers to performing any
kind of arithmetic, not just addition.
And to Sherry Mayo:
Don't give up on the code, just yet. Try running it and watching it with a
debugger.
Return to September 1995
Return to “Andrew.Spring@ping.be (Andrew Spring)”
1995-09-03 (Sun, 3 Sep 95 03:04:39 PDT) - Re: sums with BIG numbers - Andrew.Spring@ping.be (Andrew Spring)