MathDB
Irie numbers

Source: Centroamerican 2016, problem 5

June 21, 2016
number theory

Problem Statement

We say a number is irie if it can be written in the form 1+1k1+\dfrac{1}{k} for some positive integer kk. Prove that every integer n2n \geq 2 can be written as the product of rr distinct irie numbers for every integer rn1r \geq n-1.