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

fix https links

Browse Source
This commit is contained in:
Mike Schwörer
2018-02-03 16:50:58 +01:00
parent f7111555a0
commit 2bb453132f
30 changed files with 59 additions and 59 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -1,4 +1,4 @@
If you looked at the previous problems you probably know what comes now ... (Sieve of Eratosthenes)[http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes].
If you looked at the previous problems you probably know what comes now ... (Sieve of Eratosthenes)[https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes].
To lower the amount of A-B combinations we have to check here are 2 rules I found out:
- `B` must be a (positive) prime, otherwise n=0 wouldn't yield a prime number