Suppose you have infinitely many cards; and on each card a number is written from 1 to 5. (there are 5 types of cards) How many ways can you choose 10 cards from that deck? (order not important)Ex: You choose three 1s, three 2s, four 5s OR You choose ten 3s O a. C(15,5) O b. 510 O . C(10,5) / P(5,5) O d. 105 O e. P(14,10) O f. C(10,5) O g. 5! x 105 O h. C(14,4)

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
Suppose you have infinitely many cards; and on each card a number is written from 1 to 5. (there are 5 types of cards) How many ways can you choose 10 cards from that deck? (order not
important)Ex: You choose three 1s, three 2s, four 5s OR You choose ten 3s
О а. С(15,5)
O b. 510
O . C(10,5) / P(5,5)
O d. 105
О е. Р(14,10)
O f. C(10,5)
O g. 5! x 105
O h. C(14,4)
Suppose you have 6 black and 9 white t-shirts and you dont want to put black ones on top of another black one. So how many ways are there for putting t-shirts on top of another (ustuste), so
that no black t-shirts is together? (First, position the white and then consider possible positions for the black)
O a. C(13,8) x P(8,5)
O b. 2! x P(9,9) x P(10,6)
O . C(16,9) x P(9,9) xP(6,6)
O d. P(9,9) x P(10,6)
O e. P(9,9) x C(10,6)
Transcribed Image Text:Suppose you have infinitely many cards; and on each card a number is written from 1 to 5. (there are 5 types of cards) How many ways can you choose 10 cards from that deck? (order not important)Ex: You choose three 1s, three 2s, four 5s OR You choose ten 3s О а. С(15,5) O b. 510 O . C(10,5) / P(5,5) O d. 105 О е. Р(14,10) O f. C(10,5) O g. 5! x 105 O h. C(14,4) Suppose you have 6 black and 9 white t-shirts and you dont want to put black ones on top of another black one. So how many ways are there for putting t-shirts on top of another (ustuste), so that no black t-shirts is together? (First, position the white and then consider possible positions for the black) O a. C(13,8) x P(8,5) O b. 2! x P(9,9) x P(10,6) O . C(16,9) x P(9,9) xP(6,6) O d. P(9,9) x P(10,6) O e. P(9,9) x C(10,6)
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY