Tag Archives: DOK 3: Strategic Thinking

Directions: Using the digits 0 to 9 at most one time each, fill in the boxes to create a square with one of the vertices at (2,3). Source: John Mahlstedt

Directions: Using the Integers 0-9 (without duplication), provide four sets of points that represent two distinct lines. These lines can be written as two linear equations. Then provide a fifth point that represents the intersection (or solution) of those equations. Line 1: (__, __) and (__, __) Line 2: (__, __) and (__, __) Solution (__, __) Source: Bryan Anderson

Directions: Using Integers 1 to 9 (without repeating any number), fill in the boxes to create a Linear Equations with one solution: Source: Bryan Anderson

Directions: Using the digits 1 to 4 at most one time each, fill in the boxes to make the largest possible product. Source: Robert Kaplinsky

Directions: Using the digits 1 to 9 at most one time each, fill in the boxes so that 2 of the lines are parallel and the third line is a transversal that is as close to perpendicular to the parallel lines as possible. Source: Shelli Foust and Robert Kaplinsky

Directions: Write a quadratic equation that has a y-intercept of 24 and the distance between the x-intercepts is 10. Bonus: find more than 2 quadratic equations. Source: Daniel Luevanos

Directions: Using the digits 1 to 9 at most one time each, fill in the boxes so that the sum is as close to 1/2 as possible. Source: Daniel Luevanos

Directions: Using the digits 0 through 9, find two numbers that round to 500, and have the greatest possible difference. Each digit can only be used once. Source: Michael Wiernicki, Graham Fletcher, and Rachel Nelli.

Directions: Create a set of five positive integers from 1 to 20 that have the same mean, median, and range. Source: Eric Berchtold and Melissa Minnix

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