May Olympiad 2012, Level 2, Problem 2
Source:
August 24, 2014
inequalitiesrotationgeometrygeometric transformation
Problem Statement
The vertices of two regular octagons are numbered from to , in some order, which may vary between both octagons (each octagon must have all numbers from to ). After this, one octagon is placed on top of the other so that every vertex from one octagon touches a vertex from the other. Then, the numbers of the vertices which are in contact are multiplied (i.e., if vertex has a number and is on top of vertex that has a number , then and are multiplied), and the products are then added.
Prove that, for any order in which the vertices may have been numbered, it is always possible to place one octagon on top of the other so that the final sum is at least .Note: the octagons can be rotated.