olymmath

USAMO 1980 Problem 2

  • Day 1
  • Answer

Find the maximum possible number of three term arithmetic progressions in a monotone sequence of nn distinct reals.

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

m^2 \text{ for } n=2m+1, m(m-1) \text{ for } n=2m

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/1980/p2 · Tag W5AMP0QXSE · Edit this page on GitHub · Keys: j next, k previous