Mathematics - Permutation & Combination Question with Solution | TestHub

MathematicsPermutation & CombinationnPr & nCrMedium2 minQB
MathematicsMediumsingle choice
Passage / Comprehension

A man climbs either one step or k steps at a time. Let A(1,k) be the number of ways he can climb a staircase of 3k steps from the bottom, where k is at least 2.

If , find .

Options:

Answer:
A
Solution:

From the expression for , simplification gives . Hence .

Stream:JEESubject:MathematicsTopic:Permutation & CombinationSubtopic:nPr & nCr
2mℹ️ Source: QB

Doubts & Discussion

Loading discussions...