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_056_explanation.md Normal file
View File

@@ -0,0 +1,7 @@
Here we iterate through the values of a (1..99) and do (manually) the long multiplication.
Because we have to implement the multiplication manually we get every result from a^1 to a^99 an can easily get the digitsum for these.
Then we remember the maximum digitsum and vòila, problem solved.
A few optimizations:
- We ignore values where `a%10 == 0`, because these result in numbers consisting mostly of zeroes, and those will never have a high digitsum
- We also ignore values for a<45, because the numbers are just to short to be really significant.