Fermat's little theorem made easy

[Juwez]

everytime i dont understand something from school i come here, i thank you for making me pass math

[timothywahib]

doing this in year 8 and this is the best video I have seen yet of modular stuff. You actually have a mega sized brain

[BHARATKOTESWARAO]

Seriously man your channel deserves a great popularity. Sadly only 1912 views are there.

[ruzb]

Thank you for these wonderful lessons, I had a real problem with this and now thanks to you I can solve the questions that I had. Kudos !

[JazzieGames]

Super underrated channel, Liked and support! :D I wish there are more people who spend time studying instead of sharing silly videos of popstars gossips

[himanshusamal]

You deserve more subscribers as well as views.

[seijichew]

thank you so much! you're actually carrying me through my math class right now. My class website should just be a shortcut to your youtube channel lol

[katehale]

Simple and to the point explanation. Thank you!

[grjesus]

Can you prove these theorem? It will be very helpful to understand it

[saksham]

You are amazing! You explain so well and simply while making it quick! Great job! I am also showing so many of these videos to explain these topics. Keep it up!

[VatsalRajyaguru]

how did you arrive at 13^18 is congruent to 1 (mod 19)? by manual calculations? how would you advise me to arrive at the 1st step in my exam where you have roughly 2 mins for each question. for example, 29^10767 divided by 23??

[jensjosenius]

Hello Randell, in the video you say "congruent" but displays an "equivalent" sign - I take it, that you display the wrong sign? Otherwise, thanks for your many excellent videos - they are a great help in learning math

[MynameisYk]

Thank you so much for all the videos!! It helped a lot!!! 🙏🙏🙏

[oliverhees]

What's the proof for the theorem and how are the different versions equivalent?

[stx]

Can someone suggest how to solve 11^-5 (mod19) using Fermat's Little Theorem? I am stumped by the format of this particular problem, though I am familiar with the several forms of Fermat's Little Theorem, including solving for the inverse ( ie a ^-1 (mod p) = a^p-2 (mod p), but the given problem has me stumped as I am not sure how to convert to the desired form to pull this off. I assume its a matter of performing algebraic manipulation of powers first but I am not seeing it. Thanks in advance.

[Jaqen_Hghar]

Thanks a lot for this easy explanation...

[JazzieGames]

if a is 1, wouldnt that makes 1^p = 1 mod p?

[ahmadkazaz]

What if the mod is not a prime? what do we do ?

[joeltan]

Your video is minutes long and it doesn’t even write the proof of the theorem? Doesn’t even explain what it’s got to do with prime numbers?