3.1-3.2 tri cong notes
... polygons are congruent when all of their corresponding parts are congruent. Now… we’re ready to learn some triangle short-cuts. ...
... polygons are congruent when all of their corresponding parts are congruent. Now… we’re ready to learn some triangle short-cuts. ...
4-2: Triangle Congruence by SSS and SAS 4
... congruent Prove ___ parts of one triangle are ____________ to the _________________ parts of another corresponding triangle. ...
... congruent Prove ___ parts of one triangle are ____________ to the _________________ parts of another corresponding triangle. ...
frame the lesson - trinitybasin.net
... angles? Play Simon says with the angles. Can you form a triangle using any three line segments? What is true for all types of triangles? Explore: Can you form this triangle? Use the ruler and your journal to construct a triangle with the side lengths of 3 cm, 8 cm, and 4 cm. (This triangle cannot be ...
... angles? Play Simon says with the angles. Can you form a triangle using any three line segments? What is true for all types of triangles? Explore: Can you form this triangle? Use the ruler and your journal to construct a triangle with the side lengths of 3 cm, 8 cm, and 4 cm. (This triangle cannot be ...
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.