20 ≡ 5(mod 2)
For a ≡ b (mod n) to hold, n must divide a - b
Plug in a = 20, b = 5, and n = 2
Since 15/2 ≠ 7 with no remainder, this congruence relation holds
What is the Answer?
Since 15/2 ≠ 7 with no remainder, this congruence relation holds
How does the Congruence Modulo n Calculator work?
Free Congruence Modulo n Calculator - Given a possible congruence relation a ≡ b (mod n), this determines if the relation holds true (b is congruent to c modulo n).
This calculator has 3 inputs.
What 1 formula is used for the Congruence Modulo n Calculator?
if a ≡ b (mod n) then (a - b)/n is an integer
What 4 concepts are covered in the Congruence Modulo n Calculator?
- congruence modulo n
- Occurs when two numbers have a difference that is a multiple of n.
- congruent
- identical in form
≅ - modulus
- the remainder of a division, after one number is divided by another.
a mod b - remainder
- The portion of a division operation leftover after dividing two integers
