olymmath

CMO 2000 Problem 5

  • Day 2

Find all positive integers nn such that there exists integers n1,…,nk≥3n_1,\ldots,n_k\ge 3 , for some integer kk , satisfying n=n1n2⋯nk=212k(n1−1)⋯(nk−1)−1.n=n_1n_2\cdots n_k=2^{\frac{1}{2^k}(n_1-1)\cdots (n_k-1)}-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 cn-mo/2000/p5 · Tag JR6D07NJXB · Edit this page on GitHub · Keys: j next, k previous