Chapter 14 Appendix E - Linear congruence

Practice solving linear congruences

Consider a linear congruence \[ ax \equiv b\text{ mod }~(n). \] Pick integer values for \(a,b\) and \(n\), and use the four point algorithm to check for a solution to the congruence.

As an example, try the following values

Now check your answers by entering your values of \(a,b\) and \(n\) in the boxes labelled ‘a’ and ‘b’ below and hit the “Solve Congruence” button.

 

a b n