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

replace mathblog.dk links with waybackmachine
All checks were successful
Build Docker and Deploy / Build Docker (push) Successful in 45s
Details
Build Docker and Deploy / Deploy to Server (push) Successful in 19s
Details

Browse Source
This commit is contained in:
Mike Schwörer
2025-03-30 23:43:38 +02:00
parent be1c44ffc6
commit ba579dab23
8 changed files with 9 additions and 9 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](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 (thanks [mathblog.dk](https://web.archive.org/web/20150314052138/http://www.mathblog.dk/project-euler-58-primes-diagonals-spiral/)).
The rest is just enumerating all the diagonals until `primes*10<all`