triangle
... Each auxiliary figure must be determined, but not underdetermined or overdetermined. ...
... Each auxiliary figure must be determined, but not underdetermined or overdetermined. ...
Congruent Triangles (part 2)
... But......do we need all six pairs of corresponding parts to be congruent to prove two triangles are congruent??? Could we prove two triangles are congruent if we only had three pairs of congruent corresponding sides? ...
... But......do we need all six pairs of corresponding parts to be congruent to prove two triangles are congruent??? Could we prove two triangles are congruent if we only had three pairs of congruent corresponding sides? ...
Geometry Midterm Review Fall 2015 new format
... then there are two more pairs of congruent corresponding angles, and the remaining pair of sides are also congruent. ...
... then there are two more pairs of congruent corresponding angles, and the remaining pair of sides are also congruent. ...
Apollonian network
In combinatorial mathematics, an Apollonian network is an undirected graph formed by a process of recursively subdividing a triangle into three smaller triangles. Apollonian networks may equivalently be defined as the planar 3-trees, the maximal planar chordal graphs, the uniquely 4-colorable planar graphs, and the graphs of stacked polytopes. They are named after Apollonius of Perga, who studied a related circle-packing construction.