Understand the problem

Let $A(XYZ)$ be the area of the triangle $XYZ$. A non-regular convex polygon $P_1 P_2 \ldots P_n$ is called guayaco if exists a point $O$ in its interior such that\[A(P_1OP_2) = A(P_2OP_3) = \cdots = A(P_nOP_1).\]Show that, for every integer $n \ge 3$, a guayaco polygon of $n$ sides exists.

Source of the problem

Cono sur olympiad 2017

Topic
Geometry
Difficulty Level
Easy
Suggested Book
Problem Solving Strategies by Arthur Engel.

Start with hints

Do you really need a hint? Try it first!

A regular polygon is obviously guayaco. As regular polygons are not allowed, we should try to “perturb” the polygon a little bit, preserving the areas.
Let us look at transformations of the plane of the form (x,y)\mapsto (ax+by,cx+dy). Show that, if |ad-bc|=1 then this transformation preserves areas.
The class of transformations defined in hint 2 are known as area-preserving transformations. Clearly, taking the image of a regular n-gon under an area-preserving transformation should do the trick. However, there is a caveat. The resulting polygon might become concave. 
To ensure that the resulting polygon remains convex, it suffices to take an area-preserving map close to the identity. Use a=f(n),b=c=0,d=1/f(n) where f(n) is a number dependent on n. The larger the value of n, the smaller |1-f(n)| should be.

Watch video

Connected Program at Cheenta

Math Olympiad Program

Math Olympiad is the greatest and most challenging academic contest for school students. Brilliant school students from over 100 countries participate in it every year. Cheenta works with small groups of gifted students through an intense training program. It is a deeply personalized journey toward intellectual prowess and technical sophistication.

Similar Problems

Functional Equation Problem from SMO, 2018 – Question 35

Try this problem from Singapore Mathematics Olympiad, SMO, 2018 based on Functional Equation. You may use sequential hints if required.

Sequence and greatest integer | AIME I, 2000 | Question 11

Try this beautiful problem from the American Invitational Mathematics Examination, AIME, 2000 based on Sequence and the greatest integer.

Arithmetic sequence | AMC 10A, 2015 | Problem 7

Try this beautiful problem from Algebra: Arithmetic sequence from AMC 10A, 2015, Problem. You may use sequential hints to solve the problem.

Series and sum | AIME I, 1999 | Question 11

Try this beautiful problem from the American Invitational Mathematics Examination I, AIME I, 1999 based on Series and sum.

Inscribed circle and perimeter | AIME I, 1999 | Question 12

Try this beautiful problem from the American Invitational Mathematics Examination I, AIME I, 2011 based on Rectangles and sides.

Problem based on Cylinder | AMC 10A, 2015 | Question 9

Try this beautiful problem from Mensuration: Problem based on Cylinder from AMC 10A, 2015. You may use sequential hints to solve the problem.

Cubic Equation | AMC-10A, 2010 | Problem 21

Try this beautiful problem from Algebra, based on the Cubic Equation problem from AMC-10A, 2010. You may use sequential hints to solve the problem.

Median of numbers | AMC-10A, 2020 | Problem 11

Try this beautiful problem from Geometry based on Median of numbers from AMC 10A, 2020. You may use sequential hints to solve the problem.

LCM and Integers | AIME I, 1998 | Question 1

Try this beautiful problem from the American Invitational Mathematics Examination, AIME, 1998, Problem 1, based on LCM and Integers.

Problem on Fraction | AMC 10A, 2015 | Question 15

Try this beautiful Problem on Fraction from Algebra from AMC 10A, 2015. You may use sequential hints to solve the problem.