Tag Archives: Daniel Luevanos

Directions: Using the digits 0 to 9 at most one time each, fill in the boxes to so that there is only one solution. Source: Daniel Luevanos

Directions: Using the digits 0 to 9 at most one time each, fill in the boxes to so that the solutions are integers. Source: Daniel Luevanos

Directions: Using the digits 1 to 9 at most one time each, place a digit in each box to find the greatest (or least) possible values for x. Source: Audrey Mendivil, Daniel Luevanos, and Robert Kaplinsky