Solve the congruence to the smallest possible modulus.

  • Thread starter Thread starter sg001
  • Start date Start date
  • Tags Tags
    Modulus
Click For Summary
SUMMARY

The discussion focuses on solving the congruence equation 38x ≡ 10 (mod 84) by utilizing the GCD algorithm. The user simplifies the equation to 19x + 42y = 5 after determining the GCD of 2. The solution process involves transforming the equation into smaller moduli, specifically 4y ≡ 5 (mod 19), and subsequently reducing it further to 3z ≡ 5 (mod 4) and 4w ≡ 5 (mod 3). This method demonstrates the power of the GCD algorithm beyond merely finding the GCD, allowing for systematic back substitution to find all variables.

PREREQUISITES
  • Understanding of modular arithmetic and congruences
  • Familiarity with the GCD (Greatest Common Divisor) algorithm
  • Basic algebraic manipulation skills
  • Knowledge of Diophantine equations
NEXT STEPS
  • Study the Extended Euclidean Algorithm for solving linear Diophantine equations
  • Learn about modular inverses and their applications in solving congruences
  • Explore the Chinese Remainder Theorem for systems of congruences
  • Practice solving various congruence problems using different modulus values
USEFUL FOR

Students of mathematics, particularly those studying number theory, educators teaching modular arithmetic, and anyone interested in solving congruences and Diophantine equations.

sg001
Messages
134
Reaction score
0

Homework Statement



solve the congruence to the smallest possible modulus.

38x\equiv10 (mod84)



Homework Equations





The Attempt at a Solution



Ok so I thought I knew how to do these but apparently not.

So I start out by

38x+84y = 10

Now I think I should find the gcd so I can simplify

so

84 = 38(2) + 8\Rightarrow 8= 84 - 38(2)

38= 8(4) + 6 \Rightarrow 6= 38 - 8(4)

8 = 6(1) + 2 \Rightarrow 2 = 8 - 6(1)

6 = 2(3) + 0 \Leftrightarrow gcd = 2

so 19x + 42y = 5


but then where? I seem to get lost at this point?
 
Physics news on Phys.org
You need to use GCD algorithm, but not just to find GCD. It's a more powerful tool. Let me demonstrate.

Lets start with your simplified version, 19x=5 (mod42), which you turn into 19x+42y=5. But if you know x, you know y. If you know y, you know x. So we can switch things around.

42y=5 (mod19)

Except 42>19, and we can take 19 away twice.

4y=5 (mod19)

Better! But why should we stop?

4y+19z=5

19z=5 (mod4)

3z=5 (mod4)

3z+4w=5

4w=5 (mod3)

w=5

Woo-hoo! Now, you can use w to find z, z to find y... I'll let you do all that.
 
K^2 said:
You need to use GCD algorithm, but not just to find GCD. It's a more powerful tool. Let me demonstrate.

Lets start with your simplified version, 19x=5 (mod42), which you turn into 19x+42y=5. But if you know x, you know y. If you know y, you know x. So we can switch things around.

42y=5 (mod19)

Except 42>19, and we can take 19 away twice.

4y=5 (mod19)

Better! But why should we stop?

4y+19z=5

19z=5 (mod4)

3z=5 (mod4)

3z+4w=5

4w=5 (mod3)

w=5

Woo-hoo! Now, you can use w to find z, z to find y... I'll let you do all that.

ok good got it now thanks.
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
2K
Replies
6
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
Replies
2
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
6K
  • · Replies 7 ·
Replies
7
Views
2K
Replies
5
Views
1K
Replies
15
Views
2K