SOLUTION: The top 10 names for boys in America in the 1880s were John, William, Charles, George, James, Frank, Joseph, Harry, Henry, and Edward. The top 10 names for boys in the 1980s were M

Algebra ->  Probability-and-statistics -> SOLUTION: The top 10 names for boys in America in the 1880s were John, William, Charles, George, James, Frank, Joseph, Harry, Henry, and Edward. The top 10 names for boys in the 1980s were M      Log On


   



Question 1160638: The top 10 names for boys in America in the 1880s were John, William, Charles, George, James, Frank, Joseph, Harry, Henry, and Edward. The top 10 names for boys in the 1980s were Michael, Christopher, Matthew, Joshua, David, Daniel, James, John, Robert, and Brian. In how many ways can you choose 5 names from these lists?
Found 2 solutions by ikleyn, greenestamps:
Answer by ikleyn(52770) About Me  (Show Source):
You can put this solution on YOUR website!
.

The names are all different, so there are 10 + 10 = 20 names, in total.


From 20 names, you can select 5 names by  C%5B20%5D%5E5  different ways.

Solved.

------------------

This problem is on COMBINATIONS.

On Combinations,  see introductory lessons
    - Introduction to Combinations
    - PROOF of the formula on the number of Combinations
    - Problems on Combinations
    - OVERVIEW of lessons on Permutations and Combinations
in this site.

Also,  you have this free of charge online textbook in ALGEBRA-II in this site
    - ALGEBRA-II - YOUR ONLINE TEXTBOOK.

The referred lessons are the part of this online textbook under the topic  "Combinatorics: Combinations and permutations".


Save the link to this textbook together with its description

Free of charge online textbook in ALGEBRA-II
https://www.algebra.com/algebra/homework/complex/ALGEBRA-II-YOUR-ONLINE-TEXTBOOK.lesson

into your archive and use when it is needed.



Answer by greenestamps(13198) About Me  (Show Source):
You can put this solution on YOUR website!


The names are NOT all different....

On the other hand, the statement of the problem is unclear as to whether we can choose, among our 5 names, James and/or John twice -- once from each list.

So perhaps 20C5 is the right answer....

If we can't pick a name twice that is in both lists, then there are 18 different names to choose from, so the number of ways to make the choices would be 18C5.

The problem is a very simple straightforward application of the basic concept of "n choose r".

It's unfortunate that the problem wasn't stated as simply (clearly)....