MathDB

A given finite number of lines in the plane, no two of which are parallel and no three of which are concurrent, divide the plane into finite and infinite regions. In each finite region we write

1

-1

. In one operation, we can choose any triangle made of three of the lines (which may be cut by other lines in the collection) and multiply by

-1

each of the numbers in the triangle. Determine if it is always possible to obtain

1

in all the finite regions by successively applying this operation, regardless of the initial distribution of

1

s and

-1

Problem Statement