Erdős problem 698 · problems.science

Is there some $h(n)\to \infty$ such that for all $2\leq i<j\leq n/2$ $\textrm{gcd}\left( \binom{n}{i},\binom{n}{j}\right) \geq h(n)?$

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:711214b3aeb7796c94e6807eebde705cecd45a5e1bacd2a54dae1800799b5f66
Metadata: sha256:34b62416affccf224a17f2751b7cd3ec00b86951fceaae4a93188e35bda50824
Observation: sha256:8c823d621b7e1256c8e47c60a5f1c54c016a5507e6f27b2bab537f6f5f232067
Content: sha256:0c8f6fcc6563fb4a17542c807edd481d08289b08c759ca7d484e683e7b698d34

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