[Imprint]
[Data Privacy Statement]
[E-Mail]
View
long theorem info
. View
the proof
. Back to
main index
. View
the specification
. View
theorem base summary
, View
theorem base listing
, the
used properties by spec
, the
dependency list
, the
symbol table
,
Proof step 31 from proof bertrand-middle-coef-smaller (
previous step
)
∀ j. j ∈ ints → j ≤ sqrt(2 * i), all_prime_divisors(binom_coef(2 * i, i)) = ints + ints0, 2 < i ⊦ Π ints ≤ (2 * i) ^ (sqrt(2 * i) - 1)
Lemma
bertrand-small-primes