Re: Some question in prime number!

On 3월1일, 오전6시26분, µ <m....@xxxxxxxxx> wrote:
Cooper a écrit :

Next choose the largest prime among less than n and denote it P.
Then 2P should be greater than n by bertrand postulate and P is the
largest prime number.

Bertrand postulate (indeed, it is a theorem) is: given an integer n>2,
there exists a prime number between n and 2*n.

If 2P<n, there is some prime P_1 between P and 2P by Bertrand
postulate but it contradicts to that P is the largest prime among less
than n.
.