Browse · MathNet
Print28th Hellenic Mathematical Olympiad
Greece number theory
Problem
In the Cartesian plane we consider the points , , ..., , as well as the line segments . A point of the Cartesian plane will be called "good" if its coordinates are integers and lies in the interior of a line segment , . Also a line segment from , will be called "good" if it contains at least one "good" point. Determine the number of "good" points and the number of "good" segments.

Solution
Figure 2
A point will belong in the interior of the line segment , if and only if and have the same slope (with integers and ), that is In order the line segment be "good" it is enough and sufficient the fraction to be reducible (then we have fraction with integer terms equivalent to and its terms give the coordinates of the "good" point ). Hence, if , then the line segment is "good" and we have "good" points at the segment . To the point corresponds the "good" segment , which contains the good point . To point corresponds the "good" segment , which contain the "good" points , , . Working in this way we finally find 24 "good" segments and 140 "good" points.
An easy solution can be given by using the Euler function. . It is known that the number of positive integers lower or equal to and not relatively prime to is . Since , we have Hence the number of good segments is .
A point will belong in the interior of the line segment , if and only if and have the same slope (with integers and ), that is In order the line segment be "good" it is enough and sufficient the fraction to be reducible (then we have fraction with integer terms equivalent to and its terms give the coordinates of the "good" point ). Hence, if , then the line segment is "good" and we have "good" points at the segment . To the point corresponds the "good" segment , which contains the good point . To point corresponds the "good" segment , which contain the "good" points , , . Working in this way we finally find 24 "good" segments and 140 "good" points.
An easy solution can be given by using the Euler function. . It is known that the number of positive integers lower or equal to and not relatively prime to is . Since , we have Hence the number of good segments is .
Final answer
140 good points and 24 good segments
Techniques
φ (Euler's totient)Greatest common divisors (gcd)Cartesian coordinates