Langley's Adventitious Angles is a puzzle in which one must infer an angle in a geometric diagram from other given angles. It was posed by Edward Mann Langley in The Mathematical Gazette in 1922.[1][2]

Thumb
Langley's Adventitious Angles
Thumb
Solution to Langley's 80-80-20 triangle problem

The problem

In its original form the problem was as follows:

is an isosceles triangle with
at to cuts in
at to cuts in
Prove [1][2][3]

Solution

The problem of calculating angle is a standard application of Hansen's resection. Such calculations can establish that is within any desired precision of , but being of only finite precision, always leave doubt about the exact value.

A direct proof using classical geometry was developed by James Mercer in 1923.[2] This solution involves drawing one additional line, and then making repeated use of the fact that the internal angles of a triangle add up to 180° to prove that several triangles drawn within the large triangle are all isosceles.

Draw at to intersecting at and draw (See figure on the lower right.)
Since and then and triangle is isosceles with
Since and then and triangle is isosceles with
Since and then triangle is equilateral.
Since and then and triangle is isosceles with
Therefore all the red lines in the figure are equal.
Since triangle is isosceles with
Therefore

Many other solutions are possible. Cut the Knot list twelve different solutions and several alternative problems with the same 80-80-20 triangle but different internal angles.[4]

Generalization

Thumb
adventitious quadrangles problem

A quadrilateral such as BCEF is called an adventitious quadrangle when the angles between its diagonals and sides are all rational angles, angles that give rational numbers when measured in degrees or other units for which the whole circle is a rational number. Numerous adventitious quadrangles beyond the one appearing in Langley's puzzle have been constructed. They form several infinite families and an additional set of sporadic examples.[5]

Classifying the adventitious quadrangles (which need not be convex) turns out to be equivalent to classifying all triple intersections of diagonals in regular polygons. This was solved by Gerrit Bol in 1936 (Beantwoording van prijsvraag # 17, Nieuw-Archief voor Wiskunde 18, pages 14–66). He in fact classified (though with a few errors) all multiple intersections of diagonals in regular polygons. His results (all done by hand) were confirmed with computer, and the errors corrected, by Bjorn Poonen and Michael Rubinstein in 1998.[6] The article contains a history of the problem and a picture featuring the regular triacontagon and its diagonals.

In 2015, an anonymous Japanese woman using the pen name "aerile re" published the first known method (the method of 3 circumcenters) to construct a proof in elementary geometry for a special class of adventitious quadrangles problem.[7][8][9] This work solves the first of the three unsolved problems listed by Rigby in his 1978 paper.[5]

References

Wikiwand in your browser!

Seamless Wikipedia browsing. On steroids.

Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.

Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.