Cody Boone Ferguson
489a5df2bf
I am aware of some entries that do not compile that I haven't even thought about fixing yet. I also need to use my linux box to test the X11 entries (this goes for other years as well) but that'll come at another time as I rarely am at sitting at that computer. But the README.md files should be in a better state.
Most Specific Output:
Fabrice Bellard
451 chemin du mas de Matour
34790 Grabels
France
http://www.enst.fr/~bellard
To build:
make
To run:
./bellard
Try:
Do. Or do not. There is no try. :-)
Judges' comments:
This code is an nice compact example of a Modular Fast Fourier Transform. While its output is very specific, the internal FFT has a wide variety of uses.
Can you modify this code to produce primes such as 23523*2^70000-1, 48594^65536+1 or 6917!-1?
Alternate code:
This program printed the biggest known prime number (2^6972593-1) in base 10. It requires a few minutes. It uses a Modular Fast Fourier Transform to compute this number in a reasonable amount of time (the usual method would take ages !).
The program uses >= 64 bit 'long long' type. It should run on any system with a gcc compiler.