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

2
www/statics/euler/euler_021_explanation.md Normal file
View File

@@ -0,0 +1,2 @@
Most of the time is here spent in the NumberOfDivisors function. So we first cache every possible result of this function (from 0 to 10000).
The rest is simple searching for numbers where a == D(D(a)) and a != D(a).