Euler's Totient Function: what it is and how it works

preview_player
Показать описание
Here I give an overview of Euler's totient function
I give some properties and an example!
My web page:
Рекомендации по теме
Комментарии
Автор

Really great!! I really appreciate the way you explain. Very simple with no complicated words and theoretical messes.

htoonaingaunglwin
Автор

Dr. Günther Zulauf, has solved this conjecture

SchecterWolfe
Автор

Salam Mr.Noureddin Sadawi

You learned me in data mining cource and now you teach me in my security cource

May Allah help you and guide you to jannah

Thanks alot, , All my peace and blessings🙏🏻

f
Автор

Very well done, thank you for taking the time to make this video

MrGQ
Автор

No, it's actually `≤ n`. Sure, most numbers cannot be relatively prime to itself, so it would be unnecessary to test `n`. BUT! it is useful to include `n`, because if `n` is 1, then `GCD(1, 1) = 1`, and `1` is counted, so you don't have to account for it by making a special case that `φ(1) = 1`, it works out of the box ;)

scitwi
Автор

You said in the title that how it works but u failed to prove the properties

vighnesh
Автор

You made me create a "helpful" playlist. liked

owena
Автор

You made me create a "helpful" playlist. liked

owena