Directions: Using the digits 1 to 9 at most one time each, place a digit in each box to create three different linear equations whose y-intercepts have integer values. Source: Michelle Kovesi and Harold Jacobs

Directions: Using the integers -9 to 9 at most one time fill in the boxes to create a right triangle on the coordinate plane. Source: Tracy Conte

Directions: Using the digits 0 to 9 at most one time each, place a digit in each box to create a circle tangent to the line x+y=5. Source: Linnea Reyes-LaMon

Directions: Using the integers -9 to 9 at most one time each, fill in the boxes to create a system of equations with a solution in Quadrant 2. Source: Robert Kaplinsky

Directions: Using the integers -9 to 9 at most one time each, fill in the boxes to create two sets of six points: one that has a positive association and one that has a negative association. You may reuse all the integers for each equation. Source: Robert Kaplinsky

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: Using the digits 1 to 9, at most one time each, create 3 different expressions such that their graphs contains any 2 of the 3 following criteria: 1) Horizontal Asymptote @ y = some positive rational number 2) Slant Asymptote with a slope such that: 1 < m ≤ 2 3) Two Vertical Asymptotes Source: Gregory L. Taylor, Ed.D.

Directions: Create two pairs of coordinates on the same line segment that have M (3,4) as their midpoint. Source: Dane Ehlert

Directions: Using the digits 1 to 9 at most one time each, fill in the boxes to write the equation of a line that passes through the point with the largest possible y-intercept. How many solutions can you find?   Source: Andy Schwen