Rewrite the following statement using modular expressions Th

Rewrite the following statement using modular expressions:

The numbers r and s differ by some multiple of n

Solution

Let there be two positive numbers, a (the dividend) and b (the divisor), a modulo b (abbreviated as a mod b) is the

remainder of theEuclidean division of a by b. For instance, the expression \"7 mod 3\" would evaluate to 1 because

7 divided by 3 leaves a quotient of 2 and a remainder of 1.

and for 4 mod 2 - leaves a quotient of 2 and remainder of 0.

so

r mod s = k

where k is the remainder.

and k = r-ns, provided r>s.

n is the given multiple.