M2 Hevaruk Exercise of: Metaxctie| Tein Selttton
wee
19/7/2015
QI[Misc] (A very useful result)
Prove, by mathematical induction, that terest tne eed for all positive integers n.
()
Fer nel, Lisl
Poy “te,
Assant PCE) B trae fir som porte rtayer _k
ia. [ragdte the Ete)
Ter we ket
[424 34a-> tk * Eel
e Chea)
2. PCke) ts alse tue
By ale prveple of 42, Pr) 2 tr he pert the Srtager a
—— QCEAMath 9211 1]
Prove, by mathematical induction, that 1.2+2x5+3.8+..+nG—)=n'(a+0 for all positive integers 7, (5 marks)
Let POA) be ha stictemurt
Te acl, soled, Rise POUHI= 2 srys
Poy tee
te debt ae SH ee kG RAID 2 Cha)
For ae kel
led + axsae- +k Cale -1) +{k+ 1) (Bk +2)
EC kai) 4 (ee) (22)
= Cees) (k243k42)
riot b+ b+ 2)
(kei Che2)
"
2. PCkn) is alse te
ha pene}Q3[CE AMath 8911 2]
Prove, by mathematical induction, that 1:2.3+2.34+ ... +nr+D(n+2)= eee for all positive integers n.
Lit P60) be wt Stictemuart
12) 4)
a
Fer nel Liseivaxd 6, Reis? = 6= Las
Poy tw.
| Ck) Tu
ean) Chan ee?
be [aed t 2xB%4 tt bet) (ken)
For ae ket
x23 2203 x4 too t+ RCEn Cer) + ot) (et 2) kD
= Re lend) een) (eed
a
: Gtenti? (444)
de Pk) ts alse ta
By aa petreple of m7, 2a) ao rhe»
| QS[CE AMath 8811 5) -
| Prove, by mathematical induction, that 1° +3°+..+@n-1¥ ee for all positive integers 7. (6 marks) -
Let Fo) 5 L193)
Pe acl ese itel Rels*# ——y = | = lus
Poy “tee
Assen PSK) Brat fr sont porte iteger k
ig, Pa Bhaec a Cake yt = EGE
ta. . = 3
For at ket
2
Pastas + Oke) 4 cake!)
kak 1) Qk) bed”
3 + Gta)
He [e ake) 43 se]
> EL (aba +3)
=e cake (2b4a) (a1)
2. PCkw) ts alse thu.
By Ha preps of M2, PO) a te fr all partie yer a.Q3{CE AMath 8711 2]
Prove, by mathematical induction, that 2.14
ba ba Dao” Gaod|anet) deat
, 1 —~ for all positive integers n.
Lit P60) be wt Stictemuart
l
Fer net, Lose tute . Bese Gar 7 oo Les
Poy ore
ck) us
wey ty tee tet :
a. a * Tt 3a) =
Fer ae keh
| i ! I
rs =
1<4 ae Gb-2)BLan) Gb) (3L4 4)
k I
= =
Bk (Ber) (3 Fa)
» it fy, -1)
gin | Bk |
Bhes& be |
Gee (324)
Gbkrike) ke
Gb+i)(3ke4) Bhat
Pen) ts alse tr
Pu) > rh»Q6[CE AMath 861 1]
Let POA) be the Steteeurt
Prove, by mathematical induction, that att
1
Da
=~". for all positive integers ». (5 marks)
nett) net
tot
Fe net, Lasetat a. Res* T° a = Ls
PO) te.
Assiuny 26K) TB trae fre snk postin Iteyer
Ld 1 le
(a. Te DS A ee TT
Toe ne ket
1 1 te
Tea 7 Tae) * God
=—t |
Lat Girl bes)
!
poe beer)
bh 2b |
Geri 1 k+2)
= tet fel
Cee rleen) bar
2. PCkw) ts alse tau.
By we preps of MI, PG) ote fe ail pete ReyerQ7[CE AMath 8511 2]
Let r — for any positive integer n.
as
| Prove, by mathematical induction, that rz «x7, "2. for any positive integer (5 marks)
a=
g
i
he
§
Fer ne kel
Toe Te x Te * Tee
kez Chee)
aUkei) Caa)*
~ Hs
2Ckae)
ts Pen) is alse tau
By se pamela of 2, PG) oto fe all pete tyler 4.QS8[CE AMath 9111 7]
@
(b)
Prove, by mathematical induction, that +1.» =Znin=D2r=1 for all positive integers,
Using the formula in (a) and result of QI, find the sum 12-4253... ¢non+1 in terms of n.
car | Let PO) be tha stctemuat
Be net) Lise Pe]. RSs [O0G9G)= | = us
Poy mtr
Asene PE) BR trae fr some patie eteger &
ca. [Peate 4 kh] Zo Lebar ycake)
Toe ws ket
Peataces bia Chey”
Z kcke(aker) + Cea)?
w
| [ 5]
= ZEN k Gk + Caen]
ZU (2E + Th 46)
= (e+) (b+s)(abe3)
fs PCkew) ts alse tow.
By ee peteep le of MT, PE) dtr fe al pete Myer
0
b
[x2 t+ 2n34e-) 4 ow ae
= lela) 4axtaei) aees 4 antagi)
(hai) Gta) oer (tee)
C Pads ant) 4 Cla etn)
2 Zale Caan) SOD
“
ary (att 43)
we ol
alas) Gar)Q| (CE ‘AMath 9011 2]
Let 7, =0' +n for any positive integer n. Prove, by mathematical induction, that r +z +..+z = jacrsneD for any
positive integer n. (5 marks)
Let PCA) be the Stetemut
Fr nel Lose Tie ea) Rs 20 C3 I=2 = pats
PO Bate
Asuna 26k) tra for send parton integer &
ba Te Tye Te to ce bee)
Toe ae ket
Tat tt Tet Tee
ak ee Cte en te
3
2 FGsr[bceey aban 3]
= dU) (bases)
=e Chany (eae Cb)
2 Pkn) te alse tau
By ee peteedle of MI, Pla) Ds toe he atl pale yer a.
/ QUO [AL PMath 92115]
| A sequence ofinegers ) i defn by |? omai2,.”
u,,=2-u, frm=12..
1
[2x-1+(-1)) for all positive integers n.(3 marks)
| Using mathematical induction, show that x,
Lit PCA) be tha strtament
Fer acl, Lasse uso Ris = $[a-1+culeo =Lus
Poy mtr
Asians PCE) 1 trae for sonn pavvive onteyer
da. ups t [ak-1 eeu")
Toe ne ket
Mes = abe
= abet [ab-v4cey*]
= t[aceaka lt -cn*]
= gfakers ent")
= dfaten-t een]
2. PCkew) ts alse tee
By ha pee M1, PhQUI [CE AMath 831 9]
(a) Prove, by mathematical induction, that all positive integers n,
bendable D+) (6 marks)
coy | Let PC) be thy stetemuat
Fer nel Lass barn RS =e) 2a = Les
POY tw
Assunt PCE) B trae fer sont pation Mteeer k
BQ. twa tans t + beet) = —p bck Lbs?)
Fer we keh
leat axd tes ke +1) + Cet!) Chea)
= Bech kta) + ery (ke2)
FB er teen re 3)
be Pk) ts alse thu
By te dered leo Puyo f tf
(b) On a battle field, cannon-balls are stacked as shown in Figure 2. For a Stack with 7 layers, the
| balls in the bottom layer are arranged as shown in Figure 3 with 7 balls on each side. For the sec-
| ond bottom layer, the arrangement is similar but each side consists of (m ~ 1) balls; for the third
| bottom layer, each side has (7 — 2) balls, and so on, The top layer consists of only one ball.
Ee
gd look
(i) Using the result of Q1, find the number of balls in the r-th layer counting from the top in
terms of r.
bi)
Neaber of bell sty roth layer
=F j4atbeer ae
= TE (not dad(ii) Using the result of (a), or otherwise, find the total number of cannon-balls in a stack consist-
ing of m layers in terms of n.
TTta| ner 64 canam balls
= leu sae.) ae
> rs 2
—}— a fies note
2 Ls GrGervea] Uy cw)
2 + nt (ata) (a4)
| (iii)If the time required to deliver and fire a cannon-ball taken from the r-th layer is ? minutes,
find the time required to deliver and fire all the cannon-balls in the r-th layer in terms of r.
Hence, find the total time needed to use up all the cannon-balls in a stack of 10 layers. (14
marks)
Fok meine te ols ot all casenmbails se the m-th lager
hes) = Crate
2
Petal Bt neecleel,
= Cal) Cae os + Cro)
CitaaZarrtio) + to
jo (ies!)
alo
F 65aQI2 [Misc]
Prove, by mathematical induction, that (~1)(»-2)(n+3)-(2n)=2'.13-s--(2»-1) for all positive integers n.
Let POA) be the steteuat
Fer nel, Lose i 22 RHS = 2’ 1225 Los
Poy ate
Asin PEK) teat fre some porte Moyer k
be (ken) (hea) Ce3) = (2k) 2 2% 3-5 k=)
Tor ue bet NS “st 2 neve Tirm
= Leas ate] aha 1d
ea 3. 5s Cab-1) GERD
2. Pee) ts alse tun
By se poeple of oi, PG) 2 trae fe all patie Myer
Q13 [CE AMath 8111 11]
| (a) Prove, by mathematical induction, that +2 ++ = Lasnann, for all positive integers n.
car) Lick 2C0) be ha shctemunt -
Be acl, Lose he]. Bes* 0 0(28)= | us
Poy ote
Arne 2Ck) TB trae fr smd potion onteyer
ia, Prats nea kh eZ bebencake
Tee x kel,
(re ateee + bh Chey”
= gS kebo(aker) + Ceri)?
: yf 9]
ze pe Gl + Cee
= GOK + 1k 46
=z le+!) (E+) Cokes)
2. PCkew) ts alse tau.
By wa petrele of MZ, Pl) otha he all pertilg, Mager(b) Identical cubical bricks are piled up in layers to form a pyramidlike solid with a square base of
side x meters as shown in Figure 2. The side of the bottom layer consists of m bricks whereas
each side of the square layer immediately above has 1 ~ 1 bricks, and so on. There is only one
brick in the top layer.
(i) Find the volume of the r-th layer counting from the top in terms of r, x and n. Hence find the
volume of the solid in terms of r, x and n.
Py ays
= (4)
res
ae
| (ii) Using the result of (a) and (b)(j), show that the volume of the solid is always greater than that of a
pyramid of the same height, standing on the same base.
When 7 is very large, what value will the difference in volumes be elose to? (14 marks)
at ats wn
= 5 pan tae
: . 2)
= 7 C+ “]
= lt alae) Qui)
9B Cat aa)
- bn
2 Hd yrs 1
z8 aa “
For a tyenid fae sot ents sent bese
view = FDS ge!
3 1 o
vo Bedrock) og? te aay poste itagar 4QI4 [CE AMath 8411 2] (Proof of divisibility by MI, now out of syllabus.)
Prove by mathematical induction that, for all positive integers 1, 4»'~n is divisible by 3. (6 marks)
Cn)
Fr nel 4cp- 2 3 = 3x]
Poy te
Assume PCE) RB trae fr gone paste Mtager k
ia, Gd-k = 3Q even Mager @
Tor a2 ket
Aleaa’= (eer)
= 484 sak 44 -k-( \
3 2
= 40-8 4 abbaaks3
Oates ma a
= 8Q. 7 364k +441) es me ge
= 2A +4 +4k+1)
rr
ee ee ee Ruger
Pcl) ts alse —tau
2 > f 1,2?) »+ f site OtQIS [AL PMath 88 I 3(a)]
Given an infinite sequence {q.} of positive integers. Two sequences (p,} and {¢,} are defined by
Pads Pagel, p= apt. for nes;
Jat, @=as 4, 40,, +02 for n23.
Using mathematical induction, prove that »,,9, ~p4,,-(-1)" for all positive integers n.
Lit PCA) be ha Stctemuat
2 PC) Mtr
Bsr PCK) B trae fr sont patie integer _k
ket
ba. - eer
Tor a2 kel
= Pini Ge
Pre Be
= BsePrer Pe) Zee = Press (ies You * Ge)
~ Peli Pe Be
=e)"
= eit
Je PCke) ts alse tae
By 4ka pene} Pu Hel
4QU6 [Misc] (Double assumption, out of M2 syllabus.)
Let 0,3 (a>) be the two roots of the equation fex-ieo.
Assequence {a} is defined as fe
| Prove that «, = (o'-*) forall positive integers n
| [The sequence {o,} =1:12.45811... is the famous Fibonacei sequence.]
\
Eh 74a) i
zt
Ce
za,
eo POD ts time
ep tep \ Se ng st te be
cia | ctatok spun, |
ea)
Fr ned late)
2a.
Posy tn
na. Gus elt ig) wd Gen Bg) Qn. anol Onn,
For n= ken
Opes = Aner t ae
ater pn oe")
[eatCetei) = acpen]
= Ele Cat) - (3) Ctetsa® anh fel= 6
Bog et) sha oe ett nfs of
2. PCA) Gs alse thn, K'-K-|=0 )
4 pene} 2 ot
W
B pate nities ve tine of ote tant of
Ted al amarihy a tart tt
“
an LGC](a ci)
QI7 [AL PMath 86 1 9] (Double induction, out of M2 syllabus.)
For any positive integers m and n, let
Tia)=((-e 8") (1-2),
| Dlx) =(-x)(1-2")--(1-s*).
| Let P(mn) denote the statement “r(n.) is divisible by p(x).”
| (a) Show that for any positive integers m and n,
@_ P(mi) and P(un) are true,
Gi) If P(mnt) and p(m-+1n) are true, then P(m+tn=1) is also true.
(Hint: Consider r(m-+10+1)—r(mn+1).]
For Plat), Tey = Crea), DO) = ee
Te tee) Cit eet eT) ae
Than) = Cite tee te) DO)
Pmt) os true
For PC nd, Tend = Cl x Ce) Dewy = een td = Cea")
ze Tin) = Dea)
Gud
Pla) ms trae.
Th Planned aah Bowtie) eet Trae
ne Tem at!) = Dati Q.cx)
a1 al=DW) Ax? eal
For Plat, att)
Consider Thee a4) = TG, eet)
= ew) Cre nD ons (1) oe tea) one en)
2 en) nat dare (tae) [Cee Cae 2]
= Teme a) ein a)
Tenet tt = Tm net) = Tern) a= KO!)
Taal, mt) = Tne + Tmt a) KU = x
Dew /e, cm) 4 Qe x7]
“QF Qa) KD & Pelyremiol te X
Toast att
PC met mel) tee,(b) For any positive integer r>2, let g(r) denote the statement
“p(r—nn) is true for any n=12,..,r-1”
(i) Show that o(2) is true.
(ii) If o{e) is true for some r>2, show that ofe+1) isalsottue,
bi)
Fe Gar atl ashen. rei)
Pron. a) = PCa-t,1) =PCI1)
i ena) B el ke
ia. PCb-1,1), Ple-2, 2), --- PCL b=) are frm
By Cai) — Pmt a) neh Plea att) tephies Pbmti, ne) >
PCe-t,2),PCb-2, 3) P(a,k-1) ante
On sha athar hanck, PCL 1) ancl PCI k) amt true Chg €02¢12)
wt POR 1D, Plba tad, PC hase, PC) ane pre
Plbwt =n) at tee Sor any a8 yn,
oe A Ckat) 3 ate
| (c) Using (b), or otherwise, show that for any positive integers m and n, (1-»°)(
by (nf }o(-x").
Qa) % tar Chey <6)
3 dae Xs
they Alba) Bale tae Cy Gan)
(ie) is divisible
| By a pencil memati eth
+ all pete Pa.
’ m9 * x
Q Umta) 3 tra
Pe men-n, nd = Pm n) 3 “ter
IER Ce ee OD os huh by (omen?) Cx")
TLS a very otf pose ake the stetimsst Plein) rans ow Males ,
J
mandin. Tn ovdip to ob matmctte(hotzpin, we nese To Meodut He
Pree ilo a shoe halen ork dint Ye ole MI mM,
—
A
in