A three-digit number has all of its digits different. Writing its digits in reverse order gives a second number, and subtracting the second from the first gives .
Find the smallest number with this property.
Set up the subtraction in expanded form. With digits , , :
The tens digit cancels, so the difference depends only on the first and last digits.
Turn the given difference into a digit condition.
Minimise from the most significant digit down. To make the number as small as possible, first make as small as possible. Since and , the smallest legal choice is
Any smaller would force a negative last digit.
Choose the smallest tens digit that keeps all digits different. The digits and are taken, so cannot be or . The next smallest available digit is
Verify the subtraction. Reversing gives the digit string , i.e. the number :
Digits , , are all different . Compare this with the largest version of the same puzzle, where maximising instead of minimising leads to — the shared engine in both is .
Need to solve a different problem like this? Open the solver →