Ask your own question, for FREE!
Mathematics 9 Online
OpenStudy (mathmath333):

Counting question

OpenStudy (mathmath333):

The number of ways in which \(3\) numbers are chosen at random from \(\{1,2,3,\cdots ,10\}\) without replacement such that minimum is \(3\) or maximum is \(7\) is ?

Parth (parthkohli):

So you have to choose 3 and 7 definitely, and so you get to choose among 4, 5, 6 in the middle. {3, 4, 7} {3, 5, 7} {3, 6, 7}

OpenStudy (mathmath333):

no,no it is 3 \(\huge or \) 7

Parth (parthkohli):

That's OK. We still had to calculate that.\[|A \cup B| = |A| + |B| - |A \cap B|\]We just calculated the third part.

OpenStudy (mathmath333):

ok i get that

Parth (parthkohli):

You can similarly calculate \(|A|\) and \(|B|\).

OpenStudy (mathmath333):

\(\large A=\left(\dbinom{8}{3}-\dbinom{7}{3}\right)\) \(\large B=\left(\dbinom{7}{3}-\dbinom{6}{3}\right)\) is this correct ?

Parth (parthkohli):

yes

OpenStudy (mathmath333):

thnks

Parth (parthkohli):

better represented as 7C2 and 6C2 but it's the same

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!