Let n be a positive integer greater than 5.
Show that the sum of the divisors of n! is not divisible by n!
Let n be a positive integer greater than 5
Blake Rogers
Other urls found in this thread:
en.wikipedia.org
en.wikipedia.org
twitter.com
Levi Mitchell
Why? That's dumb lul
Lincoln Perry
Because you're not a brainlet
Eli Rogers
Trivial (prime factorization).
Jose Gutierrez
sum of the divisors of n! is 1 + 2 + 3 + ... + n which is always lower than n! for every n > 5
Jaxon Thomas
>sum of the divisors of n! is 1 + 2 + 3 + ... + n
imagine being this wrong
John Russell
>his sum of divisors of n! doesn't even include n!
Why did you even post?
Joseph Sullivan
there is nothing mentioned about factoring
Joseph Myers
so wrong you look and see numbers
Grayson Johnson
>there is nothing mentioned about factoring
What?
Daniel King
>so wrong you look and see numbers
What?
Charles Russell
Do your own homework OP.
Isaiah Murphy
What a headache...
I'll keep trying.
Asher Harris
Close but no cigar
Aaron Hill
Find me an n! that is a power of 2 times a prime.
It's done enough for me.
Ethan Ross
P.S. n can be an integer greater than 3
I just expanded your theorem lol.
Eli Morris
Probably proved through induction? Too tired rn to try. Wrote a quick python script - the pattern seems to hold.
Left side is n, right side is divisor-sum(n!)%(n!)
Charles Lee
see
Josiah Jenkins
IMAGINE BEING AT COMPUTERS
SO FAT YOU LOOK AND YOU SEE FOOD
Grayson Ross
>en.wikipedia.org
>en.wikipedia.org
How exactly does this solve OPs problem? He asked about divisibility, not equality.