Erdős problem 699Erdő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)?WorkspaceContinue locallyOpen sourceSign in to contributeOpen this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.FilesErdős problem 6994 retained source recordsCanvaspublic previewSource#699→ResultNone→Checks0