Skip to main content
OlympiadHQ

Browse · MathNet

Print

China-TST-2025A

China 2025 geometry

Problem

Given an odd prime . Find the largest positive integer such that there exist integer-coordinate points in the plane, with no three collinear, and for any , twice the area of triangle is not divisible by .
Solution
It is well-known that the area of a triangle with vertices , , is given by (This equals zero if and only if the three points are collinear). Therefore, the condition that , , are non-collinear and twice the area of their triangle is not divisible by is equivalent to and being incongruent modulo .

First, we show that is impossible. Let (). If any three -coordinates are congruent modulo , then the corresponding three points form a triangle whose twice area is divisible by . Otherwise, since is odd, there exists one -coordinate distinct modulo from all others. Without loss of generality, assume is distinct modulo from all other . Consider the values modulo (). Since there are only possible residues, by the pigeonhole principle, two must be equal. If (), then divides .

Next, we construct an example with . Let be a quadratic non-residue modulo . Consider pairs with satisfying for some fixed . There are exactly such pairs (including when , but we exclude this case).

We verify that these points satisfy the condition. For any three points : If two have the same -coordinate, their distance isn't divisible by , and the height from the third point is a positive integer less than , so twice the area isn't divisible by . If all -coordinates are distinct, we show . If they were equal to some , then would hold for three distinct -values, implying has three solutions. This contradicts Lagrange's theorem since (as is a non-residue).

Therefore, the maximal is . □
Final answer
p+1

Techniques

Cartesian coordinatesPigeonhole principleInverses mod nPolynomials mod pQuadratic residues