Incredible video. I had multiple moments where I had a revelation and info from my class and lab connected thanks to your insight. Insanely well done!

Undoubtedly this is the most valuable lecture I have ever seen in you tube which is enough to understand.

Thank you, I think this is the best and easiest possible explanation of CRT.

Thank you sir for an explicit explanation 🙏

Simple and clear, thank you very much!

One of the best explanations ive seen on the internet, insanely well done

Finally, I understand. Thank you for your work.

thank you for showing, clear and easy to follow, thumbs up and blessings to you

Excellent explanation 👌, it was so detail

It is just wonderful thanks so much for such assistance

Thank you so much for breaking all of the steps down in a way that is easy to follow!

@karthikkcp2614

Жыл бұрын

Tu ukg mein h kya?

Thank you for this wonderful explanation 👏 🙏 😊

Thank you so much sir.very easy to understand ,very good explaination .

Clear explanation Thank you sir☺️

The explanation looks veerrryy ....easy 👍. Thank you

Best CRT video I have ever watched

Thank you, very good explanation

A clear explanation 💯💯

God bless you for making a clear demonstration

Great Explanation

Wow Thank you so much sir . This solution really help me in solving Chinese Remainder Theorem

Wow, thank you so much, very easy to understand… thought it was super complicated but now I think it’s quite easy… thanks again 🤗

Thank you so much!!! Really helpful!

Thanks for the amazing explanation

thanks a lot, sir ... i had to spend over 2 hours to understand this theorem

U r really awesome sir ❤️❤️ super explaination

From the heart thank u very much

Thank you so much sir 👍❤️

Great explanation

Thank you that was very clear ! (way clearer that chatGPT's explanations)

thank you for the video!🙏

Thank you so much sir understood very well

Very nice explanation

Thank you so much😄

thanku sir for describing very deeply i fully understand what is chainess reminder theorem thanku so much sir

Thanks sir I clear understand the lesson

It's amazing , thank you!

@mooregenius

2 жыл бұрын

aitu?

Thank you very much Sir

Thank you so much 💞

Thank you sir

Really great

Thank you very much

Good 👍 teaching style

Thank you🔥

Thank you

Thank u bro 💯 for help me 😍😍😍👊🙏

thank you so much

thank you you are the best

Thanks

THX BRO VERY MUCH

Very good 👍👍👍

I got Inverses of M1 and M3 as 12 and 5 using EEA. I tried again and again, still got them as MI of M1 and M3.

@akilanss2770

2 жыл бұрын

to find M1, in EEA , use 3 as A and 35 as B.. Then u should get M.I for M1 as 2

@pragathiyp5622

Жыл бұрын

@@akilanss2770 why like that though ? how do we know we have to take A as 3 and 35 as B

Thanks 😊 🙏

You explained clearly akka... Keep putting new vedios.. Keep going up.. Continue rocking.. Put more vedios.. Continue I will always support you akka... Very soon you will reach crore subscribers... 🎉 All the best...

Thanku Sir 🙏❤️😇

Thank you so much sir 🙏 today is my exam 🙏

THANKS

thank u sir

Thanks Boss

Tanks to you❤

Perfect 💜

Today was my exam and 10 marks Question was that with non relative pairs of m1,m2 ....and i was not able to do that bcoz that concept you didn't teach plz provide complete portion.

@Randomguy-zy3bc

Жыл бұрын

which clg bro

@abhishek3396

Жыл бұрын

@@Randomguy-zy3bc LPU

thankyou

If my message is encrypted with e =3 and n1=629, n2=2173, n3=1159 as c1,c2and c3 what would be the original message? Would this work for that?

mind blowing

sir but we are computing multiplicative inverse with extended euclidean algo then X's value is 96 (X=96). please reply

Going through a breakup rn... I couldn't Focus on my studies and it's the last min for me, tomorrow is my exam,this helps a lot....thankyou God bless you!

really clear explanation but where does this theorem come from?

YES SIR ALL CLEAR ALOGARITHMSA THAT YOU HAVE MAKE

Wonderful ,tqsm 🥰

Since x could also be 128, wouldnt the answer be x = 23(mod 105)

Perfect❤

I FINALLY UNDERSTAND thanks so much

Perfect❣️

Very Good ...☺️...your lecture is very helpful for all students ....Thank u soo much .....Allah ap ko jazy khair ata farmy ...ameen

I am getting wrong answer for finding multiplicative inverse of 35 by using extended Euclidean algorithm .Please post the solution for multiplicative inverse of 35.

If you are following neso's video about extended euclidean algorithm, while calculating modulo multiplicative inverse, assign a=m1, b= M1, t1=0, t2=1.

@YeniyanSemman-xh2cj

Жыл бұрын

his method not working for 35 mod 3?

@k-AsharKhalil

Жыл бұрын

@@YeniyanSemman-xh2cj yes. not working

@52abaradabala83

9 ай бұрын

this is helpful. I was confused when I got 12 for M1^-1 and his answer was 2. Now I got 2 when I did as you suggested. thank you

07/03/2023 Tuesday I'll be watching you

What if one of the system is X = y mod8 ?? How can we solve that?

Previous vdo link to deal with large number?

Sir please upload RSA algorithm..

I hope someone can help me please. I have these equations, only 2 sets at a time, but there is an additional constraint, example ( x > 70 ). Any advice on this please?

Nice

if i get negative value using eea for m inverse what to do?

Super sir

LEGEND

How did u have x=23

05:17 The condition for the existence of a unique solution is not that GCD(m1,m2,m3) must be 1. Rather GCD(m1,m2) == 1 && GCD(m1,m3) == 1 && GCD(m2,m3) == 1 In other words LCM(m1,m2,m3) == m1*m2*m3 For eg: given m1=6, m2=10, m3=13. There doesn't exist a unique solution even if the GCD(6,10,13) = 1. This is because GCD(6,10) ≠ 1 Or in other words LCM(6,10,13) ≠ 6*10*13 To the educator, You should study the topic well before making a video on it. If you are not informed enough you should not misguide others. This is not the first time I have noticed misinformation on NESO Academy videos. This channel has Millions of followers, and this particular video has Lakhs of views. It's your responsibility to serve the right information.

@BCS_ArshAliKhan

4 ай бұрын

Yes you are right, people should research before putting out videos like this. In this day and age there is a shortage of good content because people can upload easily without putting in proper research first

@kits2589

4 ай бұрын

Demn this is why I’m always skeptical of info on the internet. Thanks for the knowledge brother

@Shams_Tahzib

4 ай бұрын

That's why I don't use neso videos for studies anymore They make these mistakes often.

@BCS_irzam

4 ай бұрын

Honestly neso should quote their sources at this point coz this happens quite often.

@BCS_Aadil_Mohammad_Husain

4 ай бұрын

Thanks for the reply homie!!! These people be lying as hell, niggas here don't know who trust nowadays. Niggas here be having one job and they f*ing that up too. But good for the world, they got trustworthy people like you, who a young nigga like me can put their lives on. You doing god's work here my boi, god bless.

Sir to find M3 inverse u have explained 15*1mod 7 so the remainder will be 7 oly , instead y can’t we take 15/7 7*2=14 so we can get 1 as remainder u have taken 1 as M3inverse y can’t we take M3inverse as 2??? Pls suggest

Very good ... extraordinary...nice 👍...👻👻

Love ❤ U sir

Hi. I am lost. Why is the answer 23? From 233 mod 105? How come? Kindly explain. Thank you.

@itzshivanya

Жыл бұрын

When 233 is divided by 105 so remainder is 23.

ni haao! and sir what about the 3rd eqn...?

How to do this with eea

sir please upload network security videos fastly sir

how does x is 23 how did you do 233 mod 105

@dhayalana7020

2 ай бұрын

233/105 remainder 23

but what if M doesn't has an inverse ?

How do we get 23 please can anyone explain

Plz from the 233 mod 105 how comes did we get X= 23 please i need more explanation.

@loveleyyy3895

10 ай бұрын

divide it and you'll get the remainder 23

please complete discrete mathematics and computer organisation and architecture ASAP

@varunnarayanan6301

Жыл бұрын

Nee etha nayee

@techtownmalayalam

Жыл бұрын

@@varunnarayanan6301 😂