To know whether everyone knows about primes
Number Theory
Level
4
Find the smallest prime number \( n \), such that for all prime numbers \( p \geq n \), \( p^2 + 2 \) is always composite.
by
shivamani patil