Skip to main content
OlympiadHQ

Browse · MathNet

Print

Japan Mathematical Olympiad

Japan counting and probability

Problem

Let us call a point in the -plane a good point if each of its coordinates is an integer from to . Let us also call polyline a Z-shaped polyline if four points , , , satisfy all the following conditions: , , , are good points. , . , . , . Determine the smallest possible positive integer such that, there exist Z-shaped polylines which satisfy the following condition: Any good point lies on for some . Note that polyline is the union sets of line segments (including both endpoints) , and .
Solution
Let us call a good point on or excluding a special point. Consider Z-shaped polyline and let , , , . Since , and , any special point on Z-shaped polyline coincides with either , , or . Assume that both and are special points. Then , , and holds. Therefore we have , which contradicts the condition . Therefore at most three special points lie on a Z-shaped polylines, hence we must select at least Z-shaped polylines to meet the condition.

Denote polyline with , , , by . Define Z-shaped polylines , , as following: For , let be . For , let be . Let be .

Note that any good point on lies on . For , any good point on lies on . For , any good point on lies on . Let and consider good points on .
When , lies on . When , lies on .

When , lies on . When , lies on . When , lies on .

We have shown that any good point lies on any of , and . Therefore the smallest possible number of Z-shaped polylines is .
Final answer
1333

Techniques

Pigeonhole principleColoring schemes, extremal argumentsCartesian coordinatesCombinatorial Geometry