A three-digit password is built so that:
Which password is correct?
A. -- B. -- C. -- D. --
List the three conditions as tests. With digits :
With four candidates offered, checking each against three short tests is faster than solving from scratch.
Apply the cheapest test first — distinctness. Option B is --, which repeats the digit . Eliminated immediately, without any arithmetic.
Apply the first-digit rule to the rest.
Options A and C are eliminated. Note that all three of A, C and D happen to have digit sum , so condition (iii) alone would not have separated them — that is the trap in the design.
Confirm the survivor against all three conditions. For --: the digits are all different ✓; ✓; ✓.
Solve directly and see which option survives. From (ii), ; substituting into (iii) gives . Requiring forces , and distinctness rules out only (which gives ). That leaves four legal passwords — , , and — of which only D: 5-3-2 appears among the options.
Need to solve a different problem like this? Open the solver →