Directions: Make the smallest (or largest) sum by filling in the boxes using the whole numbers 1-9 no more than one time each.

### Hint

### Hint

What number does each box represent?

### Answer

### Answer

No answers yet. If you have one, post it in the comments.

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

Might it be useful to model this graphically with desmos or perhaps wolfram alpha? I’ll work on something this week.

Should probably read “Quotient” instead of sum?