0:00 Chinese remainder Theorem 1:35 Problem_1 13:12 Problem_2 22:13 Chinese remainder theorem for non coprime case 23:42 Problem_3 (non coprime case ) 37:17 Problem_4 (non coprime case) 43:10 Problem_5
why you are modding the values in finding the inverse of any linear sequence. like in 19:18 we have 30y4 congruent 1 mod 11 and 30 is modded to 8y4 what is the reason as the general form of inverse of linear sequence is ax congruent 1 mod m where a can be any integer.
46:27 sir if we find the inverse through bezout's coefficient i am getting -3 as a inverse of 2 mod 7 but you have taken 4 as the inverse what is correct?
0:00 Chinese remainder Theorem
1:35 Problem_1
13:12 Problem_2
22:13 Chinese remainder theorem for non coprime case
23:42 Problem_3 (non coprime case )
37:17 Problem_4 (non coprime case)
43:10 Problem_5
Best video on UA-cam on this topic.
CONGRATULATIONS FOR 1K SUBSCRIBERS SIR
why you are modding the values in finding the inverse of any linear sequence. like in 19:18 we have 30y4 congruent 1 mod 11 and 30 is modded to 8y4 what is the reason as the general form of inverse of linear sequence is ax congruent 1 mod m where a can be any integer.
46:27 sir if we find the inverse through bezout's coefficient i am getting -3 as a inverse of 2 mod 7 but you have taken 4 as the inverse what is correct?
If we are working with mod 7 then minus 3 is equal to 4. Since -3=7(-1)+4.or simply add 7 to -3 to make it positive
Sir, pls upload all videos
We having exams in one week
Thankyou so much sir
This channel is very helpful 🎉
7:00 sir, y1 could be -1 here also, right?
And sir please upload last video of this chapter as soon as possible
sir ji how you find gcd in 3rd question
Is this a last topic of chapter
One more video will be shared.
@@Sanonlineclasses sir keep it short😢
@@atroxxgaming4738 I have already put the time stamp in pinned comment so watch as per your requirements.
42:18
Answer x=252k+16
problem 4 : answer = x= 252 +16
Right
right brotha 😄