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

12
www/statics/euler/Euler_Problem-072_description.md Normal file
View File

@@ -0,0 +1,12 @@
Consider the fraction, `n/d`, where `n` and `d` are positive integers.
If `n<d` and `HCF(n,d)=1`, it is called a reduced proper fraction.
If we list the set of reduced proper fractions for `d <= 8` in ascending order of size, we get:
~~~
1/8, 1/7, 1/6, 1/5, 1/4, 2/7, 1/3, 3/8, 2/5, 3/7, 1/2, 4/7, 3/5, 5/8, 2/3, 5/7, 3/4, 4/5, 5/6, 6/7, 7/8
~~~
It can be seen that there are 21 elements in this set.
How many elements would be contained in the set of reduced proper fractions for `d <= 1,000,000`?