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.

Result history

Published changes, performers, checks, and later corrections.

No result history yet

No proposed change is retained for this Problem, so there is nothing to show a decision on.

No correction history

Technical detailsExact roots, source, and retained record identifiers

Problem row: sha256:40a10a72ff65833fd58cef89272acd9b9ce2b98a42ff20619a63e635477c3116
Metadata: sha256:a7867a78323377ab70620292a2f821979277828bfbb9bada8ed22714d864c842
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:d65a957c2efdf2e049a0287920ec58767d1ef2511194b28bc32a2a7f03193591

Repository: sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection: sha256:c9d14c459c518937e758918b5897dc3b22f1a55f07739afe99502f5b046c907a
Source commit: 2415f78e850aeee50afdca525c6f2e0ea606f207