That's all I'm given?

Let \(S(n) \) denote the sum of digits in decimal representation of \(n\). Find the smallest positive integer value of \(n\) such that \(S(n!) \) does not divide \(n!\).

Adapted from another forum.
×

Problem Loading...

Note Loading...

Set Loading...