Directions: Using each of the digits from 0-9 only once, fill in the boxes to make the equation true. Source: Denise White

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

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

Directions: Using the digits 0-9 at most once, fill in the boxes to make the smallest possible least common multiple. Source: Howie Hua

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

Directions: Given the point (3,5), use digits 1-9, at most one time, to find a point (__, __) that minimizes the slope of the line that passes through the two points. The slope cannot be undefined. Source: Nanette Johnson (Problem Based on Andrew Constantinescu’s Problem) and Andrew Constantinescu

Directions: Given the point (3,5), use digits 1-9, at most one time, to find a point (__, __) that maximizes the slope of the line that passes through the two points. The slope cannot be undefined. Source: Andrew Constantinescu

Directions: Using the digits 0 through 9, without repeating any digits, find the quotient closest to 1. Source: Michael Dennis