Start Free Mock LoginAlready registered? Login here

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 $A (1, k) = 26$ , find $k$ .

Options:

Answer:

Solution:

$A (1, k) = 1 + (1 2 k + 1) + (2 k + 2) + 1$ . Setting this equal to 26 gives $k = 4$ .

Stream:JEESubject:MathematicsTopic:Permutation & CombinationSubtopic:nPr & nCr

⏱ 2mℹ️ Source: QB

Doubts & Discussion

Loading discussions...