1
0
www.mikescher.com/www/statics/euler/Euler_Problem-070_explanation.md
Mike Schwörer ba579dab23
All checks were successful
Build Docker and Deploy / Build Docker (push) Successful in 45s
Build Docker and Deploy / Deploy to Server (push) Successful in 19s
replace mathblog.dk links with waybackmachine
2025-03-30 23:44:41 +02:00

6 lines
491 B
Markdown

The solution is practically identical to the one from [Mathblog](https://web.archive.org/web/20150326005645/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.