Find all ways to end at the bottom

#1

as per the combinatorics,formula will be (n+m-2) C(n-1)

why just n-1 ? I am not getting . Can anyone explain me in detail

#2

@sohampatil_sp (n+m-2)C(n-1) is same as (n+m-2)!/(n-1)!(m-1)! .And one thing we arrive at C notation after calculating the result(we get a number and that number can be represented by this notation) It is not like we are picking n-1 objects from n+m-2

If this resolves your doubt mark it as resolved.

#3

can we have conversation on a call ? I am unable to convey what I want to say

#4

@sohampatil_sp
I see you have reopened this doubt
How can I help you ?

#5

I think I would better explain on a phone call ? I am unable to explain on chat. Is it possible ?

#6

@sohampatil_sp
If TAs start taking doubts on call for anyone everyone will start calling for doubts and that is not possible for us. Maybe you can record an audio and send it here or a link to the audio.
Thanks

#7

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.