Find the remainder when 9×99×999×⋯×999 9’s99⋯9 is divided by 1000.
A number or a short expression. Spacing and $ signs are ignored.
Official solution
Note that 999≡9999≡⋯≡999 9’s99⋯9≡−1(mod1000) (see modular arithmetic). That is a total of 999−3+1=997 integers, so all those integers multiplied out are congruent to −1(mod1000). Thus, the entire expression is congruent to −1×9×99=−891≡109(mod1000).
Source: NuminaMath-1.5,
licensed Apache-2.0.
Statement and solution reproduced as published; topic, difficulty and ordering added
by this site.