I am Spanish (I am using GTranslate for this comment), and I have a lot to thank for this video. It has helped me more than my university's own to understand how to solve the fast exponentiation algorithm. A lot of thanks!
Thank you very much for showing us this easier way to find modulus. Before that, we could not practice text encrypting algorithms using C++. But now we can.
There is a rule if a mod b congurent c d mod b congurent e ad mod b congurent ce 240mod14 (14 × 10 + 14 × 5 + 14 × 2 = 238) congurent 2 240×240mod14 congurent 2×2
There are infinite zeros before every binary expansion of an integer, but they are just not written because they carry no information. It follows that the first column will always be one, for all numbers other than zero. For a concrete example take the number twenty. I can write it 20 or 020 and it represents the same integer. Analogously I can write 010(base b) and 10(base 2) and they have the same value.
37600^15943 MOD 37673 is 48 Finally I am able to use a calculator to calculate the result, and it is tally with result obtained from software PowerMod calculator.
I am Spanish (I am using GTranslate for this comment), and I have a lot to thank for this video. It has helped me more than my university's own to understand how to solve the fast exponentiation algorithm. A lot of thanks!
i am also here to learn the how to calculate mod of a power for an algorithm
Thank you so much. I had to use this method for my cryptography class and yours is the only video that explained it well.
Thank you thank you thank you mam i have seen alot of videos but can not understand this concept and your single video clear all my concepts...
Thank you very much for showing us this easier way to find modulus. Before that, we could not practice text encrypting algorithms using C++. But now we can.
one can encrypt text just by xor it with the key.. its unbreakable to some extent..
You taught me better than my professor, thank you!
very helpful, thank you. The only good video on youtube for this
suberb explanation. Solved a project euler problem 97. Been stuck on that for 2 days!
thanks..most explanations out there are worse than garbage...this is the best ive seen..
you made this concept ,crystal clear to me ☺thank you ma'am
You made my life easy ...thanks for the support...
Finally i found the way to calculate it
thx a lot
Great method...plz make video on if calculate modulo of negative power
Thank you for this easiest method.
Thank you so much, your method is the best!!!
how 240^2 mod 14 is so easy?
240=(14*17)+4
@@hamzahouchti5405 14*17+4 = 242
240 mod 14 = 2 because 240=14*17+2. Now taking square on both sides, you will get 240^2 mod 14 = 2^2. Therefore, 240^2 mod 14 = 4. Hope this helps!
There is a rule if
a mod b congurent c
d mod b congurent e
ad mod b congurent ce
240mod14 (14 × 10 + 14 × 5 + 14 × 2 = 238) congurent 2
240×240mod14 congurent 2×2
yeah use calculator trick
Thank you ma'am such an excellent explanation.
Any same type of video... very interesting.. Beautiful
when binary starting number is one...then how to start?
ex: 60 ^ 29mmod 133
29 binary value-11101
Hi. I'm not that bright. How do we easily calculate 240^2(mod14)=4?
Notice 14 * 17 = 238, such that 240 is 2 mod 14, then we can plug in to find 240^2 = 2^2 = 4 (mod 14).
240 mod 14 = 2 because 240=14*17+2. Now taking square on both sides, you will get 240^2 mod 14 = 2^2. Therefore, 240^2 mod 14 = 4. Hope this helps!
hi.. how do we calculate mod working ?
How to calculate the square of 627 under mod 941
truly amazing, thank you
Is that Montgomery method?
2:06 if in the first column I had 0 instead of 1, should I always put 240 or 1?
There are infinite zeros before every binary expansion of an integer, but they are just not written because they carry no information. It follows that the first column will always be one, for all numbers other than zero.
For a concrete example take the number twenty. I can write it 20 or 020 and it represents the same integer. Analogously I can write 010(base b) and 10(base 2) and they have the same value.
Answer 2. Thankyou ❤️
Brilliant video.
GREAT explanation
how to calculate 2^223 mod 353?
See my latest video that I created for you at th-cam.com/video/1ozP3lEnCjU/w-d-xo.html
This was very helpful to me.. Thanks
thanks a lot, that was super helpful
in google the final answer is showing 4 and yours 2 what to do now? which one is correct
Nice and clear explanation
hello thanks for video
do u now fastest algorithm for generate big integer
or faste way to generate 2*256
37600^15943 MOD 37673 is 48
Finally I am able to use a calculator to calculate the result, and it is tally with result obtained from software PowerMod calculator.
How did you do to her?
Crystall clear
Gr8 best lecture in world
thanks your video helps alot
Thank you so so much mam...
Is this work for all numbers
Thank you mam life saving 🧡🧡
Thank you!
I love uuuu...u r the bestttt
it was really helpful thanks
Thank you so much mam
I THANK YOU VERY MUCH
Thank you ❤
Thank you so mutch
Thankyou Ma'am, May Allah Bless you
merci beaucoup
Excellent
How 2^2 mod 14 is 4?
Divide 2^2 by 14 and find the remainder. So, 4 mod 14 = 4
thank you
you're the best
Thank you for your
thanks. great explain. I appreciate it
Thanks alot ❤️❤️❤️❤️❤️❤️
U save d me thanks a lot mam
instead of 240 for the first columm, why don't you put 2, because 240 mod14 is congrent 2 mod 14
Yes this should work
Thank you mam
HOW TO COMPUTE 1819¹³ MOD 2537
Answer should be 4. But you said it's 2.why?
thanks
thanks
Love you😅❤
240 power 1783 mod 3233 calculate this
got it.
ITS WORK
Clutch
very headache inducing camera-work
I calculated it and result is 4!!!
U r 👍
😮
use stable camera
its 2
Thank you so much. I had to use this method for my cryptography class and yours is the only video that explained it well.
Same I also used the same method for rsa algo