MathCastle
Proof WritingHardWhat a Proof Is

What a Proof Is · Hard problem

For an integer n>1n > 1, which statement is exactly the negation of "nn is prime", and so can serve as the definition of "nn is composite"?