MathCastle
Proof Writing & Problem SolvingEasy

Proof Writing & Problem Solving · Easy problem

Claim: every integer n≥4n \ge 4 is the sum of exactly two primes (the two primes may be equal). What is the smallest counterexample?

Practice more like this