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

7
www/statics/euler/euler_052_explanation.md Normal file
View File

@@ -0,0 +1,7 @@
To be a permutation all six numbers have to have the same digit count. So `digitcount(x) == digitcount(x*6)`.
This for each number of digits only given for the numbers from `10^n` to `10/6 * 10^n`.
We perform the permutation check with an modified version of the algorithm used in problem-49 *(product of all digits plus two)*.
But we generalise the code to work with every number of digits.
And because we greatly limited the amount of numbers to search and the permutation test is pretty fast this is all we need to do (except run the code).