Browse · MathNet
PrintIMO 2016 Shortlisted Problems
2016 geometry
Problem
Let be an odd positive integer. In the Cartesian plane, a cyclic polygon with area is chosen. All its vertices have integral coordinates, and the squares of its side lengths are all divisible by . Prove that is an integer divisible by .
Solution
Let and let for . By the Shoelace Formula, the area of any convex polygon with integral coordinates is half an integer. Therefore, is an integer. We shall prove by induction on that is divisible by . Clearly, it suffices to consider where is an odd prime and .
For the base case , let the side lengths of be , , where are positive integers. By Heron's Formula, This shows is divisible by . Since is odd, is divisible by .
Assume . If the square of length of one of the diagonals is divisible by , then that diagonal divides into two smaller polygons, to which the induction hypothesis applies. Hence we may assume that none of the squares of diagonal lengths is divisible by . As usual, we denote by the exponent of in the prime decomposition of . We claim the following.
- Claim. for .
Proof. The case is obvious since by the condition and the above assumption.
Suppose where . For the induction step, we apply Ptolemy's Theorem to the cyclic quadrilateral to get which can be rewritten as From this, is an integer. We consider the component of of each term in (1). By the inductive hypothesis, we have . Also, we have . These give Next, we have from (2). This implies Combining (1), (2) and (3), we conclude that By , we get . The Claim follows by induction.
For the base case , let the side lengths of be , , where are positive integers. By Heron's Formula, This shows is divisible by . Since is odd, is divisible by .
Assume . If the square of length of one of the diagonals is divisible by , then that diagonal divides into two smaller polygons, to which the induction hypothesis applies. Hence we may assume that none of the squares of diagonal lengths is divisible by . As usual, we denote by the exponent of in the prime decomposition of . We claim the following.
- Claim. for .
Proof. The case is obvious since by the condition and the above assumption.
Suppose where . For the induction step, we apply Ptolemy's Theorem to the cyclic quadrilateral to get which can be rewritten as From this, is an integer. We consider the component of of each term in (1). By the inductive hypothesis, we have . Also, we have . These give Next, we have from (2). This implies Combining (1), (2) and (3), we conclude that By , we get . The Claim follows by induction.
Techniques
Cyclic quadrilateralsCartesian coordinatesFactorization techniques