olymmath

CMO 2014 Problem 2

  • Day 1

For the integer n>1n>1 , define D(n)={a−b∣ab=n,a>b>0,a,b∈N}D(n)=\{ a-b\mid ab=n, a>b>0, a,b\in\mathbb{N} \} . Prove that for any integer k>1k>1 , there exists pairwise distinct positive integers n1,n2,…,nkn_1,n_2,\ldots,n_k such that n1,…,nk>1n_1,\ldots,n_k>1 and ∣D(n1)∩D(n2)∩⋯∩D(nk)∣≥2|D(n_1)\cap D(n_2)\cap\cdots\cap D(n_k)|\geq 2 .

Dataset text AI-MO AoPS. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator cn-mo/2014/p2 · Tag KVFBMSKXM6 · Edit this page on GitHub · Keys: j next, k previous