Puzzling Asked on January 18, 2021
All diagonals of a convex pentagon are drawn, dividing it in one smaller pentagon and 10 triangles. Find the maximum number of triangles with the same area that may exist in the division.
The best I could do (or anyone can do) is that to draw a regular pentagon, which will give 2 sets of triangles, each having equal area, which means the maximum number for now is 5.
Can it be done better? Also can it be proved that the answer obtained (by someone) will be maximum?
We can do
Things we can't do:
This still leaves open the possibility of
Correct answer by Paul Panzer on January 18, 2021
This may be a bit too simple. and not the intended solution, but
Answered by Jaap Scherphuis on January 18, 2021
Continuing Paul's result:
Let's check them, using the fact that since only areas are considered we can do arbitrary linear maps to fix points:
Therefore,
Answered by AxiomaticSystem on January 18, 2021
Get help from others!
Recent Answers
Recent Questions
© 2024 TransWikia.com. All rights reserved. Sites we Love: PCI Database, UKBizDB, Menu Kuliner, Sharing RPP