MHB How Do You Solve Complex Venn Diagram Problems Involving Sets?

dizzieko03
Messages
1
Reaction score
0
Can someone please break down how to do this one? I'm absolutely stumped on this one. Thank you very much. :)Use the following sets to complete the operations.
Universal set = {lower case English letters; a,b,c,d…x,y,z}
V = {a,e,i,o,u}
S = {letters in the word “spring”}
G = {letters in the word “garden”}

Find the following sets:

a. G’ ∩ V
b. (G ∩ V) ∩ { }
c. (G ∪ V ∪ S)
 
Physics news on Phys.org
dizzieko03 said:
Can someone please break down how to do this one? I'm absolutely stumped on this one. Thank you very much. :)Use the following sets to complete the operations.
Universal set = {lower case English letters; a,b,c,d…x,y,z}
V = {a,e,i,o,u}
S = {letters in the word “spring”}
G = {letters in the word “garden”}

Find the following sets:

a. G’ ∩ V
b. (G ∩ V) ∩ { }
c. (G ∪ V ∪ S)
Hello dizzieko03,
Welcome to MHB!
Is that a meant to be G ∩ V? Can you also explain to me what ∩ means, so I know where you are stuck.

Regards,
 
Petrus said:
Hello dizzieko03,
Welcome to MHB!
Is that a meant to be G ∩ V? Can you also explain to me what ∩ means, so I know where you are stuck.

Regards,

It must mean intersection .
 
dizzieko03 said:
Can someone please break down how to do this one? I'm absolutely stumped on this one. Thank you very much. :)Use the following sets to complete the operations.
Universal set = {lower case English letters; a,b,c,d…x,y,z}
V = {a,e,i,o,u}
S = {letters in the word “spring”}
G = {letters in the word “garden”}

Find the following sets:

a. G’ ∩ V
b. (G ∩ V) ∩ { }
c. (G ∪ V ∪ S)

Hello and welcome to MHB, dizzieko03! :D

a. $G'$ means those elements of $U$ which are not in $G$. $\cap$ means the intersection, so you want the elements that are in both sets only. So we have the letters of the alphabet not in the word "garden" which are also vowels. Can you give this set?

b. Here we want the letters in the word "garden" which are also vowels, and then find the intersection with the null set. What is the intersection of any set with the null set?

c. Here we want the letters in the word "garden" and all the vowels and all the letters in the word "spring". Can you list this set?

Post your work and we will be glad to look it over.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top