2022 IMO Problems/Problem 3

Revision as of 09:39, 16 July 2022 by Renrenthehamster (talk | contribs) (Created page with "==Problem== Let <math>k</math> be a positive integer and let <math>S</math> be a finite set of odd prime numbers. Prove that there is at most one way (up to rotation and refle...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem

Let $k$ be a positive integer and let $S$ be a finite set of odd prime numbers. Prove that there is at most one way (up to rotation and reflection) to place the elements of $S$ around a circle such that the product of any two neighbours is of the form $x^2 + x + k$ for some positive integer $x$.

Solution

https://www.youtube.com/watch?v=nYD-qIOdi_c [Video contains solutions to all day 1 problems]