ByTheResidueOfADifference​(AngouriMath.​Entity.​Variable,​AngouriMath.​Entity.​Set.​SpecialSet,​AngouriMath.​Entity,​System.​Boolean,​System.​Nullable{System.​ValueTuple{System.​String,​System.​String}}@)

forall x in S : f = g (mod m), or f mod m = g mod m, over a row of whole
numbers, where m is not a number and does not mention x. With
D = f - g: where m divides D at every member the statement holds.
Otherwise, where it holds at one member and m divides D(x + 1) - D(x) at
every member, D has one residue modulo m the whole way along the row, up
from that member and down from it, so it holds at every member. Fermat's little
theorem is the second, with the difference (a + 1)^p - a^p - 1 read by the
binomial theorem.