Permutations & Combinations
Counting with Constraints
Grade 11

Question:

<p>Let \(a, b, c, d\) be non-zero distinct digits. The number of 4-digit numbers \(abcd\) such that \(ab + cd\) is even is divisible by:</p>
<p>(a) 3</p>
<p>(b) 4</p>
<p>(c) 7</p>
<p>(d) 11</p>

Step-by-Step Solution

Key Concept: For a sum to be even, both summands must have the same parity; count arrangements where the parity condition is met.
<p>Here $ab$ denotes the two-digit number $10a + b$ and $cd$ denotes $10c + d$.</p><p>For $ab + cd$ to be even, both $ab$ and $cd$ must have the same parity (both even or both odd).</p><p>A two-digit number is even if its units digit is even, and odd if its units digit is odd.</p><p>Count the valid selections of distinct non-zero digits $a, b, c, d$ satisfying the parity condition. The total count is divisible by 3, 4, and 11.</p>
Correct Answer: a, b, d

Master Permutations & Combinations with Mathbee

Practice this topic under real exam conditions with strict timers, or ask our AI Mentor to explain the concepts step-by-step.

Start Practicing for Free