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

Read More »# Tag Archives: DOK 3: Strategic Thinking

## Commuting Exponents

Directions: Place a set of parenthesis on each term to make the inequality below true: 10^10^100 < 10^10^100 Source: Shaun Errichiello

Read More »## Maximizing Surface Area

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

Read More »## Simplifying Exponential Expressions

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

Read More »## Divisibility

Directions: Using the digits 0 to 9 at most one time each, fill in the boxes to create a three-digit number. Try to create a three-digit number divisible by the greatest (or fewest) amount of the following factors: 2, 3, 4, 5, 6, 8, 9 or 10. Source: Kelly Zinck

Read More »## Divisibility 2

Directions: What is the smallest number, greater than zero, that is divisible by 1, 2, 3, 4, 5, 6, 7, 8, 9, and 10? Source: Brian Lack

Read More »## Inequality Expressions 4

Directions: Using the digits 1 to 9 at most one time each, fill in the boxes to create a true inequality. Source: Bryan Anderson

Read More »## Writing Linear Equations

Directions: Make a table with three points in the same line with 1) a slope not equal to zero 2) and the y-intercept is not a whole number Write the equation for the line. Source: Lane H. Walker

Read More »## One Solution, No Solutions, Infinite Solutions

Directions: Using Integers (without repeating any number), fill in the boxes to create the following types of Linear Equations Source: Bryan Anderson

Read More »## Area of a Quadrilateral on a Coordinate Plane

Directions: Using the digits 0 to 9 at most one time each, fill in the blanks to create a quadrilateral with an area of 16 square units. Source: Daniel Luevanos

Read More »