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.
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.
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!
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.
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
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?
Why are humans aren't content..?? If the vidoes is short .you'll be the same dude still complaining that's it too short..whether long /short ..the aim is to make viewers understand
![เปิดใจ พี่ญา คนรุม หลังทัวร์ลง หนักสุดในชีวิต!! l [Nickynachat]](http://i.ytimg.com/vi/2-OJZRtclro/mqdefault.jpg)
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.
Undoubtedly this is the most valuable lecture I have ever seen in you tube which is enough to understand.
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!
One of the best explanations ive seen on the internet, insanely well done
thank you for showing, clear and easy to follow, thumbs up and blessings to you
Thank you so much for breaking all of the steps down in a way that is easy to follow!
Tu ukg mein h kya?
Thank you, I think this is the best and easiest possible explanation of CRT.
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
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
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!
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.
Since x could also be 128, wouldnt the answer be x = 23(mod 105)
Simple and clear, thank you very much!
sir but we are computing multiplicative inverse with extended euclidean algo then X's value is 96 (X=96). please reply
Thank you sir for an explicit explanation 🙏
The explanation looks veerrryy ....easy 👍.
Thank you
Best CRT video I have ever watched
Thank you that was very clear ! (way clearer that chatGPT's explanations)
Thank you so much😄
thanks a lot, sir ... i had to spend over 2 hours to understand this theorem
Thank you so much sir.very easy to understand ,very good explaination .
thanku sir for describing very deeply i fully understand what is chainess reminder theorem thanku so much sir
Wow Thank you so much sir . This solution really help me in solving Chinese Remainder Theorem
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
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.
It is just wonderful thanks so much for such assistance
Finally, I understand. Thank you for your work.
Thank you for this wonderful explanation 👏 🙏 😊
Wow, thank you so much, very easy to understand… thought it was super complicated but now I think it’s quite easy… thanks again 🤗
God bless you for making a clear demonstration
Wonderful ,tqsm 🥰
A clear explanation 💯💯
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?
Very Good ...☺️...your lecture is very helpful for all students ....Thank u soo much .....Allah ap ko jazy khair ata farmy ...ameen
Good 👍 teaching style
how does x is 23 how did you do 233 mod 105
233/105 remainder 23
Excellent explanation 👌, it was so detail
Where can I find a proof of the formula to find X? I've been stuck on that question for some time now.
Bro kept yapping same thing for 7min
Thanks for the amazing explanation
Thanks sir I clear understand the lesson
Clear explanation
Thank you sir☺️
Thank you so much sir understood very well
Thank you so much sir 🙏 today is my exam 🙏
please complete discrete mathematics and computer organisation and architecture ASAP
Nee etha nayee
@@varunnarayanan6301 😂
Great Explanation
U r really awesome sir ❤️❤️ super explaination
From the heart thank u very much
Thank you so much sir 👍❤️
07/03/2023 Tuesday I'll be watching you
Thank you very much Sir
How did u have x=23
Thank you, very good explanation
Very nice explanation
Thank you so much!!! Really helpful!
Great explanation
Really great
Thanks
It's amazing , thank you!
aitu?
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
15%7 the ans is 1. We are taking remainder here, not the quotient. 2 is quotient and 1 is remainder.
Thank you very much
really clear explanation but where does this theorem come from?
Thank you sir
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
Thank u bro 💯 for help me 😍😍😍👊🙏
Niceuuu
Previous vdo link to deal with large number?
What if one of the system is
X = y mod8 ?? How can we solve that?
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 FINALLY UNDERSTAND thanks so much
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?
Thank you
if i get negative value using eea for m inverse what to do?
bro your explanation is good but basically 7 minutes of the video is just the same thing repeated again and again. please try to minimize it
Dekhna he dekh nehi to jaa
bacche bap ko mt sikha@@subhasismohanty4013
@@subhasismohanty4013💀👍🏻
Tere baap ko nahi kaha usne@@subhasismohanty4013
Why are humans aren't content..?? If the vidoes is short .you'll be the same dude still complaining that's it too short..whether long /short ..the aim is to make viewers understand
Thank you so much 💞
YES SIR ALL CLEAR ALOGARITHMSA THAT YOU HAVE MAKE
ni haao! and sir what about the 3rd eqn...?
thank you you are the best
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
Tanks to you❤
Thank you🔥
thankyou
Thanks 😊 🙏
Sir can X be -ve or not?
No
Thanku Sir 🙏❤️😇
but what if M doesn't has an inverse ?
Thanks Boss
THX BRO VERY MUCH
How do we get 23 please can anyone explain
Why the M^-1 is two not 23 asking teacher explain
sir please upload network security videos fastly sir
13:50 ok those change what bout 2 3 2 LOL yes they can change too they on equation lol so then X match. but what is x?
thank u sir
Perfect 💜
Very good 👍👍👍
Sir please upload RSA algorithm..
Perfect❣️
How to do this with eea
in your video 10:29, M1 inverse does not equal to 2 because 1 mod 3 is 1, 35 times 2 does not equal to 1, this is so misleading
Sir please do videos on FRENCH language in Neso Academy - Languages channel. Please sir