Tag Archives: Daniel Luevanos

Directions: Using the digits 1 to 9 at most one time each, fill in the boxes so x = y. Source: Arnav Gulati and Daniel Luevanos

Directions: Using the digits 1 to 30, at most one time each, fill in the boxes to create a system of two linear equations where (3, 2) is the solution to the system. Source: Daniel Luevanos

Directions: Using the digits 0 to 9, at most one time each, fill in the boxes to make a result that is as close to zero as possible. Source: Daniel Luevanos

Directions: Using the digits 0 to 9, at most one time each, place a digit in each box to make a true statement. Source: Daniel Luevanos

Directions: Create 5 ordered pairs using the whole digits 0 – 9 exactly one time each. Then, create a linear inequality such that: 1. Two of the ordered pairs are solutions to the linear inequality. 2. Two of the ordered pairs are not solutions to the linear inequality. 3. One of the ordered pairs is on the boundary line but …

Directions: Using the digits 1 to 9, at most one time each, create an equation where x has the smallest (or greatest) possible value. Source: Daniel Luevanos

Directions: Using the digits 1 to 9, at most one time each, create an equation where x has a positive (or negative) value. Source: Daniel Luevanos

Directions: Using the digits 0 to 9, at most one time each, fill in the boxes so that the fraction equals the repeating decimal. Source: Daniel Luevanos

Directions: Using the digits 1 to 9, at most one time each, fill in the boxes to create an equation such that the solution is as close to zero as possible. Source: Daniel Luevanos

Directions: Using the digits 1 to 9 at most one time each, fill in the boxes to make the largest (or smallest) sum. Source: Daniel Luevanos