olymmath

INMO 2021 Problem 1

  • Answer

Suppose r≥2r \geq 2 is an integer, and let m1,n1,m2,n2,⋯ ,mr,nrm_{1}, n_{1}, m_{2}, n_{2}, \cdots, m_{r}, n_{r} be 2r2 r integers such that

∣minj−mjni∣=1\left|m_{i} n_{j}-m_{j} n_{i}\right|=1

for any two integers ii and jj satisfying 1≤i<j≤r1 \leq i<j \leq r. Determine the maximum possible value of rr.

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

3

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 in-inmo/2021/p1 · Tag Q4YPVFBKK4 · Edit this page on GitHub · Keys: j next, k previous