Download presentation
Presentation is loading. Please wait.
Published byArthur Douglas Hampton Modified over 9 years ago
2
Congruent Segments – › Line segments that have the same length. Midpoint – › The point that divides a segment into two congruent segments. Segment Bisector – › A point, line, ray, segment, or plane that intersects the segment at its midpoint.
3
M T D C S Segment Bisector (Segment CD) Midpoint (Point M)
4
When two numeric values are the same, the values are equal. When two geometric figures are the same, the figures are congruent. ST Where is the midpoint of ST? -2 M SM ≅ MT, but their lengths are equal. SM = MT = 4.
5
Coordinate Geometry is the term used to refer to shapes in the Cartesian coordinate plane. We can use our method of finding our midpoint on a number line and apply it to any segment in the coordinate plane! If point A is (x 1, y 1 ) and point B is (x 2, y 2 ), then…
6
(-2, -0.5)(1.5, -4.5)
7
To find the distance between any two points on the coordinate plane, we can use the Pythagorean Theorem for right triangles: a and b are the legs of the triangle and c is the hypotenuse, or longest side, of the triangle.
8
When a segment is in the coordinate plane, if it is horizontal or vertical we can simply count the units from endpoint to endpoint to find its distance. (easy!)
9
When a segment is not horizontal or vertical, we can always draw a right triangle to help us create a formula for finding its length. If we solve for d by taking the square root of both sides, we get our formula!
10
Given 2 points A(x 1, y 1 ) and B(x 2, y 2 ), we can find the distance D from A to B by plugging the coordinates into the formula where they belong. Distance will always be a positive number. If you end up getting a negative answer, check your work!
11
This assignment WILL BE COLLECTED for a completion grade! › Day 1: Do Prac. #1-7, 11, 12 (1 st page of file) › Day 2: Do Prac. #13-18, App. #4 Assignment is due Monday, 8/10 (A-Day) or Tuesday, 8/11 (B-Day)
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.