Re: Big integer arithmetic

From: rossum (rossum48_at_coldmail.com)
Date: 06/22/04


Date: Mon, 21 Jun 2004 23:37:52 +0100

On Mon, 21 Jun 2004 21:47:38 +1000, Richard Cavell
<richardcavell@mail.com> wrote:

>Hi,
>
>I want to use some big integers (like 2 to the power 1024) to do some
>arithmetic using really large primes. I have Windows/Visual C++, Mac
>OSX/gnu/XCode and Linux at my disposal.
>
>Now, this is how I see the options:
>
>1. Create my own big integer class - I can do it, but it re-invents the
>wheel, runs the risk that I will make errors that I'll not find, and
>also runs the risk that I simply won't do it as well as those already
>invented.
>
>2. There is (according to web sources) a built in gcc class called
>Integer. However, my Mac version of gcc doesn't compile any code with
>"Integer" undeclared.
>
>3. GNU MP seems promising. I've built it for my Mac G4, into its own
>directory. Now, being a UNIX/gcc novice, I can't compile any of the
>test GNU MP programs using XCode. It won't build anything without a
>project file, and if I create a dummy project file it can't find all the
>#included files.
>
>I've been trying for weeks to do this. How much would it cost me to get
>a programmer to make me a project (VC or XCode) which can compile and
>run a basic test program using arbitrarily large integers? How do I
>hire someone to do this?

If you are interested in Prime Numbers then you need a copy of
Crandall and Pomerance. Richard Crandall also has a company, and its
website offers free large integer software:
http://www.perfsci.com/freegoods.htm#giant

If you are really interested in spending money then the company also
does consultancy work, but I suggest that you investigate the free
software first.

rossum

--
The Ultimate Truth is that there is no Ultimate Truth


Relevant Pages

  • Re: Big integer arithmetic
    ... >also runs the risk that I simply won't do it as well as those already ... Now, being a UNIX/gcc novice, I can't compile any of the ... >project file, and if I create a dummy project file it can't find all the ... The Ultimate Truth is that there is no Ultimate Truth ...
    (comp.programming)
  • Re: Big integer arithmetic
    ... > wheel, runs the risk that I will make errors that I'll not find, and ... > also runs the risk that I simply won't do it as well as those already ... Now, being a UNIX/gcc novice, I can't compile any of the ... > project file, and if I create a dummy project file it can't find all the ...
    (comp.programming)
  • Re: Big integer arithmetic
    ... > wheel, runs the risk that I will make errors that I'll not find, and ... > also runs the risk that I simply won't do it as well as those already ... Now, being a UNIX/gcc novice, I can't compile any of the ... > project file, and if I create a dummy project file it can't find all the ...
    (sci.crypt)
  • Re: Big integer arithmetic
    ... > wheel, runs the risk that I will make errors that I'll not find, and ... > also runs the risk that I simply won't do it as well as those already ... Now, being a UNIX/gcc novice, I can't compile any of the ... > project file, and if I create a dummy project file it can't find all the ...
    (comp.programming)
  • Re: Big integer arithmetic
    ... > wheel, runs the risk that I will make errors that I'll not find, and ... > also runs the risk that I simply won't do it as well as those already ... Now, being a UNIX/gcc novice, I can't compile any of the ... > project file, and if I create a dummy project file it can't find all the ...
    (sci.crypt)