Tag Archives: 6.NS.3

Directions: Using the digits 0 to 9, at most one time each, place a digit in each box to find the quotient closest to 1. Source: Michael Dennis

Directions: Using the digits 1 to 9, at most one time each, place a digit in each box so that the difference is as close to 50 as possible. NOTE: The digits used in the difference can be repeated. Source: Giselle Garica

Directions: Using the digits 0 to 9, at most one time each, place a digit in each box so that the sum is as close to 10 as possible. Source: Giselle Garcia

Directions: Using the digits 0 to 9, at most one time each, place a digit in each box to make the equation true. Source: Shaun Errichiello

Directions: Using the digits 1 to 9 at most one time each, fill in the boxes to make the largest (or smallest) sum. Source: Daniel Luevanos

Directions: Using the digits 1 to 9, at most one time each, place a digit in each box to make three decimals whose sum is as close to 1 as possible. Source: Robert Kaplinsky

Directions: Using the digits 1 to 9, at most one time each, place a digit in each box 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, place a digit in each box 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, place a digit in each box to make the smallest (or largest) quotient. 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, place a digit in each box to make the smallest (or largest) product. 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