CasePatternLeast N
1Same remainder rLCM + r
2Divisor − remainder = d for every divisorLCM − d
3Same remainder r, and divisible by mFirst LCM × k + r that m divides
4No patternList one form, test against the other

Same remainder r: N = k × LCM + r. Same shortfall d: N = k × LCM − d. Extra divisibility: step through k. No pattern: list numbers of one form and test against the other.

Key takeaways: first look at the remainders (all equal?) and then at the shortfalls (all equal?). Case 1 adds, Case 2 subtracts, Case 3 steps through multiples, Case 4 lists and tests. All valid answers repeat every LCM, which is how 'second least' or 'least four-digit' versions are solved.