how can i prove this?
$\forall n \exists p (p^2 \leq n <(p+1)^2)$
The domain of quantifiers is N.
It came from discrete mathematics, and I don't know how to start proofing.
how can i prove this?
$\forall n \exists p (p^2 \leq n <(p+1)^2)$
The domain of quantifiers is N.
It came from discrete mathematics, and I don't know how to start proofing.
Copyright © 2021 JogjaFile Inc.
If $n$ is a perfect square we can take $p=\sqrt{n}$. If not let $p$ be the largest natural number for which $p^2 < n$. Then $n < (p+1)^2$, since otherwise we get a contradiction on the maximality of $p$.