(1a) Compute 240^262 mod 14 using the fast modular exponentiation method.

[@jedgraves8399]

Thank you so much. I had to use this method for my cryptography class and yours is the only video that explained it well.

[@dagi_d]

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!

[@035asadali8]

i am also here to learn the how to calculate mod of a power for an algorithm

[@codeberry3278]

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.

[@DaKILLaGod]

one can encrypt text just by xor it with the key.. its unbreakable to some extent..

[@rodneycancler5114]

You taught me better than my professor, thank you!

[@MahnoorAkhtar-b4f]

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...

[@alexcalabro8140]

very helpful, thank you. The only good video on youtube for this

[@surajpratapsinghsayar7282]

suberb explanation. Solved a project euler problem 97. Been stuck on that for 2 days!

[@VP-km1ru]

thanks..most explanations out there are worse than garbage...this is the best ive seen..

[@SaSuB]

Finally i found the way to calculate it
thx a lot

[@codeTuber033]

you made this concept ,crystal clear to me ☺thank you ma'am

[@TheAajtv]

You made my life easy ...thanks for the support...

[@NasirUddin-wq1oe]

Thank you for this easiest method.

[@aakash-muadDab-usul]

Thank you so much, your method is the best!!!

[@Jess_Samuel]

Brilliant video.

[@syedkausarali2846]

how 240^2 mod 14 is so easy?

[@hamzahouchti5405]

240=(14*17)+4

[@sharp_ikecicle]

@@hamzahouchti5405 14*17+4 = 242

[@syedrizvi1704]

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!

[@suuujuuus]

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

[@khudejarahim8451]

yeah use calculator trick

[@tabassumhafsa4704]

Thank you ma'am such an excellent explanation.

[@SaVaGe-_-GuYz]

thanks a lot, that was super helpful

[@kingdomofhavean]

GREAT explanation

[@vishalkarna3763]

Nice and clear explanation

[@waveylayz]

I am cryptography student it help me a lot

[@MashrubaZerin]

I love uuuu...u r the bestttt

[@ohpetya]

Is that Montgomery method?

[@nandakishorjairam4140]

truly amazing, thank you

[@jassikaur6180]

Great method...plz make video on if calculate modulo of negative power

[@vanidixit3894]

when binary starting number is one...then how to start?
ex: 60 ^ 29mmod 133
29 binary value-11101

[@babujimitra7920]

Any same type of video... very interesting.. Beautiful

[@DVRhm25]

Hi. I'm not that bright. How do we easily calculate 240^2(mod14)=4?

[@guilhermefranco2949]

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).

[@syedrizvi1704]

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!

[@abed-j9e]

It can be calculate by any simple calculator.
Way:
1. Calculate small exponent.
=>240^2 = 57600
2. Divide it by Dividend 14.
=>57600 / 14 = 4114.2857...
3. Subtract the Integer part from the ""4114.2857..."".
=>4114.2857... - 4114 = 0.2857...
4. Multiply that "0.2857..." with Dividend 14.
=>0.2857... * 14 = 4 [That's the Answer]
All though it's looks big, but in calculator it's super simple in just a few click. And try to calculate whole mod in one calculation, i mean 240^2 = 57600, ANS / 14 = 4114.2857..., ANS - 4114 = 0.2857..., ANS * 14 = 4

[@ssambadenis9401]

This was very helpful to me.. Thanks

[@alexdibu_3782]

2:06 if in the first column I had 0 instead of 1, should I always put 240 or 1?

[@georgeallen7487]

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.

[@Code99849]

Thank you so so much mam...

[@faisalzaidi4642]

thanks your video helps alot

[@vineetbhoria245]

Crystall clear

[@o.s8765]

you're the best

[@parvezmohammad3620]

it was really helpful thanks

[@suisilanisuvianavanua7962]

hi.. how do we calculate mod working ?

[@silentzaingaming5791]

thanks. great explain. I appreciate it

[@4mt]

Thank you!

[@afaqueahmedchandio2911]

Thank you so much mam

[@skv292002]

Gr8 best lecture in world

[@alinajaved2165]

how to calculate 2^223 mod 353?

[@susanzehra]

See my latest video that I created for you at th-cam.com/video/1ozP3lEnCjU/w-d-xo.html

[@kashifshabbir-ww8qo]

How to calculate the square of 627 under mod 941

[@babujimitra7920]

Excellent

[@sarrab7087]

Thank you ❤

[@iDK-kw5ei]

in google the final answer is showing 4 and yours 2 what to do now? which one is correct

[@vedbhanushali608]

Thank you mam life saving 🧡🧡

[@Yoyo-ck9pm]

Answer 2. Thankyou ❤️

[@Multi1Vids]

I THANK YOU VERY MUCH

[@jabreljonto2923]

Thank you so mutch

[@ghislainondeno1215]

merci beaucoup

[@user-qz2vu2wy6b]

instead of 240 for the first columm, why don't you put 2, because 240 mod14 is congrent 2 mod 14

[@jb31842]

Yes this should work

[@mwddd]

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.

[@HajarAmlal-t3s]

How did you do to her?

[@adnantatlis3225]

hello thanks for video
do u now fastest algorithm for generate big integer
or faste way to generate 2*256

[@mariammohsen5594]

Thanks alot ❤️❤️❤️❤️❤️❤️

[@Sufi254]

Answer should be 4. But you said it's 2.why?

[@AbleBrawa]

Love you😅❤

[@alichene]

Thank you for your

[@prasanthbalaji1160]

U save d me thanks a lot mam

[@tariqmath1845]

Is this work for all numbers

[@KPfVy2ma]

thank you

[@CyberMysticOfficial]

Thankyou Ma'am, May Allah Bless you

[@CamelloDric]

How 2^2 mod 14 is 4?

[@syedrizvi1704]

Divide 2^2 by 14 and find the remainder. So, 4 mod 14 = 4

[@kacho4618]

thanks

[@nithya772]

Thank you mam

[@nevermind7164]

HOW TO COMPUTE 1819¹³ MOD 2537

[@learning_trespasser]

thanks

[@ভাষাহোক]

got it.

[@zaidfaster1321]

ITS WORK

[@ToanPham-wr7xe]

😮

[@inspireVoyage123]

240 power 1783 mod 3233 calculate this

[@tuntumwakalasya5270]

Clutch

[@prateekporwal1108]

U r 👍

[@pranavkay4621]

very headache inducing camera-work

[@omkarmagadum4969]

use stable camera

[@soundeffectbysounds]

its 2

[@namdhv]

I calculated it and result is 4!!!

[@mayankmahajan9716]

Thank you so much. I had to use this method for my cryptography class and yours is the only video that explained it well.

[@hmm8161]

Same I also used the same method for rsa algo