Let n be a positive integer greater than 5

Let n be a positive integer greater than 5.
Show that the sum of the divisors of n! is not divisible by n!

Other urls found in this thread:

en.wikipedia.org/wiki/Perfect_number
en.wikipedia.org/wiki/Euclid–Euler_theorem
twitter.com/NSFWRedditImage

Why? That's dumb lul

Because you're not a brainlet

Trivial (prime factorization).

sum of the divisors of n! is 1 + 2 + 3 + ... + n which is always lower than n! for every n > 5

>sum of the divisors of n! is 1 + 2 + 3 + ... + n
imagine being this wrong

>his sum of divisors of n! doesn't even include n!
Why did you even post?

there is nothing mentioned about factoring

so wrong you look and see numbers

>there is nothing mentioned about factoring
What?