MHB Union & Intersection questions

AI Thread Summary
In the MISS CAT 2013 contest, 66 cats began, with 21 eliminated in the first round, leaving 45 for the second round. Among these, 27 cats had stripes and 32 had one black ear, leading to the need to determine how many had both features. By applying set theory, the intersection of the two sets (striped cats and cats with a black ear) was calculated, revealing that at least 14 cats must have had both characteristics. This conclusion was reached by analyzing the total number of cats and their respective attributes, confirming that the minimum number of finalists is 14.
bala2014
Messages
4
Reaction score
0
Sixty six cats signed up for the contest MISS CAT 2013. After the first round 21 cats were eliminated
because they failed to catch a mouse. Of the remaining cats, 27 had stripes and 32 had one black
ear. All striped cats with one black ear got to the final. What is the minimum number of finalists?
(A) 5 (B) 7 (C) 13 (D) 14 (E) 27
 
Mathematics news on Phys.org
66 cats started out, 21 were eliminated, so 45 made it to round two.

In round two, all those that had both a black ear and stripes continued.

Since there were 27 with stripes and 32 with a black ear, but only 45 cats, some had to have both. How many must have had both?
 
Prove It said:
Since there were 27 with stripes and 32 with a black ear, but only 45 cats, some had to have both. How many must have had both?
Out of 45 that passed the first round, let $B$ be the set of cats with a black ear and $S$ be the set of cats with stripes. It's easier to figure out $|B\cap S|$ (the number of elemenst in the intersection) under the assumption that all 45 cats had stripes or a black ear or both. Then the answer is unique. I'll wait for the OP to show some effort on this, and then we can figure out how an upper bound on $|B\cup S|$ turns into a lower bound on $|B\cap S|$.
 
Evgeny.Makarov said:
Out of 45 that passed the first round, let $B$ be the set of cats with a black ear and $S$ be the set of cats with stripes. It's easier to figure out $|B\cap S|$ (the number of elemenst in the intersection) under the assumption that all 45 cats had stripes or a black ear or both. Then the answer is unique. I'll wait for the OP to show some effort on this, and then we can figure out how an upper bound on $|B\cup S|$ turns into a lower bound on $|B\cap S|$.

By keeping $|B\cap S|$ = x , B = 27-x, S = 32-x, we know $|B\cup S|$ s 45. So we can form a equation 27-x+x+32-x = 45 where x= 59-45 = 14.
 
bala2014 said:
By keeping $|B\cap S|$ = x , B = 27-x, S = 32-x
Something is not right here. First, $B$ is a set (at least as I defined it) and $27-x$ is a number, so $B$ and $27-x$ are objects of different types and cannot be equal. Second, if you mean $|B|=27-x$, this is also not right. "$B$ [is] the set of cats with a black ear", and the problem statement says that $|B|=32$. What you probably mean is that $|B\setminus (B\cap S)|=|B\setminus S|=32-x$ if $|B\cap S|=x$. Similarly, $|S\setminus (B\cap S)|=|S\setminus B|=27-x$. Now, the sets $B\setminus S$, $B\cap S$ and $S\setminus B$ ar disjoint and their union has 45 element (under the additional assumption that all 45 cats had stripes or a black ear or both). From here we get your equation
\[
(27-x)+x+(32-x) = 45.
\]

I would write a solution as follows.
\[
|B|+|S|-|B\cap S|=|B\cup S|\qquad(*)
\]
from where
\[
|B\cap S|=|B|+|S|-|B\cup S|=32+27-45=14
\]
If we don't make the assumption that $|B\cup S|=45$, then we only know that $|B\cup S|\le 45$, so (*) gives
\[
|B\cap S|\ge |B|+|S|-45=32+27-45=14.
\]
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
Thread 'Imaginary Pythagorus'
I posted this in the Lame Math thread, but it's got me thinking. Is there any validity to this? Or is it really just a mathematical trick? Naively, I see that i2 + plus 12 does equal zero2. But does this have a meaning? I know one can treat the imaginary number line as just another axis like the reals, but does that mean this does represent a triangle in the complex plane with a hypotenuse of length zero? Ibix offered a rendering of the diagram using what I assume is matrix* notation...

Similar threads

Replies
10
Views
4K
Replies
4
Views
2K
2
Replies
67
Views
14K
Replies
3
Views
3K
Replies
1
Views
3K
Replies
1
Views
4K
Replies
65
Views
10K
Replies
2
Views
9K
Replies
20
Views
5K
Back
Top