Sum divides product?

j=1nj≢0(mod j=1nj) \large \prod_{j=1}^n j \not \equiv 0 \quad \left ( \text{mod} \ \sum_{j=1}^n j \right)

For how many integers nn satisfying 1n1801 \le n \le 180 is the non-congruence above fulfilled?

You may use this List of Primes as a reference.

×

Problem Loading...

Note Loading...

Set Loading...