You are not logged in.
Pages: 1
5) If n ≥ 4, show that 1! + 2! + 3! +.....+n! Cannot be a perfect square.
Offline
When n=4, f(4) = 1! + 2! + 3! + 4! = 1+2+6+24 = 33, which is not a perfect square.
Because 5! and all higher factorials have a 2 and a 5 multiplied together, they are all multiples of 10 and so all end in 0.
This means that adding 5!, 6!, 7!, etc. to 33 will not change its last digit. So when n ≥4, the last digit of the function is 3.
However, perfect squares can only have last digits of 0, 1, 4, 5, 6 and 9. This means that there are no perfect squares that end in 3 and so there cannot be any factorial sums (that contain 4!) that are also perfect squares.
Why did the vector cross the road?
It wanted to be normal.
Offline
It is supposed to be concerning some famous theorem :lol
X'(y-Xβ)=0
Offline
Can't seem to find such a theorem. I found two equivalent ways to achieve the same sequence, but both involve summations themselves.
"In the real world, this would be a problem. But in mathematics, we can just define a place where this problem doesn't exist. So we'll go ahead and do that now..."
Offline
Pages: 1