Tag Archives: A-REI.12

Directions: Using the integers −9 to 9 at most one time each, place an integer in each box to create a system of inequalities as well as an included and excluded point. Make the points as close together as possible. Source: Robert Kaplinsky

Directions: Using the integers −9 to 9 at most one time each, place an integer in each box to create a system of inequalities as well as an included and excluded point. Source: Robert Kaplinsky

Directions: Create 5 ordered pairs using the whole digits 0 – 9 exactly one time each. Then, create a linear inequality such that: 1. Two of the ordered pairs are solutions to the linear inequality. 2. Two of the ordered pairs are not solutions to the linear inequality. 3. One of the ordered pairs is on the boundary line but …

Directions: Fill each blank with a different integer such that the point (4,4) is within the solution region created by the constraints. Source: Erick Lee