Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.
Paste your question to our Mathbee AI Mentor below to get an instant step-by-step solution.
Step 1: Each edge (a_i,a_(i+1)) satisfies a_i=2a_(i+1)+1. Iterating k times gives a_1=2^k a_(k+1)+(2^k-1).
Step 2: Since a_(k+1)≥1, the smallest possible a_1 is 2^(k+1)-1. Requiring a_1≤100 gives 2^(k+1)≤101, so k≤5.
Step 3: The chain 95→47→23→11→5→2 has five edges, so the maximum is 5, option D.
Confused by the solution? Ask the AI to explain a specific step, tell you where you went wrong, or break down the key trap in this question.
Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.