olymmath

IR-TST 2018 Problem 16

  • Test 3

We say distinct positive integers a1,a2,…,ana_1,a_2,\ldots ,a_n are "good" if their sum is equal to the sum of all pairwise gcd⁡\gcd 's among them. Prove that there are infinitely many nn s such that nn good numbers exist.

Proposed by Morteza Saghafian

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/2018/p16 · Tag 5P52X0YHSR · Edit this page on GitHub · Keys: j next, k previous