Question 1049081
<font face="Times New Roman" size="+2">


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
*[tex \LARGE e^{i\pi}\ +\ 1\ =\ 0]
My calculator said it, I believe it, that settles it
<img src="http://c0rk.blogs.com/gr0undzer0/darwin-fish.jpg">
*[tex \Large \ \
*[tex \LARGE \ \ \ \ \ \ \ \ \ \  

</font>