olymmath

EGMO 2017 Problem 5

  • Day 2

Let n≥2n \geq 2 be an integer. An nn-tuple (a1,a2,…,an)\left(a_{1}, a_{2}, \ldots, a_{n}\right) of positive integers is expensive if there exists a positive integer kk such that

(a1+a2)(a2+a3)⋯⋯(an−1+an)(an+a1)=22k−1.\left(a_{1}+a_{2}\right)\left(a_{2}+a_{3}\right) \cdots \cdots\left(a_{n-1}+a_{n}\right)\left(a_{n}+a_{1}\right)=2^{2 k-1} .

a) Find all positive integers n≥2n \geq 2 for which there exists an expensive nn-tuple. b) Prove that for every positive integer mm there exists an integer n≥2n \geq 2 such that mm belongs to an expensive nn-tuple.

There are exactly nn factors in the product on the left hand side. Harun Hindija, Bosnia and Herzegovina

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

Similar problems

These problems have the most words in common with this statement.

Locator egmo/2017/p5 · Tag 6YG736VD1W · Edit this page on GitHub · Keys: j next, k previous