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.
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
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.
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!
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.
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.
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...
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?
![Twenty One Pilots - “The Line” (from Arcane Season 2) [Official Music Video]](http://i.ytimg.com/vi/E2Rj2gQAyPA/mqdefault.jpg)
Undoubtedly this is the most valuable lecture I have ever seen in you tube which is enough to understand.
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.
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
Demn this is why I’m always skeptical of info on the internet. Thanks for the knowledge brother
That's why I don't use neso videos for studies anymore They make these mistakes often.
Honestly neso should quote their sources at this point coz this happens quite often.
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.
One of the best explanations ive seen on the internet, insanely well done
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!
Wonderful explanation sir...I have ever seen in this RUclips channel... excellent sir ...
Thank you, I think this is the best and easiest possible explanation of CRT.
Thank you so much for breaking all of the steps down in a way that is easy to follow!
Tu ukg mein h kya?
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!
thank you for showing, clear and easy to follow, thumbs up and blessings to you
The explanation looks veerrryy ....easy 👍.
Thank you
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.
his method not working for 35 mod 3?
@@YeniyanSemman-xh2cj yes. not working
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
Simple and clear, thank you very much!
Best CRT video I have ever watched
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.
to find M1, in EEA , use 3 as A and 35 as B.. Then u should get M.I for M1 as 2
@@akilanss2770 why like that though ? how do we know we have to take A as 3 and 35 as B
Thank you sir for an explicit explanation 🙏
thanks a lot, sir ... i had to spend over 2 hours to understand this theorem
THE ONLY VIDEO THAT MAKES SENSE
Thank yoy so much bro.. Very clear and good explanation.. 🙏🙏
Finally, I understand. Thank you for your work.
thanku sir for describing very deeply i fully understand what is chainess reminder theorem thanku so much sir
God bless you for making a clear demonstration
Thank you that was very clear ! (way clearer that chatGPT's explanations)
Top Notch Explanation ..
Thank you for this wonderful explanation 👏 🙏 😊
Thank you so much sir 🙏 today is my exam 🙏
damn, x10 more comprehensive than my extremely boring math teacher. thanks!
Thanks for the amazing explanation
Thank you so much sir.very easy to understand ,very good explaination .
Wow Thank you so much sir . This solution really help me in solving Chinese Remainder Theorem
Good 👍 teaching style
Thank you bro same question was came in exam I am full happy about that
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 sir understood very well
Thanks sir I clear understand the lesson
Thank you so much😄
Very nice explanation
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.
which clg bro
@@Randomguy-zy3bc LPU
the simplest explanation so far😃😃
A clear explanation 💯💯
It is just wonderful thanks so much for such assistance
Very Good ...☺️...your lecture is very helpful for all students ....Thank u soo much .....Allah ap ko jazy khair ata farmy ...ameen
Excellent explanation 👌, it was so detail
Thanku so much sir...❤️
Great Explanation
Great explanation
Clear explanation
Thank you sir☺️
Wonderful ,tqsm 🥰
Thank you very much Sir
U r really awesome sir ❤️❤️ super explaination
Thank you so much!!! Really helpful!
Since x could also be 128, wouldnt the answer be x = 23(mod 105)
Thank you so much sir 👍❤️
Thank you, very good explanation
sir but we are computing multiplicative inverse with extended euclidean algo then X's value is 96 (X=96). please reply
07/03/2023 Tuesday I'll be watching you
From the heart thank u very much
tip;watch the video in 1.5X
I FINALLY UNDERSTAND thanks so much
Thank you very much
It's amazing , thank you!
aitu?
really clear explanation but where does this theorem come from?
Really great
YES SIR ALL CLEAR ALOGARITHMSA THAT YOU HAVE MAKE
Thanks
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 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?
its always the Indian video. Thank you sir.
W content. U deserve more subs
Thank u bro 💯 for help me 😍😍😍👊🙏
Where can I find a proof of the formula to find X? I've been stuck on that question for some time now.
please complete discrete mathematics and computer organisation and architecture ASAP
Nee etha nayee
@@varunnarayanan6301 😂
Hi. I am lost. Why is the answer 23? From 233 mod 105? How come? Kindly explain. Thank you.
When 233 is divided by 105 so remainder is 23.
Thanks mere bete☔
Thank you so much 💞
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...
Thank you🔥
thank you you are the best
Thanku Sir 🙏❤️😇
Thank you
Tanks to you❤
Previous vdo link to deal with large number?
Thank you sir
Thanks 😊 🙏
12:48 yes we can read. waiting. what X is and why this X= 2 (mod 3) is it allways or need try different things LOL like i said bad exsample
Thanks Boss
ni haao! and sir what about the 3rd eqn...?
Very good 👍👍👍
how does x is 23 how did you do 233 mod 105
233/105 remainder 23
THX BRO VERY MUCH
LEGEND
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?
sir please upload network security videos fastly sir
What if one of the system is
X = y mod8 ?? How can we solve that?
if i get negative value using eea for m inverse what to do?
Perfect 💜
thank u sir
How did u have x=23
Perfect❤
Sir please do videos on FRENCH language in Neso Academy - Languages channel. Please sir
Plz from the 233 mod 105 how comes did we get X= 23 please i need more explanation.
divide it and you'll get the remainder 23