A community for students.
Here's the question you clicked on:
 0 viewing
anonymous
 one year ago
Need help (fixed)
anonymous
 one year ago
Need help (fixed)

This Question is Closed

KyanTheDoodle
 one year ago
Best ResponseYou've already chosen the best response.0I'd love to help but I have no idea how this stuff works, but I must make my exit noteworthy. Amaaaaaaaaazzziiiiiing graaaaaaaaaccceeeee. Algebraaaaaaaaaaaa isn't coooooooooooool. And neither are fractioooooooooooooooooooooooooooooonnnnnnnnssssss.

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0does anyone know how to do it :,(

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0Can you paste the words into the chat

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0Here's a useful tip for Venndiagramcounting problems like this one: Start with the most inclusive sets. What I mean by that is that you can tackle this question by first considering the set that contains elements that belong to all (or most) of the three given sets, which in this case would be \(A\cap B\cap C\). You know it contains \(5\) elements. Another set that's very inclusive is \(A'\cap B'\cap C'\), which has elements that don't belong to any of \(A,B,C\). You're told it has \(22\) elements. So from this info, you can gather the following: dw:1440549175807:dw Does that make sense?

anonymous
 one year ago
Best ResponseYou've already chosen the best response.0Now consider the next most inclusive set  there are a few of these, so let's just pick \(A\cap C\) as an example. We're told that that it contains \(14\) elements. But notice that some of the elements of \(A\cap C\) were already counted in \(A\cap B\cap C\), since \(A\cap C\subseteq A\cap B\cap C\) (subset, if you're not familiar with the symbol). So to avoid double counting, we'll need to subtract. \[A\cap C=n(A\cap C)n(A\cap B\cap C)=145=11\] where \(S\) is used to denote the size of the set \(S\) and \(S\) only. Not to be confused with \(n(S)\), which means the number of elements that belong to \(S\), but might also belong to other sets containing \(S\). (If that's confusing, I'll try to elaborate.) dw:1440549783570:dw
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.