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) sum. 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. 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. Source: Robert Kaplinsky

Directions: Using the digits 1 to 9, at most one time each, fill in the boxes to find: the steepest slope the flattest slope the greatest y-intercept the least y-intercept Source: Dane Ehlert

Directions: Using the digits 0 to 9 at most one time each, fill in the boxes to create the following number types: Source: Bryan Anderson

Directions: Using Integers 2 to 9 (without repeating any number), fill in the boxes to create: Source: Bryan Anderson

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: Place a set of parenthesis on each term to make the inequality below true: 10^10^100 < 10^10^100 Source: Shaun Errichiello

Directions: The following prism is made up of 27 identical cubes. What is the greatest possible surface area the prism can have after removing 1 or more cubes from the outside? Source: Brian Lack

Directions: Using the integers 1 to 10 at most one time each, fill in the boxes so that the result is closest to 1. Source: Daniel Luevanos