Find the union
A
1
∪
A
2
{\displaystyle A_{1}\cup A_{2}}
and the intersection
A
1
∩
A
2
{\displaystyle A_{1}\cap A_{2}}
of the two sets
A
1
{\displaystyle A_{1}}
and
A
2
{\displaystyle A_{2}}
where
(a)
A
1
=
{
0
,
1
,
2
}
,
A
2
=
{
2
,
3
,
4
}
{\displaystyle A_{1}=\{0,1,2\},A_{2}=\{2,3,4\}\,}
(b)
A
1
=
{
x
:
0
<
x
<
2
}
,
A
2
=
{
x
:
1
≤
x
<
3
}
{\displaystyle A_{1}=\{x:0<x<2\},A_{2}=\{x:1\leq x<3\}}
(c)
A
1
=
{
(
x
,
y
)
:
0
<
x
<
2
,
0
<
y
<
2
}
,
A
2
=
{
(
x
,
y
)
:
1
<
x
<
3
,
1
<
y
<
3
}
{\displaystyle A_{1}=\{(x,y):0<x<2,0<y<2\},A_{2}=\{(x,y):1<x<3,1<y<3\}\,}
Solution (c):
A
1
∪
A
2
=
{
(
x
,
y
)
:
0
<
x
<
3
,
0
<
y
<
2
∨
1
<
x
<
3
,
2
<
y
<
3
}
{\displaystyle A_{1}\cup A_{2}=\{(x,y):0<x<3,0<y<2\lor 1<x<3,2<y<3\}}
A
1
∩
A
2
=
{
(
x
,
y
)
:
1
<
x
<
2
,
0
<
y
<
2
}
{\displaystyle A_{1}\cap A_{2}=\{(x,y):1<x<2,0<y<2\}}
Rest are similar.
List all the possible arrangements of the four letters m,a,r and y. Let
A
1
{\displaystyle A_{1}}
be the collection of the arrangements in which y is in the last position. Let
A
2
{\displaystyle A_{2}}
be the collection of the arrangements in which m is in the first position. Find the union and intersection of
A
1
{\displaystyle A_{1}}
and
A
2
{\displaystyle A_{2}}
.
Solution: The arrangements are: mary, mayr, mray, mrya, myra, myar, amry, amyr, aymr, ayrm, arym, army, ryma, ryam, ramy, raym, rmya, rmay, yrma, yram, yamr, yarm, ymra, ymar.
A
1
=
{
m
a
r
y
,
m
r
a
y
,
a
m
r
y
,
a
r
m
y
,
r
a
m
y
,
r
m
a
y
}
{\displaystyle A_{1}=\{mary,mray,amry,army,ramy,rmay\}}
A
2
=
{
m
a
r
y
,
m
a
y
r
,
m
r
a
y
,
m
r
y
a
,
m
y
r
a
,
m
y
a
r
}
{\displaystyle A_{2}=\{mary,mayr,mray,mrya,myra,myar\}}
. The rest is obvious.
If a sequence of sets
A
1
,
A
2
,
A
3
⋯
{\displaystyle A_{1},A_{2},A_{3}\cdots }
is such that
A
k
⊂
A
k
+
1
,
k
=
1
,
2
,
3
,
⋯
{\displaystyle A_{k}\subset A_{k+1},k=1,2,3,\cdots }
the sequence is said to be a nondecreasing sequence. Give an example of this kind of sequence of sets.
Solution: Let
A
n
=
(
0
,
n
)
{\displaystyle A_{n}=(0,n)}
where n = 1, 2, 3...
If a sequence of sets
A
1
,
A
2
,
A
3
⋯
{\displaystyle A_{1},A_{2},A_{3}\cdots }
is such that
A
k
⊃
A
k
+
1
,
k
=
1
,
2
,
3
,
⋯
{\displaystyle A_{k}\supset A_{k+1},k=1,2,3,\cdots }
the sequence is said to be a nonincreasing sequence. Give an example of this kind of sequence of sets.
Solution: Let
A
n
=
(
0
,
1
n
)
{\displaystyle A_{n}=(0,{\frac {1}{n}})}
where n=1,2,3...
If
A
1
,
A
2
,
A
3
⋯
{\displaystyle A_{1},A_{2},A_{3}\cdots }
are sets such that
A
k
⊂
A
k
+
1
k
=
1
,
2
,
3
,
⋯
,
lim
k
→
∞
A
k
{\displaystyle A_{k}\subset A_{k+1}k=1,2,3,\cdots ,\lim _{k\to \infty }A_{k}}
is defined as the union
A
1
∪
A
2
∪
A
3
∪
⋯
{\displaystyle A_{1}\cup A_{2}\cup A_{3}\cup \cdots }
. Find
lim
k
→
∞
A
k
{\displaystyle \lim _{k\to \infty }A_{k}}
if
(a)
A
k
=
{
x
:
1
/
k
≤
x
≤
3
−
1
/
k
}
,
k
=
1
,
2
,
3
⋯
{\displaystyle A_{k}=\{x:1/k\leq x\leq 3-1/k\},k=1,2,3\cdots }
(b)
A
k
=
{
(
x
,
y
)
:
1
/
k
≤
x
2
+
y
2
≤
4
−
1
/
k
}
,
k
=
1
,
2
,
3
⋯
{\displaystyle A_{k}=\{(x,y):1/k\leq x^{2}+y^{2}\leq 4-1/k\},k=1,2,3\cdots }
Solution: (b)
lim
k
→
∞
A
k
=
{
(
x
,
y
)
:
1
<
x
2
+
y
2
<
4
}
{\displaystyle \lim _{k\to \infty }A_{k}=\{(x,y):1<x^{2}+y^{2}<4\}}
If
A
1
,
A
2
,
A
3
⋯
{\displaystyle A_{1},A_{2},A_{3}\cdots }
are sets such that
A
k
⊃
A
k
+
1
k
=
1
,
2
,
3
,
⋯
,
lim
k
→
∞
A
k
{\displaystyle A_{k}\supset A_{k+1}k=1,2,3,\cdots ,\lim _{k\to \infty }A_{k}}
is defined as the intersection
A
1
∩
A
2
∩
A
3
∪
⋯
{\displaystyle A_{1}\cap A_{2}\cap A_{3}\cup \cdots }
. Find
lim
k
→
∞
A
k
{\displaystyle \lim _{k\to \infty }A_{k}}
if
(a)
A
k
=
{
x
:
2
−
1
/
k
<
x
≤
2
}
,
k
=
1
,
2
,
3
⋯
{\displaystyle A_{k}=\{x:2-1/k<x\leq 2\},k=1,2,3\cdots }
(b)
A
k
=
{
x
:
2
<
x
≤
2
+
1
/
k
}
,
k
=
1
,
2
,
3
⋯
{\displaystyle A_{k}=\{x:2<x\leq 2+1/k\},k=1,2,3\cdots }
(c)
A
k
=
{
(
x
,
y
)
:
0
≤
x
2
+
y
2
≤
1
/
k
}
,
k
=
1
,
2
,
3
⋯
{\displaystyle A_{k}=\{(x,y):0\leq x^{2}+y^{2}\leq 1/k\},k=1,2,3\cdots }
Solution: (c)
lim
k
→
∞
A
k
=
{
(
0
,
0
)
}
{\displaystyle \lim _{k\to \infty }A_{k}=\{(0,0)\}}
For every one dimensional set A let
Q
(
A
)
=
∑
A
f
(
x
)
{\displaystyle Q(A)=\sum _{A}f(x)}
where
f
(
x
)
=
{
2
3
(
1
3
)
x
,
x
=
0
,
1
,
2
,
⋯
0
,
o
t
h
e
r
w
i
s
e
{\displaystyle f(x)={\begin{cases}{\frac {2}{3}}({\frac {1}{3}})^{x},&x=0,1,2,\cdots \\0,&otherwise\end{cases}}}
. If
A
1
=
{
x
:
x
=
0
,
1
,
2
,
3
}
{\displaystyle A_{1}=\{x:x=0,1,2,3\}\,}
and
A
2
=
{
x
:
x
=
0
,
1
,
2
,
⋯
}
{\displaystyle A_{2}=\{x:x=0,1,2,\cdots \}}
, find
Q
(
A
1
)
{\displaystyle Q(A_{1})}
and
Q
(
A
2
)
{\displaystyle Q(A_{2})}
.
Solution:
Q
(
A
1
)
=
80
81
{\displaystyle Q(A_{1})={\frac {80}{81}}}
and
Q
(
A
2
)
=
1
{\displaystyle Q(A_{2})=1}
using the formulae of sum of a geometric series .
For every one dimensional set A for which the integral exists, let
Q
(
A
)
=
∫
A
f
(
x
)
{\displaystyle Q(A)=\int _{A}f(x)}
where
f
(
x
)
=
{
6
x
(
1
−
x
)
,
0
<
x
<
1
0
,
e
l
s
e
w
h
e
r
e
{\displaystyle f(x)={\begin{cases}6x(1-x),&0<x<1\\0,&elsewhere\end{cases}}}
, otherwise let
Q
(
A
)
{\displaystyle Q(A)}
be undefined. If
A
1
=
{
x
:
1
4
<
x
<
3
4
}
,
A
2
=
{
1
2
}
{\displaystyle A_{1}=\{x:{\frac {1}{4}}<x<{\frac {3}{4}}\},A_{2}=\{{\frac {1}{2}}\}}
and
A
3
=
{
x
:
0
<
x
<
10
}
{\displaystyle A_{3}=\{x:0<x<10\}}
, find
Q
(
A
1
)
,
Q
(
A
2
)
{\displaystyle Q(A_{1}),Q(A_{2})}
and
Q
(
A
3
)
{\displaystyle Q(A_{3})}
.
Solution:
Q
(
A
1
)
{\displaystyle Q(A_{1})}
can be found by integrating f(x) from
1
4
{\displaystyle {\frac {1}{4}}}
to
3
4
{\displaystyle {\frac {3}{4}}}
,
Q
(
A
2
)
=
0
{\displaystyle Q(A_{2})=0}
as integral over a set of measure zero is 0 and
Q
(
A
3
)
{\displaystyle Q(A_{3})}
can be found by integrating f(x) from 0 to 1.
Let
Q
(
A
)
=
∫
A
∫
(
x
2
+
y
2
)
d
x
d
y
{\displaystyle Q(A)=\int _{A}\int (x^{2}+y^{2})dxdy}
for every two dimensional set A for which the integral exists; otherwise let
Q
(
A
)
{\displaystyle Q(A)}
be undefined. If
A
1
=
{
(
x
,
y
)
:
−
1
≤
x
≤
1
,
−
1
≤
y
≤
1
}
,
A
2
=
{
(
x
,
y
)
:
−
1
≤
x
=
y
≤
1
}
,
{\displaystyle A_{1}=\{(x,y):-1\leq x\leq 1,-1\leq y\leq 1\},A_{2}=\{(x,y):-1\leq x=y\leq 1\},}
and
A
3
=
{
(
x
,
y
)
:
x
2
+
y
2
≤
1
}
{\displaystyle A_{3}=\{(x,y):x^{2}+y^{2}\leq 1\}}
, find
Q
(
A
1
)
,
Q
(
A
2
)
{\displaystyle Q(A_{1}),Q(A_{2})}
and
Q
(
A
3
)
{\displaystyle Q(A_{3})}
.
Solution:
Q
(
A
1
)
=
∫
−
1
1
∫
−
1
1
(
x
2
+
y
2
)
d
x
d
y
=
8
3
{\displaystyle Q(A_{1})=\int _{-1}^{1}\int _{-1}^{1}(x^{2}+y^{2})dxdy={\frac {8}{3}}}
,
Q
(
A
2
)
{\displaystyle Q(A_{2})}
is zero since it represents volume of a sheet and
Q
(
A
3
)
=
∫
0
2
π
∫
0
1
(
r
2
)
r
d
r
d
θ
{\displaystyle Q(A_{3})=\int _{0}^{2\pi }\int _{0}^{1}(r^{2})rdrd\theta }
if we introduce polar coordinates . This evaluates to
π
2
{\displaystyle {\frac {\pi }{2}}}
.
To join a certain club, a person must be either a statistician or a mathematician or both. Of the 25 members in this club, 19 are statisticians and 16 are mathematicians. How many persons in the club are both a statistician and a mathematician?
Soluion: The number of persons which are statisticians or mathematicians = number of statisticians + number of mathematicians - number of persons which are both statisticians and mathematicians. This can be proved directly using properties of the counting measure . The general proof is as follows: Let A and B be two finite sets. Endow the natural numbers with the counting measure which we shall denote by n. We shall denote union by + and intersection by . and the context will make it clear whether we mean actual addition, multiplication or union, intersection. Now A-B (Here - represents the relative complement , AB and B-A are disjoint and as n is sigma additive so
n(A+B)=n(A-B)+n(B-A)+n(AB)
n(A)=n(A-B)+n(AB) which implies n(A-B)=n(A)-n(AB)
n(B)=n(B-A)+n(AB) which implies n(B-A)=n(B)-n(AB)
Substituting n(A-B) and n(B-A) from (2) and (3) into (1) gives us n(A+B)=n(A)+n(B)-n(AB).
So the answer is 10.
After a hard fought football game, it was reported that of the 11 starting players, 8 hurt a hip, 6 hurt an arm, 5 hurt a knee, 3 hurt both a hip and an arm, 2 hurt both a hip and a knee, 1 hurt both an arm and a knee, and no one hurt all three. Comment on the accuracy of the report.
Solution: We shall first establish that in the language of the previous problem:
n
(
A
+
B
+
C
)
=
n
(
A
)
+
n
(
B
)
+
n
(
C
)
−
n
(
A
B
)
−
n
(
B
C
)
−
n
(
C
A
)
+
n
(
A
B
C
)
{\displaystyle n(A+B+C)=n(A)+n(B)+n(C)-n(AB)-n(BC)-n(CA)+n(ABC)\,}
.
Now,
n
(
A
+
B
+
C
)
=
n
(
A
+
B
)
+
n
(
C
)
−
n
(
(
A
+
B
)
C
)
{\displaystyle n(A+B+C)=n(A+B)+n(C)-n((A+B)C)\,}
=
n
(
A
)
+
n
(
B
)
+
n
(
C
)
−
n
(
A
B
)
−
n
(
A
C
+
B
C
)
{\displaystyle =n(A)+n(B)+n(C)-n(AB)-n(AC+BC)\,}
=
n
(
A
)
+
n
(
B
)
+
n
(
C
)
−
n
(
A
B
)
−
n
(
A
C
)
+
n
(
B
C
)
−
n
(
A
C
B
C
)
{\displaystyle =n(A)+n(B)+n(C)-n(AB)-{n(AC)+n(BC)-n(ACBC)}\,}
=
n
(
A
)
+
n
(
B
)
+
n
(
C
)
−
n
(
A
B
)
−
n
(
B
C
)
−
n
(
C
A
)
+
n
(
A
B
C
)
{\displaystyle =n(A)+n(B)+n(C)-n(AB)-n(BC)-n(CA)+n(ABC)\,}
Now if we let A, B and C to be the set of players with injured hips, knees and arms respectively, we would find the contradiction on substituting the appropriate terms in the above formula. Hence the report is not accurate.