Maths Olympiad Prep

Library / KöMaL problem A /95 of 136

KöMaL problem A, 2017

Number theory Difficulty 7.0 National Olympiad, round 2 Prove it Hungary

Let n≥2n\ge 2 be an integer. We call an ordered nn-tuple of integers primitive if the greatest common divisor of its components is 11. Prove that for every finite set HH of primitive nn-tuples, there exists a non-constant homogenous polynomial f(x1,x2,…,xn)f(x_1,x_2,\dots,x_n) with integer coefficients whose value is 11 at every nn-tuple in HH.

We don't reproduce this publisher's solutions. Their own solution is here — work the problem first.
Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: KöMaL, licensed Rights held by KöMaL and the MATFUND Foundation. Statement reproduced verbatim; metadata (topic, difficulty) added by this project. Solutions are the publisher's, linked not copied.