Obtain the eight incongruent solutions of the linear congruence

  • Thread starter Thread starter Math100
  • Start date Start date
  • Tags Tags
    Linear
Click For Summary
SUMMARY

The discussion focuses on solving the linear congruence equation 3x + 4y ≡ 5 (mod 8). It establishes that the greatest common divisor gcd(3, 8) = 1, allowing for the existence of solutions. The inverse of 3 modulo 8 is found to be 3, leading to the general solution x ≡ 7 + 4y (mod 8). The eight incongruent solutions are explicitly listed as (7,0), (3,1), (7,2), (3,3), (7,4), (3,5), (7,6), and (3,7).

PREREQUISITES
  • Understanding of linear congruences
  • Knowledge of modular arithmetic
  • Familiarity with the concept of greatest common divisor (gcd)
  • Ability to compute modular inverses
NEXT STEPS
  • Study the properties of linear congruences in number theory
  • Learn about the Chinese Remainder Theorem
  • Explore the concept of multiplicative inverses in modular arithmetic
  • Investigate applications of congruences in cryptography
USEFUL FOR

Mathematicians, students studying number theory, and anyone interested in solving linear congruences and modular arithmetic problems.

Math100
Messages
817
Reaction score
230
Homework Statement
Obtain the eight incongruent solutions of the linear congruence ## 3x+4y\equiv 5\pmod {8} ##.
Relevant Equations
None.
Consider the linear congruence ## 3x+4y\equiv 5\pmod {8} ##.
Then ## 3x\equiv 5-4y\pmod {8} ##.
Note that ## gcd(3, 8)=1 ## and ## 1\mid (5-4y) ##.
Since ## 3^{-1}\equiv 3\pmod {8} ##, it follows that ## x\equiv 15-12y\pmod {8}\equiv 7+4y\pmod {8} ##.
Thus ## {(x, y)=(7+4y, y)\pmod {8}\mid 0\leq y\leq 7} ##.
Therefore, ## x\equiv 7, y\equiv 0; x\equiv 3, y\equiv 1; x\equiv 7, y\equiv 2; x\equiv 3, y\equiv 3; ##
## x\equiv 7, y\equiv 4; x\equiv 3, y\equiv 5; x\equiv 7, y\equiv 6; x\equiv 3, y\equiv 7. ##
 
Physics news on Phys.org
Math100 said:
Homework Statement:: Obtain the eight incongruent solutions of the linear congruence ## 3x+4y\equiv 5\pmod {8} ##.
Relevant Equations:: None.

Consider the linear congruence ## 3x+4y\equiv 5\pmod {8} ##.
Then ## 3x\equiv 5-4y\pmod {8} ##.
Note that ## gcd(3, 8)=1 ## and ## 1\mid (5-4y) ##.
Since ## 3^{-1}\equiv 3\pmod {8} ##, it follows that ## x\equiv 15-12y\pmod {8}\equiv 7+4y\pmod {8} ##.
Thus ## {(x, y)=(7+4y, y)\pmod {8}\mid 0\leq y\leq 7} ##.
Therefore, ## x\equiv 7, y\equiv 0; x\equiv 3, y\equiv 1; x\equiv 7, y\equiv 2; x\equiv 3, y\equiv 3; ##
## x\equiv 7, y\equiv 4; x\equiv 3, y\equiv 5; x\equiv 7, y\equiv 6; x\equiv 3, y\equiv 7. ##
That's right. The remainders modulo ##8## do not form a field because none of the even numbers has a multiplicative inverse. The odd remainders have such so that you could solve the equation.
 
  • Like
Likes   Reactions: Math100
And here is how the straight looks like. Of course, only the circled points do really count, so the green lines is a bit cheating.
1661294620661.png
 
  • Informative
Likes   Reactions: Math100

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 6 ·
Replies
6
Views
1K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K