The number of ways in which three distinct integers can be chosen from the set such that their product is divisible by 4, is ___
The number of ways in which three distinct integers can be chosen from the set such that their product is divisible by 4, is ___
Entered answer:
Solution
✅ Correct Answer: 54
Total ways to choose distinct integers from :
It is easier to use the complement: count triples whose product is NOT divisible by , then subtract from .
Classify by power of :
Odd (no factor of ): , count .
Exactly one factor of : , count .
At least two factors of : , count .
The product is not divisible by when the total power of in the triple is or :
All three odd: .
One number from and two odd: .
Total not divisible by .
Number of triples with product divisible by .
Related questions:
IPMAT Indore 2024
IPMAT Indore 2022
IPMAT Indore 2020