Tag Archives: 7.NS.1

Directions: Using the integers -9 to 9 at most one time each, fill in the boxes to create an equation where each side has the greatest possible value. Source: Robert Kaplinsky

Directions: Using the integers -9 to 9 at most one time each, fill in the boxes to create two equations. You may reuse all the integers for each equation. Source: Robert Kaplinsky

Directions: Using the integers -3 to 3, at most one time each, fill in the blanks to make each equation true. Source: Jeanmarie Mullen

Directions: Using the digits 1 to 6, at most one time each, fill in the boxes so that top two equations are equal and the bottom equation has the greatest value. Source: Kate Nerdypoo

Directions: Using the integers -5 to 5, at most one time each, write an expression that will have the greatest (or least) absolute value. Source: Michael Wiernicki

Directions: Using the digits 1 to 9 at most one time each, fill in the boxes to make the equality true: Source: Bryan Anderson

Directions: Using the digits 1 to 9 at most one time each, fill in the boxes to make the smallest (or largest) difference. Note: This problem’s difficulty can be adjusted by altering the number of digits (boxes), picking smallest or largest, or by picking either a positive, negative, or both. Source: Robert Kaplinsky

Directions: Using the digits 1 to 9 at most one time each, fill in the boxes to make the smallest (or largest) sum. Note: This problem’s difficulty can be adjusted by altering the number of digits (boxes), picking smallest or largest, or by picking either a positive, negative, or both. Source: Robert Kaplinsky

Directions: Using the digits 1 to 9 at most one time each, fill in the boxes to make the smallest (or largest) difference. Note: This problem’s difficulty can be adjusted by altering the number of digits (boxes), picking smallest or largest, or by picking either a positive, negative, or both. Source: Robert Kaplinsky