Solution of System of Linear Congruence in2 variables|Modular Arithmetic|22mats101Mod-4|Dr. Sujata T

‪@mathforall-st1rk‬
In this video one, more important example of a system of linear congruence equations in two variables is solved.
#drsujatat#engineeringmathematics #modulararithmetic #22mats11 #cryptography
For more videos of engineering mathematics watch the playlist👇
21MAT31
• Numerical Solution For...
21MATM/C101
• Solutions of Higher Or...
21MATS101
• Modular Arithmetic
22MATE101
• Introduction to Integr...

[@Sumit_efx]

The Greatest Common Divisor (GCD), also known as the Greatest Common Factor (GCF) or Highest Common Factor (HCF), of a set of numbers is the largest positive integer that divides each of the numbers without leaving a remainder.
Finding the GCD of 2, 6, and 7:
1. List the factors of each number:
Factors of 2: 1, 2
Factors of 6: 1, 2, 3, 6
Factors of 7: 1, 7
2. Identify the common factors:
The only common factor among 2, 6, and 7 is 1.
3. Conclusion:
Since 1 is the only common factor, the GCD of 2, 6, and 7 is 1.
This means that 2, 6, and 7 are relatively prime to each other; they have no common divisors other than 1.

[@varshini_gowda]

Thank you mam!

[@Mallu_Patil]

❤ tq mam ur video is helpful for students once again Tq mam

[@erisfrangu]

Thank you!

[@Avaneeth_NK]

TQ u so much mam

[@venkateshy5939]

Thank you very much mam 🙏🙏

[@jagannathbarik9293]

Thank you so much mam ❤😊

[@suhaibkhan6198]

Subscription 🎉🎉🎉🎉🎉

[@Amit_0]

Ma:am how to solve system of congruence when gcd(ad-bc,n) not equal to one

[@mathforall-st1rk]

In such case you will get (n-1) incongruent solutions. Refer previous videos. Getting unique solution is special case(iff) gcd (ad-bc, n)=1

[@tuba4588]

​@@mathforall-st1rkunable to understand maam....what affect it will have on the question if gcd of ad - bc, n is not equal to one?

[@bhimubhankur4477]

Little bit not understand mam how to take gcd

[@mathforall-st1rk]

You can watch introductory videos. Still gcd - greatest common divisor.
Divisors of
2 - 1, 2
6 - 1, 2, 3, 6
7 - 1, 7
Among these common divisor is 1
gcd(2 6 7) = 1.

[@GRTarun]

In 3:34 it is -18,7 because ur munusing 6-24

[@mathforall-st1rk]

Yes. No problem, remaining steps are correct. Here we are using gcd (ad-bc, m) = 1 as condition to possess unique solution, gcd (-18, 7) = 1 only.

[@草上飞猪]

x=4 y=7 also a soln. Why soln not unique?

[@vikasn7378]

Mam how to find gcd

[@tejask.s8084]

Same doubt

[@EmpowerU_05]

The number which can divide all(a,b,r)
In this case (2,6,7) 7 is prime number which cannot be divided by any other number but 7 or 1
1 can divide all the three (2,6,7)
Therefore the gcd is 1

[@suhaibkhan6198]

Dammmmmmmmmmmm 🍉🍉 6:19 ​@@djjdndsjaia8jsnd

[@ayushrana3951]

🤦

[@suhaibkhan6198]

@@ayushrana3951 ?