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
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.
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.
Thank you so much. I had to use this method for my cryptography class and yours is the only video that explained it well.
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
You taught me better than my professor, thank you!
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..
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...
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!
you made this concept ,crystal clear to me ☺thank you ma'am
Thank you so much, your method is the best!!!
You made my life easy ...thanks for the support...
Thank you for this easiest method.
Crystall clear
thanks..most explanations out there are worse than garbage...this is the best ive seen..
Thankyou Ma'am, May Allah Bless you
Thank you ma'am such an excellent explanation.
Finally i found the way to calculate it
thx a lot
Brilliant video.
truly amazing, thank you
thanks a lot, that was super helpful
GREAT explanation
Thank you!
Nice and clear explanation
This was very helpful to me.. Thanks
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!
Thank you ❤
Thank you so mutch
I THANK YOU VERY MUCH
Thank you for your
Any same type of video... very interesting.. Beautiful
thanks. great explain. I appreciate it
thank you
thanks your video helps alot
Excellent
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 mam
How to calculate the square of 627 under mod 941
it was really helpful thanks
Great method...plz make video on if calculate modulo of negative power
when binary starting number is one...then how to start?
ex: 60 ^ 29mmod 133
29 binary value-11101
hi.. how do we calculate mod working ?
Thanks alot ❤️❤️❤️❤️❤️❤️
you're the best
hello thanks for video
do u now fastest algorithm for generate big integer
or faste way to generate 2*256
thanks
Thank you mam life saving 🧡🧡
Gr8 best lecture in world
U save d me thanks a lot mam
thanks
Answer 2. Thankyou ❤️
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?
in google the final answer is showing 4 and yours 2 what to do now? which one is correct
Love you😅❤
Is this work for all numbers
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.
how to calculate 2^223 mod 353?
See my latest video that I created for you at ruclips.net/video/1ozP3lEnCjU/видео.html
got it.
Answer should be 4. But you said it's 2.why?
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
😮
ITS WORK
U r 👍
How 2^2 mod 14 is 4?
Divide 2^2 by 14 and find the remainder. So, 4 mod 14 = 4
HOW TO COMPUTE 1819¹³ MOD 2537
240 power 1783 mod 3233 calculate this
its 2
use stable camera
I calculated it and result is 4!!!
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