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: Write a=2m and b=2n−1, where 1≤m,n≤50. Then a+b=2(m+n)−1 must be congruent to 2 modulo 23.
Step 2: The possible sums are 25, 71, 117, and 163 (the odd numbers congruent to 2 mod 23 within the attainable range). The counts of pairs (a,b) with these sums are 12,35,42,19 respectively.
Step 3: The total is 12+35+42+19=108, option C.
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.