How many 4-digit positive integers divisible by 3 can be formed using only the digits {1, 3, 5, 6, 7}, such that no digit appears more than once in a number? A. 24 B. 48 C. 72 D. 12
GATE 2024 · General Aptitude · Permutation and Combination · medium
Answer: 48 four-digit numbers
- List all 4-element subsets and compute digit sums: The five subsets are: {1,3,5,6} sum=15, {1,3,5,7} sum=16, {1,3,6,7} sum=17, {1,5,6,7} sum=19, {3,5,6,7} sum=21. Sums divisible by 3: 15 and 21. Valid subsets: {1,3,5,6} and {3,5,6,7}.
- Count arrangements for each valid subset: Each valid 4-digit subset can be arranged in 4! = 24 ways to form distinct 4-digit numbers (all orderings give positive integers since no leading-zero issue — none of the digits is 0).
- Total count: Total = 2 x 24 = 48.