necessary and sufficient condition for a number to be prime
In algebra and number theory, Wilson's theorem states that a natural number n > 1 is a prime number if and only if the product of all the positive integers less than n is one less than a multiple of n. That is (using the notations of modular arithmetic), the factorial
( n − 1 ) ! = 1 × 2 × 3 × ⋯ × ( n − 1 )
Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).