① when n =

1 , (H) =
1x2x3 =
6 =
RHS :

1xxx 6
the statement holds for n =
n(n+1) (n +2) (n+3)
② assume the statement is true
for MEN , KK+ 1+2) =

KKDK =
+)
+ 2) K+ ((k+2) + (n+1)(n+2)(n+3) =
hmm + (n+1(n+ 2(n+3)

(n+1) (n+2) (n+3) (n+4)

=
(H+ 1)(n+2)(n+3)(+ 1) =
4
=
(n +1) (n+H) (n+1 +2)(n++3)

n4
3)
Un
+ 2)(n+
·
"UnEN , Ek(k +(k+2)
=

913 I element, which is also the largest element

111 When n :
1 , set has only
12 Suppose when n =
K KEZ+,
,
every nonempty
see
of 91 , 2, ..., /3 has a
largest element

when L= K+ 1 ,
suppose S is a nonempty subset of 31 , 2
, ....
k+ ]
& when +
k] therefore element
K 1S .
S is a subset of 91 ,
2....
,
S has a
largest
② When K+ ES , supposes is a subset of(SICKH3) ,
i. e . S' is a subset of 91 ,2, ...,
k)
element
therefore S has a
largest in

largest element in
if m = Ki1 , then m is the

largest element in
if m <k+t 1 then kit is the

RED
 if x is not an
orange X0 , I Vacuous eith,

if xE0 ,
then x is an
orange

24 16=

2 [0 =
,
1903 [12] 31133 91,9033 9432 32.2033 , 93 1033 Sims)
, 2, 3,
, ,
. , ,
, ,
,

[12 3833 913 3833 52 3 9833 942 3 98333

, , , , , , ,
, ,

↑
IIIII
III/ M
* ,

/IIII a

(a) Suppose xEAOBX)(ALB)VIBLA))

AlB EX = :
xA&XEB) , BLA EX = :
XEBOXEAS . XCA or xeB , XAB or XA
X EAUB , XEBrA"" XellArBI
(BUAYlie AOB CAUBINLBLAY
· :

(b)LAOBE ((AIB) UCBLAS)" =

CALBSIBBLAS
(AIB)" AB =
(BLAS : BrA
: (AGB) =AUB) 1/BUA)
(c) XCAOLBoC)> IXEA1Xq(BOC)) v(X #A1X = (BOC)
# [xeA
121(xeB1x#C)V(XEBxEC1] U
#A1 (xEB1xec)V(x # BaxEC1))
E [xtA1) ! + x Bux *
CIVIXEB1xEC) U
[x &A 1((xEB1 x(c) V(x +B1x( c)]
=>
(xAnxeB1x(c)U(XA1XEBAxECIVIX*AXEB1x()U
(x &A1 x &BMxEC)
Similarly ,XE(AOBIOCE) (XCAOBM * CIV (XKAOBNxEC)
=> (xtA1X(B1x(()V(X #A1xzB1x & C)U(XEA1XtB1xC)(
(x(A1XB1XC)
(AOBIOC AOBOC) :
11) VaeZ , aza

: R is reflexive
Va , bez ,
asb ba = b ,
= a

R is antisymmetric
#a b cEZ , azb beC ,
,
= a= L

R is transitive
order
R is a
partial
(2) VatR , an an=

R reflexive is

F a bER ifaEb
, ,
then bE ah
R is
symmetric
ab" bEC" then ach
warb CER , ,
if ,

R is transitive

R is an
equivalence relation

each equivalence class

DF (x y)ER2 y -x y x is
= - a
, ,

:
VcxyER (x y) Rix y) , i
see
of points that lie on a

: R is reflexive
parabola of the
form y = x=
where a is constant
yo-xo y1 yo-Xo
a
(Xo xi = Y 1 -X
&
yoRIxisyi) => = - =
,

. R is
symmetric
⑨
(xoyoR(x yi) , (X YpRiX2 Yrl
11 . ,

y XY YiXY ya X2
=> Xo
yo
- = - =
1 ,
-

=>
yo-xo Yz-XI =

(XoiyosRIXaiya)
iR is transitive

1: R is relation
an
equivalence
 O
Suppose xRy , " Ris
reflexive :,
yRy ②
Suppose xRy yRz ,

Ris circular ,
XRy yRy ,
i
yRX : R is transitive .. xRy yRz
, = XRz
iR is
symmetric R is xRz zRX
symmetrici , =

Suppose xRy yRz" , R is circular

iR is circular
in
ZRX". R is symmetrici xRE ,

R is transitive

equivalence relation
In conclusion , R is reflexive and circular
iff R is an

X Sa c) define R as aRb bRc , cRa

example : =
, b, , ,

R because aRb#bRa , bRc#cRb cRaBaR

is not
symmetric or transitive ,

aRb & bRc # aRa

11) To prove fix = is continuous on 10, s , we need to show that FEO ISO St.

if IX-XokS then Ifix- fixosk 3 ,

Vxo Eco , 2)

m
if(x-volc then
fix=* is continuous on 10
To fix=* is not need show that 80 780.
prove uniformly continuous on 10 ,s ,
we to .

= (0 , b) (x ykf
y (f(x) fiyl = 2
x , = -

Choose
suppose fex=*
S= 1 . is
uniformly continuous on 10 . ) ,
then for c = 17630s t .
.

Exyeled
if (x yk 8 Ifix fiy1k
-

,
-

Let x= n ·

Yeah , neN , (x-y) In-i

tims when netr k-yl
= =
,
,
+o
, for sufficiently large n, int S
Ifix-tyl =
1- E i. this contradicts the assumption of uniform continuity
fox) *
= is not
uniformly continuous on 10 , 2)
12 fandy are
uniformly continuous #20 = Jgso
. .
Eggo Sit .

EXYER
(x-yk f = (fex-try) (x-y Sg = (g) -gyik
<

where Mf and
Mg the bounds of f and g HixikMf lgysl Mg
are
, ,

Hixgex - frygigs1 / fixgix) fixgys fixgiys frysgigs1 (fix/(gex-giyl

= -

+ - = +
gig /1 frx-fiy
1 :

Mf 1g) giys1+ Mg(fix-fiys

= -

choose f
minifigg) S t KyK8 => Hex-fiyskng
=
.
.

Igx-giylit
Ifgos-fiysgys) My c +Mg zg = + = >
-
·
-

fig is uniformly continuous on R

fix
*
= x -X
fiss =
35+
↓
f(x) =
0 => X =
=
3

For 5 fixe foxs is increasing

X> -

,
53),
on 1-0, -

X) 5) fixo fo is-

decreasing 1-3)
, ,
on

x fixso foxs is increasing ( +ro)

, ,
on
,

f(5) 5 5 55= - =

Let
g [Fitz) eE ) be the restriction of fil now
g
is
bijective function
: a
+ ,

-* for xeird
gixs =

,
 +
(a)
hisupan-himpa Limsupbuhmsub an but"
e
g.
.

himsupan himsupbr
=
=
/
himSuplautbu)
him Suplak!
n+ n-0
=
himsuplan bn) eclimsupat
+
- = a
n+

F min himsupbu
supak: am kin
, supbih o
n>5-

supaint suph) Amabm =>Supaktsubksulate a

Kin kin

·LimSuplaktbkhSuktSub+
a

=> hmsuplan b) Limsupan hisuph

+ + s

4- n+ 0 v

(b)
Lmintan-Glink) hminfn =hiba ,
e
g.
.
an =
It)" bu ((n+
=

Liminflautbu) =himintaba
n+y
Limint an himinflex
n 30
-
=

n>0
-
= -

F Lin infancal intbiebl

,
Liminflantbul ohmintanthiinis
, =

12n kin

is
infant intbr =
al+ bl => infactinfbi infla bi) +

kin Kim ki kin kin

· Limint(dk bk) -himintak timb, a
n-0
+

Kim

=>Liminflantbn)- hiinfant limit

s
> n
-

LasD :

also
xigeR dexigs 20 .
dixy) iff = => dixry)
=-
,

x
dixys-g
=
,
20

"dixiys diy x) : dixy)

= diy
& = ,
x)
.

= ,
x
③ i dixizisdixig't day z) ,

diyz
diviys +

· i dixiz) =
did =
divigidlya
i,
dixiy) is a metric
(b) denys :J igi for xyeR is the Enideau distance

0:
<Xi-yi) indexings 10 20

Fi
Xi-yi = 0 s . t
.

xigi
:
dixy iff=0 x=
y
&"
(xi-yi (yi xi) =
-

dey Jx yi) Jyixi d(y

=
x) -
= - = ,

*
(laithi stai bily
*
③ for the Minkowski
inequality states +

p-2
,

then
Let ai
vi-yi bi gi-zi
= =
, ,

&i
ziki-yis +y zit
indixizk
dexays diy z) + ,
indexings is a metric

(8: Ki-gile in dexryse

i
Ki-Yil Fist xizgi diy iff in
y
= 0 .
= 0 x=

&" (xi
Yil (yi -xi)
- =

i
dixys = yi) = y -xi) dey x)
=
,
xi -

8 Fa beR lath)s(af 16
, +

(xi -zily(xi
gil + Yi zi)
-
-

=xi-zili yil + yi-zi) y diy

dx- + z)
d(x z)
=
-
,
,

is
dixiys is a metric