Loch's theorem, in the context of mathematics, particularly in number theory, provides a result concerning the divisibility of certain numbers by others. Specifically, it states that if \( p \) is a prime number and \( a \) is an integer not divisible by \( p \), then the order of \( a \) modulo \( p \) divides \( p-1 \).
New to topics? Read the docs here!