Natural-number congruences #
Two distinct residues a, b < p never differ by a multiple of p: if b ≤ p * m + a, so that
the natural subtraction does not truncate, the difference p * m + a - b is not divisible by p.
This is the arithmetic behind the uniqueness of the decomposition of an exponent as p • μ + ν
with ν i < p. Likewise, since (p - 1) a ≡ -a modulo p, two residues a, b < p with
p ∣ (p - 1) a + b are equal.
Main results #
Nat.not_dvd_mul_add_sub: for distincta, b < pwithb ≤ p * m + a,pdoes not dividep * m + a - b.Nat.eq_of_dvd_sub_one_mul_add: for residuesa, b < p,p ∣ (p - 1) * a + bforcesb = a.TauCeti.sq_sub_one_eq_four_mul_of_mod_four_eq_three: forq ≡ 3 (mod 4), factorq² - 1with the factor4made explicit.