Let. For all
, define
Soand
.
Find![]()
Hello,
Let n be 24
You're looking for
All i<24 with gcd(i,24)=1 are :
1,2,5,7,11,13,17,19,23
Hence
We already knowand
- let's calculate
All i<5 with gcd(i,5)=1 are : 1,2,3,4
---->
------->
![]()
- let's calculate
All i<3 with gcd(i,3)=1 are : 1,2
------->
And so on... It's always the same thing : when there is anyou don't know the value, get the definition, find all the numbers < i and relatively prime with i and continue...
It's kinda hard to type it on a computer... If you really need all the details, i can help you for some following values
Maybe this will help you get started:
1 1
2 1
3 2
4 3
5 7
6 8
7 22
8 32
9 66
10 91
11 233
12 263
13 729
14 1038
15 2059
16 3119
17 7674
18 8666
19 24014
20 32741
I can't promise this is correct; one small mistake would snowball into larger mistakes later.