The number of ways in which three distinct integers can be chosen from the set \(\{1, 2, \ldots, 9\}\) such that their product is divisible by 4, is __________
Question and options
The number of ways in which three distinct integers can be chosen from the set such that their product is divisible by 4, is __________
- 56
- 54
- 49
- 74
Answer and explanation
Correct answer: B - 54
There are qualifying triples. Of these, contain or . A triple containing neither nor must contain both and and one of the five odd integers, which adds to the total. The count omits those five triples.
Practice for these exams
-
IPMAT Indore
Related question papers
Related exam syllabi
More solved explanations in Arithmetic
- If n is the number of different five-digit numbers divisible by 4 that can be formed with the digits 1, 2, 3, 4, 5 and 6, no digit being repeated, what is n?
- What percentage is equal to three quarters?
- In a class, 60% and 68% of students passed their Physics and Mathematics examinations respectively. What is the minimum percentage of students who passed both…
- If x : y = 2 : 3, the value of (3x + 2y) : (2x + 5y) is:
- Ram and Shyam can plough a field in 12 days. Shyam alone can plough the field in 18 days. In how many days will Ram alone plough the field?