Description: Our last proving session got as far as 25 because we started with the two "bootstrap" primes 2 and 3, and the next prime is 5, so knowing that 2 and 3 are prime and 4 is not allows to cover the numbers less than 5 ^ 2 = 2 5 . Additionally, nonprimes are "easy", so we can extend this range of known prime/nonprimes all the way until 29, which is the first prime larger than 25. Thus, in this lemma we extend another blanket out to 2 9 ^ 2 = 8 4 1 , from which we can prove even more primes. If we wanted, we could keep doing this, but the goal is Bertrand's postulate, and for that we only need a few large primes - we don't need to find them all, as we have been doing thus far. So after this blanket runs out, we'll have to switch to another method (see 1259prm ).
As a side note, you can see the pattern of the primes in the indentation pattern of this lemma! (Contributed by Mario Carneiro, 18-Feb-2014) (Proof shortened by Mario Carneiro, 20-Apr-2015)
Ref | Expression | ||
---|---|---|---|
Hypotheses | prmlem2.n | |
|
prmlem2.lt | |
||
prmlem2.gt | |
||
prmlem2.2 | |
||
prmlem2.3 | |
||
prmlem2.5 | |
||
prmlem2.7 | |
||
prmlem2.11 | |
||
prmlem2.13 | |
||
prmlem2.17 | |
||
prmlem2.19 | |
||
prmlem2.23 | |
||
Assertion | prmlem2 | |