Тёмный

Modular exponentiation 

GVSUmath
Подписаться 13 тыс.
Просмотров 282 тыс.
50% 1

Using the repeated squaring algorithm to calculate 2^300 mod 50.

Хобби

Опубликовано:

 

27 окт 2014

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 173   
@VFXCommander
@VFXCommander 8 лет назад
Perfect explanation, despite the twitching.
@richardblack1588
@richardblack1588 7 лет назад
Diego de la Vega flickering
@Peachyj06
@Peachyj06 6 лет назад
spasming
@Pixelynx
@Pixelynx 6 лет назад
orgasiming Wait... What were we doing?
@SurajKumar-bw9oi
@SurajKumar-bw9oi 4 года назад
glitching
@arampathkushan2861
@arampathkushan2861 3 года назад
tweaking
@outlaws9295
@outlaws9295 7 лет назад
Besides the occasional issues with the video itself, this was a very great demonstration. Excellent job!
@fzndn-xvii
@fzndn-xvii 7 лет назад
When a RU-vid video explains explains better than your professor. Thanks!
@rcollins0618
@rcollins0618 8 лет назад
Such a simple demonstration really beats trying to learn this from just reading formal notation. thank you very much! (I often have this trouble with discrete math - it's not hard stuff, I just get caught up in keeping all the variables in my head).
@outlaws9295
@outlaws9295 7 лет назад
Exact same issue here, man. I took one look at this process (or at least a very similar one) in my textbook and it made little to no sense. Once I saw this video, the process became crystal clear. I know that the formal notation is mathematically correct, but it's usually not the best way to demonstrate a concept for the first time.
@amarthya.t9842
@amarthya.t9842 5 месяцев назад
Even after 9 years of upload this is just great demonstration. thank you mate.
@joshuagroeschl7001
@joshuagroeschl7001 2 года назад
This is most stupendous indeed, I was struggling with this conceptually for some time before stumbling across this video. I appreciate you for taking the time to curate these works! Excellent example and explanation.
@alexisreynolds4277
@alexisreynolds4277 Год назад
Finally a good example! I looked at so many videos that didn't help before finding this one. Thank you!
@psychedelicfungi
@psychedelicfungi 9 лет назад
One very helpful video! Thanks! (Unfortunately the screen flicker was really distracting)
@sampugh6404
@sampugh6404 5 лет назад
This just saved me on security homework. Thank you so much. Very cool concept
@FRANCISCORODRIGUEZ-vq2jj
@FRANCISCORODRIGUEZ-vq2jj 6 лет назад
my professor wasn't able to teach me in a 3 hour class period what you just taught me in 11 min and 36 seconds. thank you so much!
@ZacMitton
@ZacMitton 4 года назад
Or 5 minutes at 2x speed
@ianchen1962
@ianchen1962 4 года назад
@@ZacMitton haha
@ko-Daegu
@ko-Daegu 2 года назад
@@ZacMitton I watched at 1.5 while skipping
@MyOneFiftiethOfADollar
@MyOneFiftiethOfADollar 9 месяцев назад
The difference is you did not sleep during this video AND of course it was your professor's fault for not being able to keep you awake. Be accountable for your own learning outcomes rather than blaming others.
@terriblast8076
@terriblast8076 7 лет назад
One of the best tutorial I've watch..You discuss well
@deano50z
@deano50z 5 лет назад
Excellent video, followed along with a notepad and pen and understood it less than 10 mins later. Thanks pal!!
@alexrobert4614
@alexrobert4614 5 лет назад
Best tutorial out there. My prof sucks. Took me 2 days to understand fully. Thank you
@jsteezeful
@jsteezeful 4 года назад
This is so good it also makes me question my professor and their pathetic book that tries to explain this in 2 paragraphs.
@yaggikjalan
@yaggikjalan 3 года назад
This helped me so much for rsa algorithm questions! Thanks a million ☺
@NOSHEDMANTIS
@NOSHEDMANTIS 7 лет назад
Great Video, clear explanation and good audio quality (essential).
@simonliu2268
@simonliu2268 7 лет назад
Amazing thank you very much, I didn't understand my professors abbreviation of this, but you did a very VERY good job.
@monowar6723
@monowar6723 6 лет назад
Thanks a lot ! i will remember this video for the rest of my life.
@tonychen1083
@tonychen1083 7 лет назад
Thank you for your excellent explanation!
@memento_mori6019
@memento_mori6019 5 лет назад
Excellent breakdown. Thank you.
@SpookyRumi
@SpookyRumi 2 года назад
Amazing! You saved me so much time with this
@harley3514
@harley3514 Год назад
Thank you, other videos on this were not making sense for me, but this did
@kdpoint4221
@kdpoint4221 5 лет назад
it took 3h to get a perfect explanation..... thanks a lot
@JoseSanchez-vv1zd
@JoseSanchez-vv1zd 7 лет назад
Great job! Thanks for the clear explanation! :)
@KoksMOks
@KoksMOks 3 года назад
that alg is amazing AF
@shinwoo_park
@shinwoo_park 4 года назад
it helps me a lot! thank you sir. What a nice lecture
@costerchimbwanda3936
@costerchimbwanda3936 9 лет назад
saw the screen flickering..thought t was a problem with my pc..anyway was a great illustration
@ianchen1962
@ianchen1962 4 года назад
dang that's so cool. Learned a lot from this
@user-vq1ef8kn9m
@user-vq1ef8kn9m 6 лет назад
That was an awesome explanation. Solved my problem~.
@vineet1034
@vineet1034 8 лет назад
what happen if base is 132 or bigger
@sebastianrauch2758
@sebastianrauch2758 3 года назад
Thanks for the good explanation. Realy helped a lot. :D
@aries3690
@aries3690 2 года назад
Thank you so much for your clear explanation!
@Th1sUsernameIsNotTaken
@Th1sUsernameIsNotTaken 4 года назад
Thank you for this! other video's I've seen just completely skip steps or don't explain. Can't get a meeting with my teacher for a few days (online learning) and the book didn't explain any of the random jumping it was doing (didn't do steps, just jumped to the "solved" part). Now I can actually practice lol.
@RobinDuda
@RobinDuda 2 года назад
Beautiful.
@hardinrami8500
@hardinrami8500 4 месяца назад
Thank you for the explanation! It took me a while to get it though.
@DVRhm25
@DVRhm25 2 года назад
I watched this drunk. It all makes sense. Nice work prof!
@krgaming1650
@krgaming1650 4 года назад
Thank you, you saved my grade on today's exam.
@KhandkarAsifHossain
@KhandkarAsifHossain 4 года назад
Awesome video. But I am having trouble finding the mod with high base number such as 26^37 mod 77 can u help with that. 26^8 seems to pose a problem.
@swordclash6618
@swordclash6618 5 лет назад
The explanation is A+ but the screen flickering almost made me go nuts.
@mdmuktadirmazumder284
@mdmuktadirmazumder284 3 года назад
love you 3000mod3000
@EndietheEnderman
@EndietheEnderman 4 месяца назад
Helped heaps! Thanks
@b34amanahmed
@b34amanahmed 8 месяцев назад
He is brilliant and excellent Once look into this u will find ur solutions
@stephaniagambaroff820
@stephaniagambaroff820 5 лет назад
excellent explanation! Thank you.
@shailendrakumar3130
@shailendrakumar3130 5 лет назад
Thanks man, searching for this information from mornimg
@stea27
@stea27 7 лет назад
Very informative, easy to understand it in your demonstration. Thank you!
@rafsanjanimuhammod309
@rafsanjanimuhammod309 8 лет назад
Really Nice One, Sir !!!
@priyankmungra29
@priyankmungra29 3 года назад
nice explanation. Thank you for your efforts.
@anhminhtran3438
@anhminhtran3438 5 лет назад
Very well explained. Thank you
@matkenis3013
@matkenis3013 5 лет назад
I was looking for modular exponentiation explanation all over youtube and it all pretty much was garbage. Thank you for actually explaining things ffs :)
@jonty3551
@jonty3551 4 года назад
Great explanation man..... appreciate it🤝👍
@ayaanpuri5697
@ayaanpuri5697 4 года назад
lots of really large exponents' modulos are equal to 1 by fermat's little theorem
@mohammadahmedragab837
@mohammadahmedragab837 2 года назад
great explanation. please, in the last part of the video, Why 3751 mode 50? Should 3751 the answer of 3^200 mode 50 ? I need to understand this more
@Sahandkeshavarz
@Sahandkeshavarz 6 лет назад
how would i do that if my exponent is greater than 255 then i wont be able to convert to binary
@rajatsingh8143
@rajatsingh8143 Год назад
best explanatioon in the world saved me for exam
@MichelleVo
@MichelleVo 9 лет назад
How did you figure out the binary for 200 from scratch?
@kriswalsh1020
@kriswalsh1020 2 года назад
On the step where you do 200+128+64+8 how'd you get the 64 and 8. I have a question similar but it's 221.
@tinkerbajwa
@tinkerbajwa 2 года назад
wow I understood it right away! Thankyou so much...
@SitWithItBob
@SitWithItBob 2 года назад
This helped a lot, thanks!
@directx872
@directx872 4 года назад
This is so fucking awesome. I now have *the power to compute*
@jiaxinli1674
@jiaxinli1674 4 года назад
Thanks for saving my ICS 6D
@dialamark7863
@dialamark7863 4 года назад
I loved it. Thank you
@navyakakarlapudi6126
@navyakakarlapudi6126 6 лет назад
Nice explanation sir.Thank u so much......
@Chriib
@Chriib 6 лет назад
Cool trick. I will use this trick on my exam today.
@larsmees4952
@larsmees4952 4 года назад
Wouldn't it be faster to first perform a modular division using the same value (50) on the exponent? 2^(200 mod 50) = 2^0 = 1 Or is this just a coincidence?
@ninjanothing8343
@ninjanothing8343 3 года назад
Thank you very much! Very helpful
@owaisali995
@owaisali995 4 года назад
really thankfull for this video.. great explanantion...
@EasiestTutor
@EasiestTutor 9 месяцев назад
thank you rhabk you i was struggling this was best and easiest
@ketanbhalerao1795
@ketanbhalerao1795 6 лет назад
Damn Good ! Thanks a Bunch, man !!
@maidul13
@maidul13 4 года назад
Thank you!
@ScotMatson
@ScotMatson 9 лет назад
This video is so thorough and one of the better ones I have come across but that screen flicker practically ruins it for me, it is really dizzying by the end. Such a shame! Thanks for taking the time to put this together otherwise, my book cannot nearly present this concept in such a clean fashion as you have here.
@ericstroud1
@ericstroud1 6 лет назад
Great video!
@nikhilchoudhary277
@nikhilchoudhary277 4 года назад
WOOOOOWWWWW! What an Explainantion
@zanonymousruiz9697
@zanonymousruiz9697 3 года назад
This saved my entire ass- Thanks!
@Just_an_alien1
@Just_an_alien1 5 лет назад
Helped me a lot thank you
@AlexandrBorschchev
@AlexandrBorschchev 4 года назад
Im grade 9 learning this for a math contest. It looks crazy useful and really really cool, i want to know how to master this. Thank you for the video.
@AlexandrBorschchev
@AlexandrBorschchev 2 года назад
haha, cool story buddy.
@DanielVazquez
@DanielVazquez 5 лет назад
Is there a shorter way? I mean, I just had a test and I was expected to solve 2^75 (mod 73) in one minute or so.
@tanishqraina3656
@tanishqraina3656 5 лет назад
Well go ahead and use binomial theorem
@subizsunuwar7068
@subizsunuwar7068 5 лет назад
thanks sir ....it's help me, while calculating encryption of msg.
@MotorHeadTech
@MotorHeadTech 8 лет назад
I don't get the 31 and 11 parts I get everything else tho please help
@meysamamini9473
@meysamamini9473 3 года назад
Was very vary useful Thanks a Lot !
@stanger8992
@stanger8992 5 лет назад
Ok that is kinda obvious but i have an exam soon where i will have to calculate 30 of such numbers without using calculator, and it has to take max 10 min because it's one of 18 excersises on that exam. How do i go about solving for example 33^350 mod 7 in 20 seconds, using only pen and paper?
@ramkumarnj7617
@ramkumarnj7617 6 лет назад
Excellent!
@beasty45
@beasty45 9 лет назад
Thank you , Thank you, Thank you!!!!
@rishabhbharti7491
@rishabhbharti7491 6 лет назад
Crystal clear.
@lilbpack2100
@lilbpack2100 5 лет назад
brilliant. thank you!!
@sindisiwemncube4665
@sindisiwemncube4665 4 года назад
How did you get that binary number? 11001000?
@hungryghost5589
@hungryghost5589 5 лет назад
great video, thanks
@iuseyoutubealot
@iuseyoutubealot Год назад
u are a legend
@cbabrunal
@cbabrunal Год назад
In a few minutes you explain what my university professor couldn't in months
@wideputin6586
@wideputin6586 4 года назад
What if the power is a big prime number
@masutthe_gooner3356
@masutthe_gooner3356 2 года назад
What if the power is too long what then?
@urensoft6662
@urensoft6662 8 лет назад
you are just awesome...
@AkshayAradhya
@AkshayAradhya 9 лет назад
Would have liked the video if it wasnt for the flickering. Please use a better screen cast cause you teach really well and that shouldnt be spoiled by some flickering screen.
@syednawaid6980
@syednawaid6980 8 лет назад
nice explanation.....
@zaferkhourdaji1958
@zaferkhourdaji1958 6 лет назад
Best Explanation
@figurativelyrazzmatazz7656
@figurativelyrazzmatazz7656 4 года назад
I don't understan why you replaced the 3^8 with 31, why are they the same?
@diegoi1313
@diegoi1313 5 месяцев назад
Thanks!
@TariqAbdulGhani-kt1nk
@TariqAbdulGhani-kt1nk Год назад
very helpful thank u🙂
@jeanantazo7746
@jeanantazo7746 6 лет назад
what happen in 3751?
@snotface8
@snotface8 4 года назад
Fuck, this was beautiful... I have to say thank you!
@jeffryyapin1399
@jeffryyapin1399 9 лет назад
One Question How about if the exponent was smaller then 128. for example 120 did we need to know the 128bit??
@sgut1947
@sgut1947 9 лет назад
+Jeffry Yapin No, you don't need the 128, because 120 = 64+32+16+8 (binary 1111000). In general, you only need up to the power of two that's less than the required exponent.
Далее
Square & Multiply Algorithm - Computerphile
17:35
Просмотров 274 тыс.
The Unusual Mathematics of Modular Division
14:51
Просмотров 8 тыс.
Solving Linear Congruences, Modular Arithmetic
11:33
Просмотров 167 тыс.
Extended Euclidean Algorithm Example
14:50
Просмотров 307 тыс.
Binary Exponentiation
15:13
Просмотров 97 тыс.
Modular Exponentiation (Part 1)
10:20
Просмотров 328 тыс.
The SAT Question Everyone Got Wrong
18:25
Просмотров 12 млн
Modular exponentiation made easy
6:01
Просмотров 89 тыс.
An Exact Formula for the Primes: Willans' Formula
14:47
Basics of Modular Arithmetic
18:39
Просмотров 58 тыс.
Фонтанчик с черным…
1:00
Просмотров 8 млн