Mikescher/www.mikescher.com
1
0
Fork 0
Code Actions Activity

rename statics/euler and sync b93 code with main repo

Browse Source
This commit is contained in:
Mike Schwörer
2017-11-20 17:38:54 +01:00
parent 0efeb3afeb
commit 69e3f51730
409 changed files with 745 additions and 509 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
www/statics/euler/Euler_Problem-070_description.md Normal file
View File

@@ -0,0 +1,9 @@
Euler's Totient function, `phi(n)` [sometimes called the phi function],
is used to determine the number of positive numbers less than or equal to n which are relatively prime to n.
For example, as 1, 2, 4, 5, 7, and 8, are all less than nine and relatively prime to nine, `phi(9)=6`.
The number 1 is considered to be relatively prime to every positive number, so `phi(1)=1`.
Interestingly, `phi(87109)=79180`, and it can be seen that `87109` is a permutation of `79180`.
Find the value of `n`, `1 < n < 10^7`, for which `phi(n)` is a permutation of n and the ratio `n/phi(n)` produces a minimum.