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 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