Tag Archives: DOK 3: Strategic Thinking

Two-Step Equations 3

Directions: Using the digits 1 to 9, at most one time each, fill in the boxes to find the largest (or smallest) possible values for the sum of x and y. Source: Erick Lee

Read More »

Partitioning a Line Segment

Directions: Using the digits 1 to 8 exactly one time each, fill in the boxes to create a line segment AB, where between point A and point B, there exists a point P so that it partitions line segment AB into a ratio. Source: Jon Henderson

Read More »

Decimal Product Close To 50

Directions: Using the digits 1 to 9 at most one time each, fill in the boxes so that the product is as close to 50 as possible. Source: Robert Kaplinsky

Read More »

The Triangle Inequality

Directions: Use the integers 1 through 10, at most one time each (7 and 9 can still be used)to complete the scenarios below: Source: Shaun Errichiello

Read More »

Law of Cosines Triangle

Directions: Using the digits 1 to 9 at most one time each, fill in the boxes to fill in the circles of a triangle. The sum of the numbers on each side of the triangle is equal to the length of that side. What is the triangle with the largest (or smallest) angle measure that you can make? Source: Erick …

Read More »