olymmath

IR-TST 2017 Problem 13

  • Test 3

Let n>1n>1 be an integer. Prove that there exists an integer n−1≥m≥⌊n2⌋n-1 \ge m \ge \left \lfloor \frac{n}{2} \right \rfloor such that the following equation has integer solutions with am>0:a_m>0: amm+1+am+1m+2+⋯+an−1n=1lcm(1,2,⋯ ,n)\frac{a_{m}}{m+1}+\frac{a_{m+1}}{m+2}+ \cdots + \frac{a_{n-1}}{n}=\frac{1}{\textrm{lcm}\left ( 1,2, \cdots , n \right )} Proposed by Navid Safaei

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 ir-tst/2017/p13 · Tag 3GNB20TPAH · Edit this page on GitHub · Keys: j next, k previous