Why is it that I spend 65 minutes in a lecture confused, but spend 15 minutes on youtube and learn it. Please come teach at my university!!! Thanks for the explanation, this was awesome, thanks!!
I really like how you explained 5th step, which is by far the most difficult part of this problem. Thank you! To find the other solutions, dividing the gcd of a and n by n will give the distances apart i.e n/gcd(a, n). Eventually, you can just directly add it to the first solution of x to get the second solution. In cases where there are more than 2 solutions, just keep performing an additive increment.
Sis, u have done wonderful job, I m studying 1st sem in cse , o didn't get this topic , but after seeing your videos , I got more knowledge.. thankyou so much Sis...
Today I have my exam.Yesterday I searched many videos for this topic but was not satisfied.My friend sent this link and now I understood well. I will never forget bcoz its easy step by step process.Hope I get this in exam today🙂.Thankyou so much. God bless you.
really really good explanation and quite clear spoken English. I always have a really hard time listening to Indians because I'm not native in English, but not this time :) Keep growing girl
Ma'am for finding the inverse which method u would suggest as the best..Bcoz in trial nd error if we were not encountered with the near approaching value it would take huge amount of time. So what would u suggest??
@@mr.masadi1993 I normally suggest to go for couple of small values as try and error method (Because in most of the cases, we get answer from them). If they don't work out, then go with the long method! After all, it mainly depends on your speed and convenience :)
Is it the process how to solve linear congruences in one variable? I am just confused because the example in my module is not like this. I just want to know if solving congruences in one variable and finding the values of x have the same process?
how do you find C if the mod is a huge number, so you cant go trial and error until mod-1??? ex: if it was 7c mod 88 = 1, how to find c instead of doing c=1, c=2, ....,c=87??
@@CSEconceptswithParinita maam can you make one video on this theorem {{the linear congruence ax=b(modn) has a solution if and only if d|b,where d=gcd(a,n).If d|b then it has d mutually incongruent solutions modulo n}}
Mam..what if the answer I'm getting in the step 2 is an improper fraction... should i consider it as the solution doesn't exist or what should l do in this case..?
* ≈ congruent, i don't have congruent sign in keypad 😂 3x+5 ≈ 4(mod5) 3x ≈ -1 (mod 5) {..,-6,-1,4,9,...}, This is set of multiply of 5 from -1. So, we can change -1 to another number on that set. 3x ≈ 9 (mod 5) If gcd(3,5) = 1, we can divide 3 and 9. So.. x ≈ 3 (mod 5) CORRECT ME IF I'M WRONG
We have done 9×2 because it gives us 18. 9*3=27 which is greater than 24 So, when it is 24 mode 9..... we have to multiple a number with 9 such that it gives us product as highest number lesser than 24
Why is it that I spend 65 minutes in a lecture confused, but spend 15 minutes on youtube and learn it. Please come teach at my university!!! Thanks for the explanation, this was awesome, thanks!!
Haha, thank you so much for your acknowledgement. Means a lot😊😊
Exactly said
Exactly
Keep learning, keep sharing ✌ 😊
Your life is full of lie's
I really like how you explained 5th step, which is by far the most difficult part of this problem. Thank you! To find the other solutions, dividing the gcd of a and n by n will give the distances apart i.e n/gcd(a, n). Eventually, you can just directly add it to the first solution of x to get the second solution. In cases where there are more than 2 solutions, just keep performing an additive increment.
finally I got the best vdo on this topic.thank you ...God bless you
Thanks for your feedback. Keep learning, keep sharing 😊
How did 24 mod 9 became 6? Like what do we do if we have bigger numbers
this is my doubt
Mam please do video on system of linear congreuences in two variables.... Mam please do within two days exams is there?
Chota s suggestion dena chahunga mam ap bhaut accha pdhate ho pr English ke jgh bilangual pdhaoge to or acche video bnegi
Mam do video on fermat's litte theorem
It's already uploaded there in my channel
@@CSEconceptswithParinita
Ok tq
Sis, u have done wonderful job, I m studying 1st sem in cse , o didn't get this topic , but after seeing your videos , I got more knowledge.. thankyou so much Sis...
I'm glad to hear this 😊
If you really liked it, please share it with all your classmates too :)
Today I have my exam.Yesterday I searched many videos for this topic but was not satisfied.My friend sent this link and now I understood well. I will never forget bcoz its easy step by step process.Hope I get this in exam today🙂.Thankyou so much. God bless you.
Glad to know that my tutorial is helpful! Wishing you all the best for your exam✌😊
Thankyou so much😊
Thank you so much, this was far more helpful than what they teach at university! :)
My pleasure! Keep learning, keep sharing ✌😊
Hello, thank you for your efforts, I just have a question, in 8:17 I didn't understand what you did in red pen, so can you explain it for me ?
thankyou ma'am. I literally was so confused in this topic! You made it crystal clear for me. Much oblliged. thanks a tonne.
My pleasure dear! Keep learning, keep sharing 😊
After watching several videos on you tube my frequency is matched..thank you so much mam
Glad to hear that!
Keep learning, keep sharing 😊
Mam please make a video on differnsbialty and continuity upto bsc level 🙏
Okay, I'll try
I just saw this rn, and wow I can understand this problem in several minute only. amazing! thank u
Happy to help! Keep learning, keep sharing ✌🙂
thank you so much! i find modulo to be hard but it becomes easy because of this explanation
My pleasure😊 Keep learning, keep sharing✌
The whole day i was for a video of linear congruence ....bt this was the right one... Tysm😍
That's glad to know 😊
Keep learning, keep sharing ✌
Mam it is very useful please continue, l couldn't understand it since long. So l was tensed
Thank you so much mam! I learnt this in only 15 minutes. Such an easy way to solve, universities make it complicated for no reason
Thanks for acknowledging 😁 Keep learning, keep supporting ✌😊
After watching your video my fear gone from me for finding the solutions of these questions, THANK YOU loved your tutorial
I'm so glad! Keep learning, keep sharing 😊
How do you calculate 24 mod 9 =6
this is the first time i actual understood this thing after going through youtube for 4 days
I'm glad to know that I was able to make you understand 🙂
Excellent explination 👍
Glad it was helpful! Keep learning, keep supporting 🙂
Best lecture I found on this topic✨
Thanks for acknowledging ✨
really really good explanation and quite clear spoken English. I always have a really hard time listening to Indians because I'm not native in English, but not this time :) Keep growing girl
I'm glad it was helpful! 😊
Thank you maam, i finally understand this type of probelm. thank you so much
My pleasure! Keep learning, keep supporting ✨
You teach us very well but I want to see the video of linear congruence in two variables
Okay, I'll try to bring
Thank you so much🙏
You're welcome 😊
I'm happy to see your video
Thank u soo much mam
My pleasure 😊Keep learning, keep supporting ✌😊
Thank you so much... 👍👍👍👍👍👍🙏🙏🙏🙏🙏🙏🙏🙏🙏
My pleasure 😊😊
You taught us in very easy way. Thank you mam.
Keep learning, keep sharing ✌ 😊
Can you please make a tutorial in getting distinct incongruent solutions?
Okay, I'll try
Thank you, ma'am. You just earned another subscriber
I'm glad! Keep learning, keep sharing 😊
Way of explanation is too good
Keep learning, keep sharing ✌️ 😊
Thank u so much mam for explaining in such a simple way ☺️☺️
Keep learning, keep sharing ✌️ 😊
Thank you didi just awesome explanation and so clear to understand 😊!!! Once again life saviour before exam..
Thank you so much dear, I hope your exam went well😊 Keep learning, keep sharing ✨✌
@@CSEconceptswithParinita welcome ❤ dii
Ma'am for finding the inverse which method u would suggest as the best..Bcoz in trial nd error if we were not encountered with the near approaching value it would take huge amount of time. So what would u suggest??
@@mr.masadi1993 I normally suggest to go for couple of small values as try and error method (Because in most of the cases, we get answer from them). If they don't work out, then go with the long method! After all, it mainly depends on your speed and convenience :)
Is it the process how to solve linear congruences in one variable? I am just confused because the example in my module is not like this. I just want to know if solving congruences in one variable and finding the values of x have the same process?
Thank you for this discussion ...
My pleasure 😊
Thank you very much ma'am!, you saved my life because my final exam is next week 🤝
Wishing you all the best for your upcoming exam ✌️
@@CSEconceptswithParinita thank you so much :)
One doubt in 5th step x0=6 how came this
Finally I have got it , thanks mam
You're welcome 😊
how do you find C if the mod is a huge number, so you cant go trial and error until mod-1??? ex: if it was 7c mod 88 = 1, how to find c instead of doing c=1, c=2, ....,c=87??
thanku
Amazing explaination
My pleasure 😊
Super madam very nice explanation
Thank you very much
Keep learning, keep sharing 🙂
How u took 6 has answer can u tell me please
Explained very easy way mam thank you so much
You're welcome. Keep learning, keep sharing ✌😊
thanks to you you solved my problem on time
Happy to hear that 😊
Thanks a lot maam, really helped me during exams.♥️👍
Thanks for acknowledging. Please share it with your other friends..... It may help them too😊
Thank you mam😍
You're welcome 😊
Hello, I have a question if you may, what will be the fifth step if we don't have a number beside x, for instance: x is congruent to 3(mod 5)?
See Chinese Remainder Theorem
Thank you maam ..your video helped me during this lockdown
That's great. Keep learning, keep sharing ✌😊
@@CSEconceptswithParinita maam can you make one video on this theorem {{the linear congruence ax=b(modn) has a solution if and only if d|b,where d=gcd(a,n).If d|b then it has d mutually incongruent solutions modulo n}}
Thank you for the video didi!
But I have seen some questions in the form of ax + c = b (mod n)
How to solve them ?
Can you give the link for inverse linear congruence its hard to find from your pay list
Mam..what if the answer I'm getting in the step 2 is an improper fraction... should i consider it as the solution doesn't exist or what should l do in this case..?
Finally got the best video
Keep learning, keep sharing 😊✌
Ma'am what if I get 1 solution at step 3. When I do d mod n
Ma'am how to solve Find an inverse of 12 modulo 17,if it exists?
It'll be solved easily by the same procedure. Are you stuck somewhere?
Mam what if the equation didnot get divided by d
Hi mam can you find all possible solutions of linear congruence 9x ≅ 15(mod23)
U r great educator
Thanks for the compliment 😊
Amazing 😍 thank you🙏🏽
You’re welcome 😊
Mam it's b/d or d/b in second step ?
One of the best explanations that I came across 💥💥💥
Thanks a lot for this compliment 😊
Thank u sooooooo much
Keep learning, keep sharing 😊✌
Thank you
You're welcome 🙂
Maam please make video on linear congruence in two variable🙏🙏
Well presented! Thanks👍🥳🙏
My pleasure 😊
Keep learning, keep supporting ✌
@@CSEconceptswithParinita Do you have induction videos? Hard for me to understand my online class. I haven't checked your list yet..
I think my teacher explained it in a very different way and I keep searching for similar cases..
how to solve for 3x+5=4(mod 5) ? I am getting negative value of b. Plz help.
* ≈ congruent,
i don't have congruent sign in keypad 😂
3x+5 ≈ 4(mod5)
3x ≈ -1 (mod 5)
{..,-6,-1,4,9,...}, This is set of multiply of 5 from -1.
So, we can change -1 to another number on that set.
3x ≈ 9 (mod 5)
If gcd(3,5) = 1, we can divide 3 and 9. So..
x ≈ 3 (mod 5)
CORRECT ME IF I'M WRONG
😭😭thaaaaank you verrrry muchhh mam!!!!!!!!!!!
Keep learning, keep sharing 😊
mam 7:18 me jo hua, wo nahi samaj paa raha huun, please help
بہت بہت شکریہ
How is 2 mod 18 =2?
You can just remember that whenever we have any smaller number mod bigger number, result will be equal to that smaller number
@@CSEconceptswithParinita ok .. thankyou
My pleasure 😊
nice explanation mam .. Superb teaching
Keep learning, keep sharing ✌😊
That complete number is called as an "Integer"
Thanks mam so easy method
Keep learning, keep sharing ✌️ 😊
How to do d mod n..
How did u get 2 as answer
Thank you mam
You're welcome 😊
thankuuuuuu====🤩🤩
you made it so clear
My pleasure! Keep learning, keep sharing 🙂
If a>n then solution exists or not??
Plz someone help me out to how we get 24 mod 9= 6 ..
9*2=18...... 24-18=6, so x=6
Thankyou 😀😀 but one question 9*3= 18. But why multiple by 3 , is it right if I was thinking because 3 is divisible by 9& 24
We have done 9×2 because it gives us 18.
9*3=27 which is greater than 24
So, when it is 24 mode 9..... we have to multiple a number with 9 such that it gives us product as highest number lesser than 24
@@CSEconceptswithParinita thankyou soo much for you help🙂🙂☺️
My pleasure dear! Keep learning, keep sharing 😊
Tq tq so much ma'am 🙏
Keep learning, keep sharing ✌ 😊
Thank you very much for sharing this mam...it's really helpful
My pleasure! Keep learning, keep sharing💛😊
Use Fermat's Theorem to find a number x between 0 and 28
with x ^ 85 congruent to 6 (modulo 29). Can please make an explanation video on this?
Thank you so muchhh🥰✨
Keep learning, keep sharing 😊
Can we simplify 2 mod 18??
Yes
mam u've explained very well 👏👏
Keep learning, keep supporting ✌😊
Thank you mam its very usefull ✨️
Keep learning, keep sharing ✌🙂
Ma'am can I write -3 mod 9 instead of 6 mod 9 in the last part( x = 24 mod 9)? I think -3 will be the least residue
what is the name of this method?
Thanks Pari ❤
Well explained
Thanks for the acknowledgement 😊
Thank you so much maam🥰
Tq so much mam for making this videos
My pleasure 😊
Keep learning, keep supporting ✌
Thanks madem ❤️❤️❤️👍
You're welcome. Keep learning,keep sharing ✌😊
Very helpful video mam
Thanks for acknowledging 😊
Okay,but for unique solution how to do this??
How to find the inverse? Im getting the same as the question,.....
Thanks a lot
Keep learning, keep sharing ✌ 😊
Amazing, thank you!
My pleasure 😊
Thanks ma'am 😊
Keep learning, keep sharing ✌ 😊
Thank you!
Keep learning, keep supporting ✌😊
Best 🙏🙏🙏
Thanks, keep learning keep sharing 😊
Amazing concept thanku ✌️👌
You're welcome. Keep learning, keep sharing ✌😊
How did you know that 2 solution exists, can u sometimes get 3 values of x
by the gcd. As gcd(14,18)=2 so there exist 2 solution.
@@mathmom102350 thank you, got it)