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

fix broken links

Browse Source
This commit is contained in:
Mike Schwörer
2018-02-03 18:45:51 +01:00
parent 77a879294a
commit 1ee2563efc
12 changed files with 15 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
www/statics/euler/Euler_Problem-058_explanation.md
View File

@@ -1,4 +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](https://en.wikipedia.org/wiki/Miller-Rabin_primality_test) that I implemented a while ago (thank [mathblog.dk](https://http://www.mathblog.dk)).
So we use the [Miller-Rabin primality test](https://en.wikipedia.org/wiki/Miller-Rabin_primality_test) that I implemented a while ago (thank [mathblog.dk](http://www.mathblog.dk)).
The rest is just enumerating all the diagonals until `primes*10<all`