olymmath

USAMO 1990 Problem 3

  • Day 1

Show that for any odd positive integer we can always divide the set {n,n+1,n+2,…,n+32}\{\mathrm{n}, \mathrm{n}+1, \mathrm{n}+2, \ldots, \mathrm{n}+32\} into two parts, one with 14 numbers and one with 19 , so that the numbers in each part can be arranged in a circle, with each number relatively prime to its two neighbours. For example, for n=1\mathrm{n}=1, arranging the numbers as 1,2,3,…1,2,3, \ldots, 14 and 15,16,17,…,3315,16,17, \ldots, 33, does not work, because 15 and 33 are not relatively prime.

Dataset text NuminaMath olympiads. 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

Locator usamo/1990/p3 · Tag S4GTZ2P8HN · Edit this page on GitHub · Keys: j next, k previous