MHB Find 3-Set Venn Diagram: A,B,C w/ Empty Intersection

  • Thread starter Thread starter paulmdrdo1
  • Start date Start date
  • Tags Tags
    Diagram Venn
paulmdrdo1
Messages
382
Reaction score
0
Find a Venn diagram containing three sets A, B, C such that $A\cap B\,\neq\,\emptyset$, $B\cap C\,\neq\,\emptyset$,and $C\cap A\,\neq\,\emptyset$, but $A\cap B\cap C\,=\,\emptyset$.

here's my answer please check if it is right.
View attachment 1127
 

Attachments

  • Venn1.3.jpg
    Venn1.3.jpg
    5.5 KB · Views: 110
Physics news on Phys.org
paulmdrdo said:
Find a Venn diagram containing three sets A, B, C such that $A\cap B\,\neq\,\emptyset$, $B\cap C\,\neq\,\emptyset$,and $C\cap A\,\neq\,\emptyset$, but $A\cap B\cap C\,=\,\emptyset$.

here's my answer please check if it is right.
View attachment 1127

What you have is not $A\cap C\ne \emptyset$

View attachment 1128
 

Attachments

  • Untitled.gif
    Untitled.gif
    941 bytes · Views: 117
You don't have to use perfect circles in Venn diagrams. Try more complex figures!
Also you don't have to show the intersections with shadows only! You can try figures containing objects.
 
Hello, paulmdrdo!

Find a Venn diagram containing three sets A, B, C such that:
A\cap B\,\neq\,\emptyset,\;B\cap C\,\neq\, \emptyset,\,\text{and }C\cap A\,\neq\,\emptyset
but A\cap B\cap C\,=\,\emptyset

Here's my answer; please check if it is right.
View attachment 1127
No.
You have: C \cap A \,=\,\emptysetThe diagram might look like this:

Code:
              *               *
            *   *           *   *
          *       *       *       *
        *           *   *           *
      *       A       *       B       *
    *               *:::*               *
  *               *:::::::*               *
    *               *:::*               *
      *               *               *
        *     *-----*---*-----*     *
          *   |:::*       *:::|   *
            * |:*           *:| *
              *               *
              |       C       |
              |               |
              |               |
              |               |
              *---------------*
 
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