Difference between revisions of "Linear congruence"
(→Linear Congruences) |
(→Example 1: How to solve) |
||
| Line 6: | Line 6: | ||
, where a, b, c, and p are constants, and x is the variable. | , where a, b, c, and p are constants, and x is the variable. | ||
| − | ==Example | + | ==Example I: How to solve== |
Say <math>5x\equiv 7\pmod{8}</math>. Find <math>x</math>. | Say <math>5x\equiv 7\pmod{8}</math>. Find <math>x</math>. | ||
Revision as of 11:39, 15 August 2006
A Linear Congruence is a congruence mod p of the form
, where a, b, c, and p are constants, and x is the variable.
Example I: How to solve
Say 
. Find 
.
Solution:
, so
, because 5 is relatively prime to 8, we can divide by it.
