Euler's Totient Function Number Theory 13

preview_player
Показать описание
⭐Support the channel⭐

⭐my other channels⭐

⭐My Links⭐
Рекомендации по теме
Комментарии
Автор

for checking n=12 is easier to say that 12 isnt a power of 3

ezequielangelucci
Автор

Does professor Michael penn use group theory to prove the properties of Euler totient function?

conanedojawa
Автор

@ 17:47 Didn't you mean to say "There are no primes that divide c*y and m" instead of "There are no primes that divide c*y and c*m"? And @ 19:53 didn't you mean to say "We added this version of 0" instead of " We multiplied this version of 0"?

krisbrandenberger
Автор

For the second warmup problem, I got n=22, 30, 33, 66. I’m not entirely sure that’s correct, someone please check if you feel so inclined!

synaestheziac