Hello, jzellt!
I'll use the "greatest integer function": .
30! containsFactor 30! into prime factors.
. . How do we know this?
Every 2nd term is even, contains a factor of two.
. . There are: . factors of two.
But every 4th term has a factor of 4 , which contributes an additional two.
. . There are: . more factors of two.
And every 8th term has a factor of 8 , which contributes yet another two.
. . There are: . more factors of two.
Also every 16th term has a factor of 16 , which ... etc.
. . There are: . more factor of two.
Hence, contains: . factors of two.
In a similar fashion, we find the number of threes: .
And the number of fives: .
And the number of sevens: .
. . and so on . . .
Therefore: .
Thank you for a superb explanation on how to factor into prime numbers. I've been reading on internet for three days and didn't get it until now.
I just want to add the following comparison with 10!
(since I personally didn't understand your explanation fully and I was a bit suspicious as to where number 6 went - (in the calculation of 10!))
(1*)2*3*4*5*6*7*8*9*10
2*2*2*2*2*2*2*2*3*3*3*3*5*5*7
Both sequences can be eliminated with each other like in a crossword, and it is super-cool.
I guess the prime factors of a factorial really explains why where is no square prime in the factorial of n!
The last prime is always single.
But is there an ordinary square in any n! (?) And if so, would that be possible to puzzle the prime numbers to a square like in the graphical rectangle representation of the fibonacci sequence?(but in a square?)