filmov
tv
Eulers Totient or phi function and coprime factors

Показать описание
This video discusses Euler's Totient function or otherwise known as Eulers Phi function.
Eulers Totient function , denoted by phi(n) , tells how many coprime factors the integer (n) has .
For example phi(9) = 6 coprime factors are 1,2,4,5,7,8 .
We also use the product function (Capital Pi)which uses the prime factors which would give us 9x2/3=6 .
this works for all other larger numbers for example 128 = 2 to the power of 7 . Hence the product function now gives us 128 x 1/2 = 64 hence all the odd numbers from 1 to 128 of which there are 64 .
#eulerstheorem
#euler
#productfunction
#algebratricks
#numbersystem
#mathematicsanalysis
#mathematicsclasses
#primefactors
#primefactorisation
#calc3
#calculus3
Eulers Totient function , denoted by phi(n) , tells how many coprime factors the integer (n) has .
For example phi(9) = 6 coprime factors are 1,2,4,5,7,8 .
We also use the product function (Capital Pi)which uses the prime factors which would give us 9x2/3=6 .
this works for all other larger numbers for example 128 = 2 to the power of 7 . Hence the product function now gives us 128 x 1/2 = 64 hence all the odd numbers from 1 to 128 of which there are 64 .
#eulerstheorem
#euler
#productfunction
#algebratricks
#numbersystem
#mathematicsanalysis
#mathematicsclasses
#primefactors
#primefactorisation
#calc3
#calculus3