You are not logged in.
Pages: 1
Could someone...anyone help me with this proof?
Prove that n!+k is divisible by k, for all integers n is less than or equal to 2 and k=2,3,...n.
any help is greatly appreciated thanks
Offline
Did you mean "n is GREATER than or equal to 2"?
This is not a "proof" and this is not a strong area for me, but....
So we just need to show that n! is divisble by k....
n! = 1 * 2 * 3 * ... * k * .... * n-1 * n Since k is a factor of n!, n! must be divisble by k.
Offline
yes i did... n is greater than or equal to 2
Offline
Actually, u imply that k is smaller than n , then n! must contains one k , then k | n! , therefore k | n!+k
Numbers are the essence of the Universe
Offline
Pages: 1