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-049_explanation.md
View File

@@ -5,6 +5,6 @@ This is only an approximation, but a rather good one. In tested the numbers from
So now we've got the numbers where `digit_product(p) == digit_product(p+3330) == digit_product(p+6660)` (in fact there are only 40 of these).
We then use a simple primality test to check if all three numbers are prime.
The primality test is basically a port of the [wikipedia](http://en.wikipedia.org/wiki/Primality_test) version to befunge. Wit it we only have to do `n/6` divisions to test a number `n` for primality.
The primality test is basically a port of the [wikipedia](https://en.wikipedia.org/wiki/Primality_test) version to befunge. Wit it we only have to do `n/6` divisions to test a number `n` for primality.
All in all tis leads to a fast, small and not very grid-intensive program (Only one field is used, *and only as a temporary storage to swap three values*).