13x = 1(mod 60)

Enter a mod b statement

---

Solve the modulus equation

13x ≡ 1(mod 60)

Step 1: Calculate d = (13,60)

GCF (13,60) = 1

Step 2: We check to see if 1 | 1

1  =	1
	1

There will be 1 solutions mod 60

Build Diophantine equation from GCF

13x - 60y = 1

Final Answer

You have 1 free calculations remaining

---

What is the Answer?

How does the Linear Congruence Calculator work?

Free Linear Congruence Calculator - Given an modular equation ax ≡ b (mod m), this solves for x if a solution exists
This calculator has 3 inputs.

What 2 formulas are used for the Linear Congruence Calculator?

ax ≡ b (mod m)
ax + by = c

For more math formulas, check out our Formula Dossier

What 4 concepts are covered in the Linear Congruence Calculator?

congruence

a problem of finding an integer x that satisfies the equation ax = b (mod m)

equation

a statement declaring two mathematical expressions are equal

linear congruence

a problem of finding an integer x that satisfies the equation ax = b (mod m)

modulus

the remainder of a division, after one number is divided by another.
a mod b

Example calculations for the Linear Congruence Calculator

Linear Congruence Calculator Video

Tags:

Add This Calculator To Your Website