olymmath

TW-TST 1999 Problem 4

    Let P∗P^{*} be the set of primes less than 1000010000 . Find all possible primes p∈P∗p\in P^{*} such that for each subset S={p1,p2,...,pk}S=\{p_{1},p_{2},...,p_{k}\} of P∗P^{*} with k≥2k\geq 2 and each p∉Sp\not\in S , there is a q∈P∗−Sq\in P^{*}-S such that q+1q+1 divides (p1+1)(p2+1)...(pk+1)(p_{1}+1)(p_{2}+1)...(p_{k}+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 tw-tst/1999/p4 · Tag XG7XWRZX7F · Edit this page on GitHub · Keys: j next, k previous