Find the smallest number that gives the following remainders: 1 - when divided by 2, 2 - when divided by 3, 3 - when divided by 4, 4 - when divided by 5, 5 - when divided by 6.

#
Note that this number, increased by 1, is divisible by 2, 3, 4, 5, 6.

## Answer

$59=\operatorname{LCM}(2,3,4,5,6)-1$.