Question
Question: Let $A = \{n \in N: n \text{ is 3-digit number}\}$, $B = \{9k + 2: k \in N\}$ and $C = \{9k + l: k \...
Let A={n∈N:n is 3-digit number}, B={9k+2:k∈N} and C={9k+l:k∈N} for some l(0<l<9). If the sum of all the elements of the set A∩(B∪C) is 274×400, then l is equal to

5
7
9
20
5
Solution
Let A={n∈N:n is 3-digit number}. So, A={100,101,...,999}. A is an arithmetic progression with first term a1=100, last term am=999, and common difference d=1. The number of elements in A is 999−100+1=900.
Let B={9k+2:k∈N}. Since k∈{1,2,3,...}, the elements of B are {11,20,29,...}. These are natural numbers that leave a remainder of 2 when divided by 9.
Let C={9k+l:k∈N} for some l(0<l<9). Since k∈{1,2,3,...} and l∈{1,2,...,8}, the elements of C are {9+l,18+l,27+l,...}. These are natural numbers that leave a remainder of l when divided by 9.
We are interested in the set A∩(B∪C)=(A∩B)∪(A∩C). The sum of elements in this set is given as 274×400=109600.
First, let's find the elements in A∩B. These are 3-digit numbers of the form 9k+2. The smallest 3-digit number is 100. We need 9k+2≥100⟹9k≥98⟹k≥98/9≈10.89. Since k∈N, the smallest integer k is 11. The smallest term is 9(11)+2=101. The largest 3-digit number is 999. We need 9k+2≤999⟹9k≤997⟹k≤997/9≈110.78. Since k∈N, the largest integer k is 110. The largest term is 9(110)+2=992. The set A∩B={101,110,119,...,992}. This is an arithmetic progression with first term a1=101, common difference d=9. To find the number of terms, let 992=101+(nB−1)9. 891=(nB−1)9⟹nB−1=99⟹nB=100. The sum of elements in A∩B is SA∩B=2nB(a1+anB)=2100(101+992)=50(1093)=54650.
Next, let's find the elements in A∩C. These are 3-digit numbers of the form 9k+l, where l∈{1,2,...,8}. The smallest 3-digit number is 100. We need 9k+l≥100⟹9k≥100−l⟹k≥(100−l)/9. Since l∈{1,...,8}, 100−l is between 92 and 99. (100−l)/9 is between 92/9≈10.22 and 99/9=11. For any l∈{1,...,8}, the smallest integer k≥(100−l)/9 is 11. The smallest term is 9(11)+l=99+l. The largest 3-digit number is 999. We need 9k+l≤999⟹9k≤999−l⟹k≤(999−l)/9. Since l∈{1,...,8}, 999−l is between 991 and 998. (999−l)/9 is between 991/9≈110.11 and 998/9≈110.89. For any l∈{1,...,8}, the largest integer k≤(999−l)/9 is 110. The largest term is 9(110)+l=990+l. The set A∩C={99+l,108+l,...,990+l}. This is an arithmetic progression with first term a1′=99+l, common difference d=9. The values of k range from 11 to 110. The number of terms is nC=110−11+1=100. The sum of elements in A∩C is SA∩C=2nC(a1′+anC′)=2100((99+l)+(990+l))=50(1089+2l).
Now, consider the intersection (A∩B)∩(A∩C). This set contains 3-digit numbers that are in both B and C. A number is in B if it leaves a remainder of 2 when divided by 9. A number is in C if it leaves a remainder of l when divided by 9. A number is in both sets if it leaves a remainder of 2 and l when divided by 9. This is possible only if l=2.
Case 1: l=2. If l=2, then a number cannot leave remainders 2 and l simultaneously when divided by 9. So, B∩C=∅. Thus, (A∩B)∩(A∩C)=∅. The sum of elements in A∩(B∪C)=S(A∩B)∪(A∩C)=SA∩B+SA∩C−S(A∩B)∩(A∩C)=SA∩B+SA∩C−0. The sum is 54650+50(1089+2l)=54650+54450+100l=109100+100l. We are given that the sum is 109600. 109100+100l=109600 100l=109600−109100=500 l=5. This value l=5 is in the range 0<l<9 and l=2. So, l=5 is a possible solution.
Case 2: l=2. If l=2, then C={9k+2:k∈N}=B. In this case, A∩(B∪C)=A∩(B∪B)=A∩B. The sum of elements is SA∩B=54650. The given sum is 109600. Since 54650=109600, l cannot be 2.
The only possible value for l is 5.
The final answer is 5.
Explanation of the solution:
- Identify the elements of sets A, B, and C based on their definitions.
- Determine the elements of A∩B, which are 3-digit numbers of the form 9k+2. Find the range of k for these numbers and calculate the sum of the arithmetic progression.
- Determine the elements of A∩C, which are 3-digit numbers of the form 9k+l. Find the range of k for these numbers and calculate the sum of the arithmetic progression in terms of l.
- Determine the elements of (A∩B)∩(A∩C). These are 3-digit numbers that leave a remainder of 2 and l when divided by 9. This is only possible if l=2.
- Consider two cases: l=2 and l=2.
- If l=2, the intersection (A∩B)∩(A∩C) is empty. The sum of elements in A∩(B∪C) is the sum of elements in A∩B plus the sum of elements in A∩C. Equate this sum to the given value and solve for l.
- If l=2, the set C is the same as set B. The set A∩(B∪C) is A∩B. Calculate the sum and check if it matches the given value.
- The case l=2 does not match the given sum. The case l=2 yields l=5, which is a valid value for l in the specified range.