*p>n? set prime

by atsw
Tags: 2p>n, p>n, prime
If you mean something like {1,2,....n} then it's true for n>1. What comes to mind immediately is IIRC Bertrand's Postulate which indicates that for any $$m \in \mathbb{N}$$, there is a prime $$p$$ with $$m \leq p \leq 2m$$ , and since $$2^{\frac{n}{2}}>n$$ for n sufficiently large.