Fooling around with factorials -- part 2 -- with thanks to Alisa Meier

Let \(S(n)\) denote the number of digits of \(n\). Then find the sum of all \(n\)'s that satisfy the following equation:

\[\large S(n!) + 1 = n\]


Inspiration.

×

Problem Loading...

Note Loading...

Set Loading...