This question is similar to one here, but it's not the same.
So, I want to ask WolframAlpha with math input (I don't know natural language) if the following identity holds (of course it does, it's a recurrence for binomials):
$$\frac{n!}{k!(n-k)!} = \frac{(n-1)!}{k!(n-k-1)!}+\frac{(n-1)!}{(n-k)!(k-1)!}$$ for $n, k$ positive integers.
How can I do that?
My tries: first: Is \frac{n!}{k!(n-k)!} = frac{(n-1)!}{(n-k-1)!k!}+\frac{(n-1)!}{(n-k)!(k-1)!}? - gives it is not true - it gives counterexamples with negative fractions.
second: Is \frac{n!}{k!(n-k)!} = frac{(n-1)!}{(n-k-1)!k!}+\frac{(n-1)!}{(n-k)!(k-1)!} assuming n, k natural? - doesn't give an answer if it is true or not.
n!/(k!(n-k)!)-((n-1)!/((n-k-1)!k!)+(n-1)!/((n-k)!(k-1)!))– Cesareo Aug 20 '24 at 16:17