olymmath

OMCC 2016 Problem 5

  • Day 2

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 n≥2n \geq 2 can be written as the product of rr distinct irie numbers for every integer r≥n−1r \geq n-1 .

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 centro/2016/p5 · Tag B39FA3X4FJ · Edit this page on GitHub · Keys: j next, k previous