Start Free Mock LoginAlready registered? Login here

Mathematics - Permutation & Combination Question with Solution | TestHub

MathematicsPermutation & CombinationArrangement under ConstraintMedium2 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.

Find $A (1, 2)$ .

Options:

Answer:

Solution:

For 6 steps using jumps 1 or 2, the numbers of ways with zero, one, two or three 2-jumps are $(0 6), (1 5), (2 4), (3 3)$ . Their sum is $1 + 5 + 6 + 1 = 13$ .

Stream:JEESubject:MathematicsTopic:Permutation & CombinationSubtopic:Arrangement under Constraint

⏱ 2mℹ️ Source: QB

Doubts & Discussion

Loading discussions...