Problem

erdos:699

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)

Open Current State

Declared status: falsifiable
Formalization: formalized
Subjects: number theorybinomial coefficients
OEIS: N/A
Sources: source:erdos-problemssource:formal-conjectures
Statement: www.erdosproblems.com

Matching claims

0

No direct claims

This problem has no directly related claim record.

Browse this Repository’s Claims