Erdős problem 700 · problems.science

f n is a lower bound: f n ≤ gcd(n, C(n,k)) for every 1 < k ≤ n/2.

Sources

Browse retained paths and inspect the exact material available for this Problem.

9 retained statements2415f78e850a

FormalConjectures/ErdosProblems/

700.lean

Retained formal statement9 of 9

Lucas (one step): for prime P ∣ n, if P ∤ C(n,k) then P ∣ k.

FormalConjectures/ErdosProblems/700.leanErdos700.prime_dvd_of_not_dvd_choose1 lineExact file

1∀ (P n k : ℕ), Nat.Prime P → P ∣ n → ¬P ∣ n.choose k → P ∣ k

APIStatement only, no proof