Skip to content

Erdős problem 699

Start work

Erdős Problem 699. Is it true that for every 1≤i<j≤n/21 \le i < j \le n / 2 there exists a prime p≥ip \ge i with p∣gcd⁡((ni),(nj))p \mid \gcd\big(\binom{n}{i}, \binom{n}{j}\big)?

How the state got here

1 of 6 recorded
  1. Prior stateNone retained
  2. WorkNo submitted work retained
  3. VerificationNo check retained
  4. DecisionNo Repository has decided
  5. StandingA Result stands here
  6. Next gapNot recorded

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.

Correction history

No correction history

Technical detailsExact roots, source, and retained record identifiers

Exact provenance

Problem row
sha256:4ad495dcd8f24e93cbce0bf2275795d9dacfbca097231811ece941626d25a3d1
Metadata
sha256:01f3c1c72c6ac4cf7b4a18e7ae6b56e5a80bc1a4882de1e7588abf09dcb6945a
Observation
sha256:9c8326e865b6017b103af7611c852a06776d81964979b8ab5a1b800cd550dff6
Content
sha256:77e9ca843b3e5f65ab2cfa9c5eac84f488281576a824c9a7bcfa6c483d338df3
Repository
sha256:a956b84c437202e5a02cc9e036a621bd14a302b34a75758115730bdbb77c52a4
Projection
sha256:a4a96441668a9f8b33afbcb3f696a2639f5fae145f36ddc063d7f67d5fb87ce8
Source commit
36c6d0fef71a3fec84d9dcd5eeca4e22e378f7cb
Upstream sourceInspect recordsSource JSON