How many \(2\) digit even numbers can be formed from the digits \(1,2,3,4,5\) if the digits can be repeated?
CBSE Class 11 Maths · Permutations and Combinations
CBSE Class 11 Maths · Permutations and Combinations
Imagine building a two-slot locker code using only the digits 1, 2, 3, 4, and 5. The right slot must end in an even digit, so only 2 or 4 can go there. That gives us 2 choices for the right slot. The left slot can hold any of the 5 digits freely. Multiply the choices together: \( 5 \times 2 = 10 \). So exactly 10 different even two-digit numbers are possible.
Answer: A total of \( 10 \) two-digit even numbers can be formed.
This problem uses the Fundamental Principle of Counting. If one task can be done in \( m \) ways and a second independent task in \( n \) ways, then both tasks together can be done in \( m \times n \) ways. A 2-digit number has two places: the tens place and the units (ones) place. Since we are forming even numbers, the units digit must be even. Because repetition is allowed, choosing a digit for one place does not reduce the choices available for the other place.
Total ways \( = (\text{choices for tens place}) \times (\text{choices for units place}) \)
A total of \( 10 \) two-digit even numbers can be formed.
A common mistake is fixing the even-digit condition on the tens place instead of the units place. Remember, it is the units (last) digit that decides whether a number is even, so the restriction applies there.
A total of \( 10 \) two-digit even numbers can be formed.
One common mistake: Students sometimes count only the units-place restriction and write 2 as the final answer, forgetting to multiply by the 5 available choices for the tens place.
Answer: A total of \( 10 \) two-digit even numbers can be formed.
Question: How many 2-digit odd numbers can be formed from the digits \(2, 3, 4, 6, 7, 9\) if repetition of digits is allowed?
Solution: We need to form 2-digit odd numbers using the digits \(\{2, 3, 4, 6, 7, 9\}\) with repetition allowed. A number is odd when its units (ones) digit is odd. Step 1: Identify the odd digits in the given set. The odd digits are \(3, 7, 9\), so the units digit can be chosen in \(3\) ways. Step 2: The tens digit can be any of the 6 given digits (since repetition is allowed), so it can be chosen in \(6\) ways. Step 3: By the Fundamental Principle of Counting, the total number of 2-digit odd numbers is: \[6 \times 3 = 18\]
Answer: 18
Question: How many 2-digit numbers divisible by 3 can be formed from the digits \(1, 2, 3, 4, 5, 6\) if repetition of digits is allowed? (Hint: list the valid units digits for each tens digit case, or note which pairs \((a, b)\) satisfy \(a + b \equiv 0 \pmod{3}\).)
Solution: We need to form 2-digit numbers using digits from \(\{1, 2, 3, 4, 5, 6\}\) with repetition allowed, such that the number is divisible by 3. A number is divisible by 3 when the sum of its digits is divisible by 3. Step 1: Classify the available digits by their remainder when divided by 3. Remainder 0: \(3, 6\) — 2 digits. Remainder 1: \(1, 4\) — 2 digits. Remainder 2: \(2, 5\) — 2 digits. Step 2: For the sum of the two digits \(a\) (tens) and \(b\) (units) to be divisible by 3, the remainders of \(a\) and \(b\) must add up to 0 (mod 3). The valid remainder combinations \((r_a, r_b)\) are: Case 1: \((0, 0)\) — both digits have remainder 0. Choices: \(2 \times 2 = 4\). Case 2: \((1, 2)\) — tens digit has remainder 1, units digit has remainder 2. Choices: \(2 \times 2 = 4\). Case 3: \((2, 1)\) — tens digit has remainder 2, units digit has remainder 1. Choices: \(2 \times 2 = 4\). Step 3: Total number of 2-digit numbers divisible by 3: \[4 + 4 + 4 = 12\]
Answer: 12
Question: How many 2-digit odd numbers can be formed from the digits 1, 2, 3, 4, 5, 6 if the digits can be repeated?
Answer: A total of \(18\) two-digit odd numbers can be formed.