Directions: Directions: Use the digits 0 to 9, at most one time each, to make a true statement. Source: Brian Errey

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

## Adding Products

Directions: Old Mother Hubbard is baking cookies so her cupboards won’t be bare anymore! She bakes 109 cookies in all. She bakes the cookies on 4 cookie sheets. Each cookie sheet is arranged into equal rows and columns, but not every cookie sheet has the same number of rows and columns. Using digits 0-9, at most once, how might the …

Read More »## Multiplying Fractions 4

Directions: Using the digits 1 to 9 at most once each time, fill the boxes to make the greatest possible product. Source: Marc DeArmond

Read More »## Prime Factorization 2

Directions: Using the digits 0 to 9 at most one time each, fill in the boxes to make the greatest possible product. Source: Robert Kaplinsky

Read More »## Adding Parts of a Whole

Directions: Using the digits 1 to 9, at most one time each, make the following statement true. Source: Miles Knight

Read More »## Greatest Difference of Two Decimal Numbers

Directions: Using the digits 0 to 9, at most one time each, fill in the boxes to create two numbers that both round to 5 and have the greatest (or least) possible difference with 5. Each digit may only be used once. Source: Mike Wiernicki

Read More »## Order of Operations 6

Directions: Using the digits 1 to 5, at most one time each, place a digit in each box to create an expression with the largest possible value. Source: Matt Donahue

Read More »## Using 1/2 as a Benchmark

Directions: Using the digits 1 through 9 only one time each, fill in the blanks to make true statements. For the fraction less than 1/2, try to make the greatest number possible. For the fraction greater than 1/2, try to make the least number possible. Source: Alyson Eaglen

Read More »## Sum to 1,000 – Two Addends

Directions: Arrange the digits 1-6 into two 3-digit whole numbers. Make the sum as close to 1000 as possible. Source: Ian Kerr

Read More »## Largest Possible GCF #2

Directions: Using the digits 0-9 at most once, fill in the boxes to make the largest possible greatest common factor. Source: Howie Hua

Read More »