olymmath

IN-TST 2009 Problem 11

    Find all integers n≥2n\ge 2 with the following property:

    There exists three distinct primes p,q,rp,q,r such that whenever a1,a2,a3,⋯ ,ana_1,a_2,a_3,\cdots,a_n are nn distinct positive integers with the property that at least one of p,q,rp,q,r divides aj−ak ∀1≤j≤k≤na_j - a_k \ \forall 1\le j\le k\le n , one of p,q,rp,q,r divides all of these differences.

    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 in-tst/2009/p11 · Tag 7RMB67QVK2 · Edit this page on GitHub · Keys: j next, k previous