Loading [MathJax]/jax/output/HTML-CSS/fonts/TeX/fontdata.js

Saturday, May 30, 2015

Indian Statistical Institute B.Math & B.Stat : Combinatorics

Indian Statistical Institute : Combinatorics In how many ways one can choose three distinct numbers from the set {1,2,3,,19,20} such that their product is divisible by 4? We partition the set {1,2,3,,19,20} into three disjoint sets S1={4,8,12,16,20},S2={2,6,10,14,18},S3={1,3,5,7,9,11,13,15,17,19} Three selected (distinct) numbers will not be divisible by 4 iff all the three numbers are selected form S3 or two of them are selected from S3 and one of them from S1. Numbers of such numbers are (103)+(52)×(51)=345 So numbers of selection such that their product is divisible by 4 is (203)345=795

No comments:

Post a Comment