olymmath

CMO 1991 Problem 4

  • Paper

Can ten distinct numbers a1,a2,b1,b2,b3,c1,c2,d1,d2,d3a_1, a_2, b_1, b_2, b_3, c_1, c_2, d_1, d_2, d_3 be chosen from {0,1,2,…,14}\{0, 1, 2, \ldots, 14\} , so that the 1414 differences ∣a1−b1∣|a_1 - b_1| , ∣a1−b2∣|a_1 - b_2| , ∣a1−b3∣|a_1 - b_3| , ∣a2−b1∣|a_2 - b_1| , ∣a2−b2∣|a_2 - b_2| , ∣a2−b3∣|a_2 - b_3| , ∣c1−d1∣|c_1 - d_1| , ∣c1−d2∣|c_1 - d_2| , ∣c1−d3∣|c_1 - d_3| , ∣c2−d1∣|c_2 - d_1| , ∣c2−d2∣|c_2 - d_2| , ∣c2−d3∣|c_2 - d_3| , ∣a1−c1∣|a_1 - c_1| , and ∣a2−c2∣|a_2 - c_2| are all distinct?

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 ca-cmo/1991/p4 · Tag ZBJRMF3WY2 · Edit this page on GitHub · Keys: j next, k previous