Tag Archives: 8.EE.5

Directions: Using the integers -9 to 9 at most one time each, fill in the boxes to make a linear equation which goes through (5, 4) and has a slope that’s as close to 0 as possible without being horizontal. Source: Robert Kaplinsky

Directions: Using the integers -9 to 9 at most one time each, fill in the boxes to make two linear equations which go through (5, 4): one with a negative slope and one with a positive slope. You may reuse all the integers for each equation. 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 find: the steepest slope the flattest slope the greatest y-intercept the least y-intercept Source: Dane Ehlert