Re: Appoximating large numbers

"Julian V. Noble" <jvn@xxxxxxxxxxxx> wrote in message
The simplest method is to use a large base (or radix). I suggest
you read Knuth, "The Art of Computer Programming" for how to do
long-integer arithmetic. I am familiar with a package, "bignum",
but it is written in Forth which you probably don't know. But
I am sure analogous packages exist for C or Fortran. Google!

I guess I am doing an incredibly poor job of explaining my intention...

I am using the Ruby programming language which has support for Bignum. I
don't have any problems _working_ arithmetically with large integers. I am
asking if there exists any method/algorithm to help me find an ALTERNATE
representation of a large integer.

(e^6)^5 is an ALTERNATE representation for 10,629,803,243.

If I could figure out alternate representations for my huge (100+ digit)
integers I could use those representations to recreate those integers on the
fly - I would not have to carry around the original integers.

The techniques I have tried thus far are: simple factoring, prime factoring,
simulated anealing, etc.

If this isn't the correct group for this question please just let me know.

Thanks,
BT



.

Relevant Pages

  • Re: Appoximating large numbers
    ... "The Art of Computer Programming" for how to do ... I am familiar with a package, "bignum", ... ALTERNATE representation of a large integer. ... The techniques I have tried thus far are: simple factoring, ...
    (sci.math.num-analysis)
  • Re: Appoximating large numbers
    ... "The Art of Computer Programming" for how to do ... I am familiar with a package, "bignum", ... I am asking if there exists any method/algorithm to help me find an ALTERNATE representation of a large integer. ... The techniques I have tried thus far are: simple factoring, prime factoring, simulated anealing, etc. ...
    (sci.math.num-analysis)
Quantcast