Linear Diophantine Equations | Road to RSA Cryptography #3

[@nunpuiachhakchhuak4635]

Thanks man, after looking at almost 50 video or paper, this is the easiest explanation of what i specifically need. 👍

[@danielschaben]

Thanks for the great review of this. been a while since I worked with these and your video brought back my memory.

[@ProfOmarMath]

Thanks for checking this playlist out. What’s the summer camp about?

[@danielschaben]

@@ProfOmarMath we are working with cryptography. The first week was pre ww2 and made Pringle can enigmas with a capture the flag game. Now we are going to finish this week with RSA and the number theory needed to compute it. All the while showing that we are at constant battle between coders and decoders. So far I think it has been good.

[@ProfOmarMath]

@@danielschaben Oh that’s very fun!

[@holyshit922]

c must be divisible by gcd(a,b)
Extended Euclidean algorithm is helpful

[@SudarshanBaurai]

Excellent explanation Prof. Many thanks. 🙏

[@PonchuTfm]

Wow!! Thank you so much!!!!!

[@ProfOmarMath]

Thanks Anto!

[@bridenariho4687]

Thanks man it's cool.

[@marielcabusog7259]

Thank you

[@ProfOmarMath]

Thanks!

[@fuzail9277]

perfect!!

[@sanjaysuresh8865]

First! Love your videos!

[@ProfOmarMath]

Thanks Sanjay!

[@hossamahmed4936]

I want to ask what is (t) at the last part of the vedio ?

[@anontrolo]

I feel like Im having flashbacks, did you teach Ma6 at Caltech?

[@ProfOmarMath]

I did!!

[@malekmahmoudbarhoush5215]

V.good

[@fried_ady6318]

How would you solve the thumbnail diophantine, 137x+173y=99?

[@goldennlt8164]

U can’t.

[@SrisailamNavuluri]

137x+173y=137(x+y)+36y=99
36y=137k+99
When k=9, 36y=9(137+11)
y=37,x=-46
General solution is x= - 46+173p,y=37-137p where p is an integer

[@fried_ady6318]

@@SrisailamNavuluri thanks!

[@ogkush6276]

I tried solving thumbnail but i couldn't, spent 1 hour on it, just to learn its unsolvable 😹😹

[@beautifulworld6163]

Ok

[@vinegar.]

What...