Skip to content

Erdős problem 699

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

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

Retained declaration

FormalConjectures/ErdosProblems/699.lean

Formal Conjectures

FormalConjectures/ErdosProblems/699.leanErdos699.erdos_6991 lineExact file
True ↔ ∀ (n i j : ℕ), 1 ≤ i → i < j → j ≤ n / 2 → ∃ p, Nat.Prime p ∧ i ≤ p ∧ p ∣ (n.choose i).gcd (n.choose j)
OpenStatement only, no proof

Continue

Start a contributionBrowse the source filesOpen the collection entry

Search problems.science

Find a Problem, Result, source, or page