Maths Olympiad Prep

Library / /14 of 17

Geometry Difficulty 6.5 National olympiad Prove it Bulgaria

We call nn lines in the plane three-way if they can be separated into three nonempty sets, X,Y,ZX, Y, Z. Every two lines from the same set are parallel to each other, no two lines from different sets are parallel to each other, and no three lines intersect at a point.

By SnS_n we denote the maximum number of regions into which nn three-way lines can divide the plane. As a region we consider a connected part of the plane, not necessarily finite, whose boundaries are defined by three-way lines.

What is the largest nn for which Sn<128S_n < 128?

(Konstantin Delchev)

Solution

We will derive a general formula for the number of regions. Let the three sets have the number of elements X=x|X| = x, Y=y|Y| = y and Z=z|Z| = z, respectively. The first two divide the plane into a total of (x+1)(y+1)(x+1)(y+1) regions. Each line of the third set intersects the others at x+yx+y points and is divided into x+y+1x+y+1 parts. Each of them divides one of the already obtained areas into two. Thus we get a general formula:
Sx,y,z=(x+1)(y+1)+z(x+y+1)=x+y+z+xy+xz+yz+1. S_{x,y,z} = (x+1)(y+1) + z(x+y+1) = x + y + z + xy + xz + yz + 1.
We note that n=x+y+zn = x + y + z. Furthermore, we have that 3(xy+yz+zx)(x+y+z)2=n23(xy + yz + zx) \le (x + y + z)^2 = n^2 (equivalent to (xy)2+(yz)2+(zx)20(x - y)^2 + (y - z)^2 + (z - x)^2 \ge 0). So Sx,y,zn2/3+n+1S_{x,y,z} \le n^2/3 + n + 1 which is less than 128 for n=18n = 18 (actually, S6,6,6=127S_{6,6,6} = 127, i.e. S18=127S_{18} = 127). Also, S6,6,7=140S_{6,6,7} = 140, so Sn>128S_n > 128 for n19n \ge 19. Therefore, the answer is 18. \square

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.