PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Very high Entry average rating: No information on entry rating
[parent] linear congruence (Definition)

The linear congruence

$\displaystyle ax\equiv b \pmod{m},$
where $ a$, $ b$ and $ m$ are known integers and $ \gcd{(a,\,m)} = 1$, has exactly one solution $ x$ in $ \mathbb{Z}$, when numbers congruent to each other are not regarded as different. The solution can be obtained as
$\displaystyle x = a^{\varphi(m)-1}b,$
where $ \varphi$ means Euler's phi-function.

Solving the linear congruence also gives the solution of the Diophantine equation

$\displaystyle ax\!-\!my = b,$
and conversely. If $ x = x_0$, $ y = y_0$ is a solution of this equation, then the general solution is
\begin{displaymath}\begin{cases} x = x_0\!+\!km,\ y = y_0\!+\!ka,\ \end{cases}\end{displaymath}
where $ k = 0$, $ \pm1$, $ \pm2$, ...



"linear congruence" is owned by Mathprof. [ owner history (1) ]
(view preamble | get metadata)

View style:

See Also: quadratic congruence, solving linear Diophantine equation

Other names:  first degree congruence

This object's parent.
Log in to rate this entry.
(view current ratings)

Cross-references: general solution, equation, Diophantine equation, Euler's, congruent, numbers, solution, integers
There are 2 references to this entry.

This is version 11 of linear congruence, born on 2004-04-15, modified 2006-10-02.
Object id is 5763, canonical name is LinearCongruence.
Accessed 3693 times total.

Classification:
AMS MSC11A41 (Number theory :: Elementary number theory :: Primes)

Pending Errata and Addenda
None.
[ View all 1 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)