Tag Archives: Nanette Johnson

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: Using the digits 1 through 9, at most one time each, fill in the boxes to make the statement true. Source: Nanette Johnson, based on Giselle Garcia’s problem

Directions: Using the digits 1 to 9 at most one time each, fill in the boxes to and make the greatest/least product. Source: Nanette Johnson

Directions: Using the digits 1 to 9 at most one time each, fill in the boxes to make the biggest/smallest product. Source: Nanette Johnson

Directions: Using the digits 1 to 9 at most one time each, fill in the boxes to make the biggest/smallest product. Source: Nanette Johnson

Directions: How many ways can you determine the location of the line of reflection for isosceles triangle XYZ that maps Point X to Point Z? Source: Irvine Math Project, Nanette Johnson, and Robert Kaplinsky.

Directions: Find the largest area for the rectangle filling the boxes with numbers 1 through 9. You may use a digit at most once. Source: Nanette Johnson, Inspired by Mike Chamberlain’s Problem

Directions: Write at least two linear equations so that the solution of the system of equations of that line and 4x + y = 8 is (3, -4) Source: Nanette Johnson

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