Tag Archives: DOK 3: Strategic Thinking

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) 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, fill in the boxes 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

Directions: Using the digits 1 to 9 at most one time each, fill in the boxes 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, 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

Directions: Using the digits 1 to 9 at most one time each, fill in the boxes 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

Directions: Using the digits 1 to 9, at most one time each, fill the boxes below to create the smallest possible difference. Source: Graham Fletcher

Directions: Using the digits 0-9 at most one time each, fill in the boxes below to make a true statement. Source: Graham Fletcher

Directions: Using the digits 1 to 9 at most one time each, fill in the boxes to make a polynomial of the highest degree. Source: Robert Kaplinsky