MathDB

Problems(4)

golden ratio and pentagons: the flavor of ISL 2002 G5

Source: Moldova 2007 IMO-BMO TST II problem 4

3/23/2007
Consider five points in the plane, no three collinear. The convex hull of this points has area SS. Prove that there exist three points of them that form a triangle with area at most 5510S\frac{5-\sqrt 5}{10}S
ratiogeometrycombinatorial geometrygeometry proposed
balanced polygon

Source: Moldova 2007 IMO-BMO TST I problem 4

3/5/2007
Consider a convex polygon A1A2AnA_{1}A_{2}\ldots A_{n} and a point MM inside it. The lines AiMA_{i}M intersect the perimeter of the polygon second time in the points BiB_{i}. The polygon is called balanced if all sides of the polygon contain exactly one of points BiB_{i} (strictly inside). Find all balanced polygons. [Note: The problem originally asked for which nn all convex polygons of nn sides are balanced. A misunderstanding made this version of the problem appear at the contest]
geometryperimetergeometry proposed
Turan consequence

Source: Moldova 2007 IMO-BMO TST III problem 4

3/24/2007
We are given nn distinct points in the plane. Consider the number τ(n)\tau(n) of segments of length 1 joining pairs of these points. Show that τ(n)n23\tau(n)\leq \frac{n^{2}}3.
geometryrhombusPutnamcombinatorics proposedcombinatorics
p|n!+1, n does not divide p-1

Source: Moldova 2007 IMO-BMO TST IV problem 4

3/25/2007
Show that there are infinitely many prime numbers pp having the following property: there exists a natural number nn, not dividing p1p-1, such that pn!+1p|n!+1.
number theoryprime numbersnumber theory proposed