SOLUTION: I have never done a problem such as the following, and my book isn't helping. My answer must be a whole number.
Let
U = {x | x is the name of one of the months in a year}
J =
Algebra ->
Permutations
-> SOLUTION: I have never done a problem such as the following, and my book isn't helping. My answer must be a whole number.
Let
U = {x | x is the name of one of the months in a year}
J =
Log On
Question 1049081: I have never done a problem such as the following, and my book isn't helping. My answer must be a whole number.
Let
U = {x | x is the name of one of the months in a year}
J = {x | x is in U and x begins with the letter J}
Y = {x | x is in U and x ends with the letter Y}.
Find n(J ∪ Y). Answer by solver91311(24713) (Show Source):
Make a list of all of the months of the year that have a letter "J" as the first letter of the month name. This is a listing of set J.
Make a list of all of the months of the year that have a letter "Y" as the last letter. This is a listing of set Y.
Combine the two lists so that if a month name occurs in both lists, that month name only occurs once in the combined list. This is the union of set J and Y.
Count the number of elements in the union set. That's your answer.
John
My calculator said it, I believe it, that settles it
