The number of ways of selecting two numbers $a$ and $b, a \in\{2,4,6, \ldots ., 100\}$ and $b \in\{1,3,5, \ldots . ., 99\}$ such that 2 is the remainder when $a+b$ is divided by 23 is :
Solution
<p>$a+b=23\lambda+2$</p>
<p>$\lambda=0,1,2,$ ...., but $\lambda$ cannot be even as $a+b$ is odd</p>
<p>$\lambda=1$ $(a, b)\to12$ pairs</p>
<p>$\lambda=3$ $(a,b)\to35$ pairs</p>
<p>$\lambda=5$ $(a,b)\to42$ pairs</p>
<p>$\lambda=7$ $(a,b)\to19$ pairs</p>
<p>$\lambda=9$ $(a,b)\to0$ pairs</p>
<p>$\vdots$</p>
<p>Total $=12+35+42+19=108$</p>
About this question
Subject: Mathematics · Chapter: Permutations and Combinations · Topic: Fundamental Counting Principle
This question is part of PrepWiser's free JEE Main question bank. 135 more solved questions on Permutations and Combinations are available — start with the harder ones if your accuracy is >70%.