Advertisement

Can you solve this selection problem?

Can you solve this selection problem? Sometimes direct counting of the given property is cumbersome! It is better to count the negation of the given property. Here is this problem we first count the ways of selecting three numbers whose product is not divisible by 4 and then from the total selections we subtract this to get the final answer. If you proceed here directly there will be 8 cases to consider!!

Permutation,combination,selection,divisibility,product,numbers,IIT,ISI,IITJEE,maths,counting,

Post a Comment

0 Comments