thank you for saving me from my useless number theory book.
@RandellHeyman
4 жыл бұрын
Glad it helped. More time saving videos at kzitem.info
@yasmin9718
4 жыл бұрын
@@ParamjitSingh-gz3de ok
@HansFlamme
5 жыл бұрын
Impeccable explanation I finally get it, thank you very much sir
@RandellHeyman
5 жыл бұрын
Thanks for taking the time to comment.
@BHARATKOTESWARAO
6 жыл бұрын
wtfffff only 299 views for such a master piece ?? :(
@gorymclorry7414
6 жыл бұрын
3,200 now.
@electrotsmishar
5 жыл бұрын
same question
@parasgathani4784
5 жыл бұрын
20k now
@Man-ds9ir
4 жыл бұрын
33k now
@kumarshanu4524
3 жыл бұрын
44k now
@timothywahib6082
3 жыл бұрын
You are literally the best human on this planet
@RandellHeyman
3 жыл бұрын
Thanks Timothy, hope your mathematics is going well.
@timothywahib6082
3 жыл бұрын
@@RandellHeyman it is thanks to you, I had no idea what I was doing before
@sleeplesshead602
3 жыл бұрын
I'm just a random youtube viewer that is to curious about Euler's Phi. I only got the solution for prime number. Thanks for the explanation. Now I got it.
@RandellHeyman
3 жыл бұрын
I'm glad I could help you.
@conradt.s
5 жыл бұрын
Finally got the sense of Euler's function here..... Good explanation Sir...
@RandellHeyman
5 жыл бұрын
Thanks. You might be interested in the related videos, Euler's theorem made easy, Fermat's little theorem made easy and if you study encryption then RSA code made easy.
@kid5hinobi848
Жыл бұрын
Thank you a bunch. Been trying to solve Liber Primus and I think this will definitely help.
@aishwaryaratnam154
6 жыл бұрын
Hey bro this was exactly a masterpiece.hats off to you.
@RandellHeyman
6 жыл бұрын
Thanks very much.
@monicabrasow5402
4 жыл бұрын
You have a very clean mind! Genius!
@RandellHeyman
4 жыл бұрын
Thanks for such positive comments. I'm glad it helped.
@Imperator-SPQR
5 жыл бұрын
You deserve more views. Thanks for posting
@RandellHeyman
5 жыл бұрын
Thanks Jun, I have other related videos that might be useful: Euler theorem made easy, Fermat's little theorem made easy, etc.
@urajunky
4 жыл бұрын
This guy is the man!!! please take over Deakin Uni maths!
@RandellHeyman
4 жыл бұрын
Thanks for such positive comments.
@_koppy1309
4 жыл бұрын
I remember trying to use the 4th rule and hating it. Loved the simplicity of the first three rules. Just found your videos and wish I had watched them in when I was in college!
@RandellHeyman
4 жыл бұрын
Thanks for letting me know that you found the video helpful.
@leviticus3
2 жыл бұрын
Well explained! Thank you for this.
@ListRav17
5 жыл бұрын
Very well made! Many videos I watch simply mention the end algorithm, but I enjoy using the rules.
@RandellHeyman
5 жыл бұрын
Great. It's better to know the rules for doing more/harder mathematics.
@kibaekim501
2 жыл бұрын
Rule 2 is a generalization of Rule 1. phi(p^1) = p^1 - p^(1-1) = p - 1
@RandellHeyman
2 жыл бұрын
Exactly right. From a teaching view I think it best to have separate rules. Thanks for commenting.
@kneebrain9298
2 жыл бұрын
ahhh i got finals tomorrow and this helps me a lot!! thank you so much 💝💝
@RandellHeyman
2 жыл бұрын
Thanks. Hope the finals go well.
@patrick-cc4yu
4 жыл бұрын
Finally! The 27.8k views you deserve!!!
@RandellHeyman
4 жыл бұрын
Pat, I'm glad it helped you. I have some other related videos if you are interested...euler's theorem made easy, fermat's little theorem made easy, how encryption works, RSA code made easy.
@foobar4938
4 жыл бұрын
@@RandellHeyman Hey man, i never comment. But i had to tell you how thankfull i am for this.
@xbz24
Жыл бұрын
Thanks a bunch❤
@j.vonhogen9650
4 жыл бұрын
Excellent explanation! Thank you so much!
@RandellHeyman
4 жыл бұрын
Thanks for taking the time to comment. I have related videos that also might be useful: Euler's theorem made easy, Fermat's little theorem made easy and if you study encryption then How encryption works and RSA code made easy.
@j.vonhogen9650
4 жыл бұрын
@@RandellHeyman - Thanks, I was already 'binge watching' your videos! Great content, wonderfully explained, greatly appreciated! 😎👍 Greetings from The Netherlands!
@samueldeandrade8535
3 ай бұрын
0:04 no, that's the null sign, the symbol to denote the empty set. Phi is something else.
@RandellHeyman
3 ай бұрын
You are correct. I think at the time I just used what was in Word. But that's no excuse. Thx for pointing it out.
@samueldeandrade8535
3 ай бұрын
@@RandellHeyman hehe. That's nice. I really don't care about the notation, you did a good job. Keep doing it. We need good math content creators.
@arizonajterm3984
6 жыл бұрын
Thanks. This is a great video, but is there a function that takes into account all the things you take for granted in these rules? For example, you for 600, what's the function you used to figure out that you could use 2^3 * 3 * 5^2... Also, 41 is easy to identify as a prime, but what about large numbers that you may not be sure if they are prime... just curious about your thoughts on that. Thanks.
@RandellHeyman
6 жыл бұрын
Arizona Jterm There are algorithms for factoring large numbers into its divisors and for determining if a number is prime. Factoring large numbers is a slow process for very large numbers. Amazingly this slowness has been turned into an adantage (in cryptography) using the euler totient function. See my videos 'how encryption works' and then my other video 'RSA code made easy'.
@ropafadzomaseko7135
5 жыл бұрын
super easy to understand ,,,l loved it explained better than my lecturere would have :-)
@RandellHeyman
5 жыл бұрын
Thanks. I also have videos on related topics if/when you need them: euler's theorem made easy and fermat's little theorem made easy.
@RajdeepBarman
3 жыл бұрын
I found a gem of a tutorial
@RandellHeyman
3 жыл бұрын
Thanks for the comment.
@stevenwilson5556
4 жыл бұрын
for phi(p^n) = p^n - p^(n-1), doesn't that equal (p^n)*[ (p-1)/(p)] ? Example phi(2^3) = 2^3 - 2^2 = 8-4 or (8 * (2-1)/2). And phi(3^2) = 9 - 3 = 9*[ (3-1)/3 ], phi(5^3) = 125 - 25 = 125 * [(5-1)/5]… am I wrong or doesn't this pattern hold in general?
@RandellHeyman
4 жыл бұрын
You are correct. Also p^n-p^(n-1)=p^(n-1)[p-1].
@Abdulaziz-fg3mh
5 жыл бұрын
THANK YOU!
@kin1600
3 жыл бұрын
Thank you sir🙏
@PETAJOULE543
5 жыл бұрын
Great explanation about euler totient function that is simply amount of gcds' that gcd=1.
@RandellHeyman
5 жыл бұрын
Thanks
@sonic10ultimate
4 жыл бұрын
Amazing, thanks
@RandellHeyman
4 жыл бұрын
Thanks for your comment. I have related videos on Euler's theorem, Fermat's little theorem, How encryption works and RSA code that might also be useful to you at some stage.
@sonic10ultimate
4 жыл бұрын
@@RandellHeyman Thank you, I'll probably end up watching ones related to RSA
@divinetakawira5420
5 жыл бұрын
What a masterclass.
@RandellHeyman
5 жыл бұрын
Thanks for the positive feedback.
@regenciaamiragracer.4524
3 жыл бұрын
Thank you very much.
@RandellHeyman
3 жыл бұрын
Thanks. Lots of related videos on my channel
@user-gx9lr2mh2i
3 жыл бұрын
great video. thank you!
@RandellHeyman
3 жыл бұрын
I'm glad it helped you.
@moppop275
4 жыл бұрын
Thank you for the video, i found it useful!
@RandellHeyman
4 жыл бұрын
Thanks for letting me know :)
@DaveandEm2000
6 жыл бұрын
Thanks for making this video. It helped me out alot.
@RandellHeyman
6 жыл бұрын
Glad it helped.
@leaha2357
4 жыл бұрын
Brilliant explanation, so clear :)
@RandellHeyman
4 жыл бұрын
Thanks. I have some related videos, e.g. Euler's theorem made easy, Fermat's little theorem made easy, RSA code made easy.
@JannisAdmek
5 жыл бұрын
thank you soo much, guys like you make my life easy :D
@RandellHeyman
5 жыл бұрын
Thanks. I have a few related videos: fermat's little theorem made easy and eulers theorem made easy. For use in cryptography there is RSA code made easy.
@JannisAdmek
5 жыл бұрын
Randell Heyman I am on a marathon through your channel, amazing
@abdibaqihassanomar5900
5 жыл бұрын
Thanks Mr it helped me a lot to understand phi functions but still i confuse Fermat's Theorem and Euler's Theorem
@RandellHeyman
5 жыл бұрын
Have a look at my videos Euler's theorem made easy and Fermat's little theorem made easy.
@gigispace
4 жыл бұрын
thank you!
@RandellHeyman
3 жыл бұрын
As we say in Australia...no worries. Thanks.
@clive_clive
5 жыл бұрын
great video
@RandellHeyman
5 жыл бұрын
Thanks for the positive feedback. I have a few related videos: Euler's theorem made easy, Fermat's little theorem made easy.
@pradyundevarakonda6849
5 жыл бұрын
Thank you sir, you really made it easy.
@RandellHeyman
5 жыл бұрын
Thanks. I have related videos on Euler's theorem, Fermat's little theorem, how encryption works and RSA code if you need them.
@renumehra4619
3 жыл бұрын
amazing…Thank you!
@RandellHeyman
3 жыл бұрын
Thanks. Many relayted videos in my University mathematics and Coron help playlists.
@shakeeljessa9619
6 жыл бұрын
Very helpful, thank you!
@RandellHeyman
6 жыл бұрын
Shakeel Jessa Glad it helped.
@Akkryon
4 жыл бұрын
3301
@giovannimoncada1945
4 жыл бұрын
thank you ❤
@RandellHeyman
4 жыл бұрын
Giovanni, I'm glad it helped you. Related videos on my channel...euler's theorem made easy, fermat's little theorem made easy, how encryption works, RSA code made easy.
@debjitkhaskel7879
6 жыл бұрын
Really Liked It and helpful :)
@debjitkhaskel7879
6 жыл бұрын
correct
@RandellHeyman
6 жыл бұрын
Thanks. I recently uploaded related videos Euler's theorem made easy and Fermat's little theorem made easy.
@sumitjha392
6 жыл бұрын
Thank you sir, that helped :)
@RandellHeyman
6 жыл бұрын
Sumit Jha Glad it helped. I'll probably have a video on euler's theorem (which uses the euler totient function) soon.
@ivandrofly
4 жыл бұрын
3:43
@electrotsmishar
5 жыл бұрын
awesome
@RandellHeyman
5 жыл бұрын
Thanks for letting me know.
@khadijakhan7770
5 жыл бұрын
nice
@RandellHeyman
5 жыл бұрын
Thanks. I have 2 related videos: Euler's theorem made easy and Fermat's little theorem made easy.
@alainrogez8485
4 жыл бұрын
I am confused because you prove nothing.
@RandellHeyman
4 жыл бұрын
This was to help people with the standard test / exam questions like calculate phi(100). If you are having trouble proving something let me know.
Пікірлер: 104