Erdős problem 700

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

Sources

The source's own material, retained exactly.

9 retained statements36c6d0fef71a

FormalConjectures/ErdosProblems/

700.lean

Retained formal statement6 of 9

f n unfolds to the infimum of fSet n.

FormalConjectures/ErdosProblems/700.leanErdos700.f_eq1 lineExact file

1∀ (n : ℕ), Erdos700.f n = sInf (Erdos700.fSet n)

APIStatement only, no proof