Mikescher/www.mikescher.com
1
0
Fork 0
Code Actions Activity

statics data

Browse Source
This commit is contained in:
Mike Schwörer
2017-11-08 17:39:50 +01:00
parent 11a38315cd
commit faee825af9
532 changed files with 8189 additions and 99 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
www/statics/euler/euler_058_explanation.md Normal file
View File

@@ -0,0 +1,4 @@
It's obvious that the bottleneck of this program is the primality test.
The numbers become here too big to create a sieve and "normal" prime testing takes too long.
So we use the [Miller-Rabin primality test](http://en.wikipedia.org/wiki/Miller-Rabin_primality_test) that I implemented a while ago (thank [mathblog.dk](http://http://www.mathblog.dk)).
The rest is just enumerating all the diagonals until `primes*10<all`