2022 IMO Problems/Problem 3
Revision as of 08: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...")
Problem
Let be a positive integer and let 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 around a circle such that the product of any two neighbours is of the form for some positive integer .
Solution
https://www.youtube.com/watch?v=nYD-qIOdi_c [Video contains solutions to all day 1 problems]