olymmath

IrMO 2019 Problem 1

  • Paper 1

De fine the quasi-primes as follows. ∙\bullet The first quasi-prime is q1=2q_1 = 2 ∙\bullet For n≥2n \ge 2 , the nthn^{th} quasi-prime qnq_n is the smallest integer greater than qn1q_{n_1} and not of the form qiqjq_iq_j for some 1≤i≤j≤n−11 \le i \le j \le n - 1 . Determine, with proof, whether or not 10001000 is a quasi-prime.

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 ie-irmo/2019/p1 · Tag 2KPBC4CSKX · Edit this page on GitHub · Keys: j next, k previous