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

6
www/statics/euler/euler_070_explanation.md Normal file
View File

@@ -0,0 +1,6 @@
The solution is practically identical to the one from [Mathblog](http://www.mathblog.dk/project-euler-70-investigate-values-of-n-for-which-%CF%86n-is-a-permutation-of-n/).
But Kristian explains it much better than I :).
We use our trustworthy [Sieve of Eratosthenes](https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes) snippet and the *GetCombinatoricHash*-function from problem-62
The rest was straight-forward and not really that interesting.