Fix typos, formatting and thank yous (add links)
In some files changed the formatting was fixed to be a proper markdown file. There were some typos including that some README.md files that linked to /winners.html#Cody_Boone_Ferguson actually linked to the non-existent file /years which obviously would not work. I also added links to the rest of the places I have fixed entries (but see below) and I did the same for Yusuke Endoh's fixes. As well apparently one entry I thought he fixed to compile under modern systems does not seem to so that entry will have to be revisited another time. That entry was 1993/jonth. Those are the main changes here if not all of them.
This commit is contained in:
1 parent
ecaa022948
commit
fa682003eb
24 files changed
+146
-113
No files matched your search
@@ -31,12 +31,12 @@ 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?
|
||||
Can you modify this code to produce primes such as `23523*2^70000-1,
|
||||
48594^65536+1` or `6917!-1`?
|
||||
|
||||
### Alternate code:
|
||||
|
||||
This program prints the biggest known prime number (2^6972593-1)
|
||||
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 !).
|
||||
|
||||
Reference in new issue
Block a user