Directions: The three triangles on the line are similar. Using the digits 0 to 9 at most one time each, place a digit in each box for the legs of the right triangles. Source: Jay Sydow

Directions: Using the integers -9 to 9 at most one time each, place a digit in each box to create endpoints for two different line segments whose midpoint is (1, 3). One line segment should have a positive slope and the other should have a negative slope. You may reuse all the integers for each line segment. Source: Robert Kaplinsky …

Directions: Given the point (3,5), use digits 1-9, at most one time, to find a point (__, __) that minimizes the slope of the line that passes through the two points. The slope cannot be undefined. Source: Nanette Johnson (Problem Based on Andrew Constantinescu’s Problem) and Andrew Constantinescu

Directions: Given the point (3,5), use digits 1-9, at most one time, to find a point (__, __) that maximizes the slope of the line that passes through the two points. The slope cannot be undefined. Source: Andrew Constantinescu

Directions: Using the digits 1 to 9 at most one time each, fill in the boxes to complete the statement below. Source: Andy Schwen

Directions: Using the integers -4 to 4, at most one time each, create a system of linear equations that has a solution in quadrant 4. x | y —— _ | _ _ | _ _ | _ and y = _ / _ x + _ Source: Robert Kaplinsky

Directions: Using the digits 1 to 9 at most one time each, fill in the boxes to find the greatest and least possible slope. Source: Dane Ehlert

Directions: Fill in the boxes with the digits 1 through 9 so that the lines through each pair of points are perpendicular. Use each digit at most once. Source: Nanette Johnson

Directions: Fill in the boxes with the digits 1 through 9 so that the lines through each pair of points are parallel. Use each digit at most once. Source: Nanette Johnson

Directions: Write a linear equation that has a slope of -100. Source: Kara Colley