文摘
Straightedge and compass constructions play a special role in geometry. First, for a very long time, they were used in practice by land surveyors or architects in order to solve concrete problems. Second, they are an inexhaustible source of exercises used to learn concepts in geometry. And finally, some famous impossible problems related to straightedge and compass constructions waited centuries before being solved using algebra. In addition, not knowing if a well-constrained problem is constructible with straightedge and compass or not, make that kind of problems more difficult to address: should we synthesize a program or on the contrary find a counterexample has to be found and treated using algebra or reduction on it? In this paper, we perform a systematic checking of a whole corpus of problems proposed by William Wernick. We expose our methodology and the algorithm we used. For each problem, its constructibility status is computed and either an algebraic argument or a geometric construction is given.