Sử Dụng Maple Giải Một Số Dạng Bài Toán Hình Học

I HC THI NGUYN
TRNG I HC KHOA HC
NGUYN TH DUNG
S DNG MAPLE GII MT S

BI TON HNH HC
LUN VN THC S TON HC
THI NGUYN 2012

1
S ha bi Trung tm Hc liu i hc Thi Nguyn
http://www.lrc-tnu.edu.vn
LI NI U
Trong vn ng dng Maple vo ging dy ton hc Ph thng ni chung, vo
hnh hc s cp ni ring tuy c nhiu tc gi quan tm, cho n nay c
nhiu ti liu ni v vic dy v hc ton c tr gip ca Maple c xut bn.
Tuy nhin, ti liu (c ti liu "truyn thng" cng nh ti liu in t) vic ng
dng Maple vo ging dy hnh hc ni chung v hnh hc ph thng ni ring vn
cn t, nht l cc ti liu ting Vit. Vi mong mun ng gp thm mt cht
cng sc vo lnh vc ng dng tin hc vo dy ton v hc ton, chng ti mnh
dn chn ti ny.
Trong Maple c c mt kho lnh s, cp n hu ht cc vn ca Ton
hc, v vy ti quan tm n vic khai thc, s dng cc lnh vo mc ch ca
mnh, l s dng Maple gii mt s bi ton hnh hc.
Lun vn gm 3 chng:
Chng 1 trnh by tm tt v Maple ni chung v Maple-16 ni ring. Gii thiu
v giao din v mi trng lm vic ca Maple. s dng c Maple, ngi
c phi nm vng phn ny.
Chng 2 ni v Maple vi cc bi ton hnh hc phng. Theo gi ca [1], chng
ti nu ra v gii quyt vi bi ton nh:
-) S dng Maple kim tra tnh li ca mt a gic.
-) Tnh din tch mt a gic (li hoc lm) khng t ct.
-) Kim tra mt im thuc min trong hay min ngoi ca mt a gic.
Chng 3 ni v cc bi ton hnh hc khng gian, s d phi chia thnh hai
chng l v trong hnh hc phng Maple c gi lnh Geometry, cn trong hnh
hc khng gian, Maple dng gi lnh Geom3d. Chng ti cng nu ra v s dng
cc lnh c sn gii mt s bi ton nh:
-) Vit phng trnh mt phng phn gic ca nh din.
2
-) Lun vn ng gp mt phn nh trong vn dy hnh hc trong cc trng

ph thng. N gip cho ngi dy v ngi hc c th nhn c kt qu nhanh v
khng tn nhiu cng sc.
Lun vn c hon thnh di s hng dn tn tnh ca TS Nguyn Vn Minh,
thy ng vin, gip ti rt nhiu trong sut qu trnh lm lun vn. Qua y,
ti xin c by t lng bit n su sc ti thy.
Trong sut qu trnh hc tp v lm lun vn, tc gi nhn c s quan tm
gip ca Khoa Ton, Phng o to trng HKH. Tc gi xin c by t
lng bit n v s gip ny.
Ti xin by t lng bit n ti gia nh ti, cha m v anh ch ti, nhng ngi
nui nng, cu mang sut c cuc i. Ti xin cm n cc bn cng hc thi i
hc v Cao hc, gip ti. trong thi k hc tp v vit lun vn.
Tc gi
Nguyn Th Dung
3
Chng 1. GII THIU V MAPLE-16

GIAO DIN CA MAPLE-16
Maple c xy dng v pht trin bi cng ty Waterloo Maple (a ch website:
http://www.maplesoft.com), tnh n nay Maple c phin bn th 16. Cc phin
bn v sau ca Maple cung cp nhiu cng c trc quan, nhiu gi lnh chuyn
ngnh ph hp vi cc tnh ton ph thng v bc i hc, giao din hon thin
hn v h tr son tho tt hn. Chnh nhng u im m nhiu ti nghin
cu v s dng maple trong dy ton v hc ton. Maple gp phn lm thay i
hn cch dy v hc ton, tc l song song vi li gii truyn thng ngi dy v
ngi hc c th gii quyt bi ton vi s gip ca Maple. Phng php ny
em n cho ngi hc mt cch tip cn mi vi ton hc: sinh ng, sng to v
rn luyn kh nng t hc, t kim tra v nghin cu.
File
Gm cc lnh tng t nh cc trnh son tho vn bn thng thng nh: New,
Open, Save, Save As...
c bit y c lnh Export As cho php ta lu d liu cc dng khc nhau
nh file maplet (khi lp trnh c giao din), file rtf , xut ra web,.....
Edit
Menu ny cha cc lnh lin quan n son tho, ging nh trong Word. Ngoi
cc lnh thng thng, chng ta ch n 1 s lnh c bit sau:
- Nhm lnh trong Split or Join: cho php ta hp hoc tch cc cm x l. Thut
ng "Cm x l" c th hiu l mt nhm lnh bt u bi du nhc [>. Khi
trang lm vic s bao gm nhiu cm x l.
- Nhm lnh Remove Output: Cho php ta xa nhanh cc kt qu tnh ton trn
trang lm vic. Nh tin ch ny m khi khng cn thit ta c th xa cc kt qu
v lu file th kch thc file thu c s nh i rt nhiu.
- Go To Bookmark, chc nng ny cho ta tm nhanh n Bookmark
4
View
y chng ta c 1 s lnh c bit hu dng nh:
- Tools Bar, Context Bar, Status Bar:n cho hin th thanh cng c, c li cho
son tho trn Maple.
- Expand Execution Group, Collapse Execution Group: m, ng cm x l
hin ti v tr con tr (tc l ch hin th kt qu hay hin th c phn lnh Maple)
- Expand Document Block, Collapse Document Block: m , ng tt c cc cm
x l trong trang lm vic.
- Inline Document Output: hin th hoc khng hin th vic nh dng.
- Slideshow: Cho php chuyn ngay v trng thi trnh chiu. Nu chn
Insert/Slideshow s chuyn t file ang son tho sang trng thi trnh chiu. Hin
th tng chng trong vn bn. Mun ra khi trng thi ny, nhn Esc.
- Show/Hide contents: Cho php n/hin ni dung, input, output...V Market ca
trang, cho php n/hin du v cm x l cm vn bn text, du section...
>
Insert
- Insert/Text:
Chuyn sang ch son tho vn bn, ging nh nhn T trn thanh cng c,
tuy nhin c mt cht khc bit, l: nu nhn vo "T" con tr mn hnh chuyn
xung cui section ang son tho, nu dng Insert/Text sau du [>, my s
chuyn sang mn hnh son tho text ngay ti con tr.
- 2-D Math:
Chuyn t dng vn bn text sang Maple.
- Insert/Execution Group: lnh ny cho php chn vo mt cm x l (Execution
Group), ngha l a du nhc lnh vo v tr trc con tr (before cursor) hoc sau
con tr (after cursor).
- Insert/Hyperlink: l mt cng c dch chuyn con tr gia cc trang lm vic,
hoc gia cc on (paragraph) trong mt trang lm vic.
- Hyperlink: cho php thit lp cc lin kt.
5
- Table: to bng
Windows
View
format
MI TRNG TNH TON

Cm x l (Excution Group)
Cm x ll thnh phn tnh ton c bn trong mi trng lm vic ca
Maple, c th bao gm cc i tng c bn ca Maplenh lnh, kt qu tnh

ton, th... C th d dng nhn bit mt cm x l bng du ngoc vung
bn tri du nhc lnh ca Maple.
to mt cm x l mi, ta kch chut vo biu tng [> trn thanh cng
c.
Lnh v kt qu ca Maple
Lnh ca Maple (Maple Input) Lnh c nhp sau du nhc lnh "[>" v kt
thc bi du ":" hoc du ";". Lnh c thc hin nu ta n phm Enter khi con
tr trong cm x l. Nu kt thc lnh bng du ";" kt qu s hin th ngay ra
6
mn hnh, cn nu kt thc bng du ":" th Maplevn tin hnh tnh ton bnh
thng nhng kt qu khng hin th ra mn hnh.
Ch : Lnh trong Maple phn bit ch hoa v ch thng. C th vit
nhiu lnh thnh mt nhm lnh, khi g Enter, Maple s thc hin c nhm
lnh . Cc lnh trong nhm c th vit trn cng mt dng, hoc ngt dng
bng cch n Shift + Enter.
Maplec hai dng lnh: lnh tr v lnh trc tip, hai dng lnh ny lun i theo
cp v c php ca chng ch khc nhau ch ch ci u tin trong tn lnh ca
lnh tr vit in hoa. Lnh trc tip cho ta kt qu tnh ton, cn lnh tr ch cho ta
biu thc tng trng. Kt qu ca vic tnh ton (Maple Output)hin trn mn
hnh c mc nh c mu xanh co ban.
Mc (Section)
Mt trang lm vic (worksheet) trong Maplethng bao gm nhiu mc,
mi mc c th cha nhng on(paragraph) v nhng mc con(subsection).

Mt mc trong trang lm vic ca Maplecng tng t nh mt mc trong cc
vn bn thng thng. Tuy nhin iu c bit l Maplec kh nng ng gi:
7
ta c th m mt mc ra c hoc gi li khi c xong bng cch kch chut

vo nt ch mc ng u mc.
Mun a thm mt mc mi vo trang vn bn ta a con tr mn hnh ln
ngang vi vi mc , sau s dng chc nng Insert Section. Mun thm

mt mc con vo trong mt mc ta a con tr mn hnh ln ngang vi vi mc
, sau s dng chc nng Insert Subsection.
Siu lin kt (Hyperlink)

Mt siu lin kt l mt i tng m nu ta kch hot vo th con tr s c di
chuyn n mt on, mt mc hay mt trang lm vic khc. to siu lin kt ta
a con tr n v tr t siu lin kt ri chn Insert Hyperlink. Trong hp
thoi Hyperlink Properties, nhp nhm k t i din vo Link Texthoc chn
nt check box Imageri kch chut vo nt lnh Choose Image... chn hnh nh
i din cho Hyperlink. Ti hp cun Type, chn Worksheet sau nhp tn file
cn lin kt ti vo Target, hoc chn nt lnh Browse... duyt tm file. Nhp
tn ca bookmark (nu c) vo Bookmark.
Mt s quy c, k hiu trong Maple

8
Cc php ton s hc: php cng (+), php tr (-), php nhn (*), php chia
(/), php ly tha (^) c vit trc tip vo dng lnh v thc hin theo th t
quen bit.Cch vit cc hm s cp (sin, ln...) cng c vit trc tip trong
dng lnh, nhng phi lu l bin s phi trong ngoc n; hm tang
khng vit l tg(x) m vit tan(x), arctang(x) khng vit l arctg(x) m vit
arctan(x); hm cotang khng vit l cotg(x) v cng khng vit l ctg(x) m
vit cot(x); hm m
vit l exp(x), s e vit l exp(1); cn bc hai ca x vit
l sqrt(x),
S c th dng k hiu "pi" hoc "Pi", mt ch th v l maple phn bit
"pi" (vit thng) v "Pi" (vit hoa), chng hn vit sin(pi) v sin(Pi) s cho kt
qu trn mn hnh khc nhau v hnh thc.
Lun nh l kt thc lnh lun lun l du ":" hoc ";". Nu kt thc lnh
bng du hai chm th kt qu khng hin ra trn mn hnh, cn kt thc bng

du chm phy th kt qu hin ra trn mn hnh.
Mun thc hin lnh no th a con tr mn hnh v dng lnh hoc
cm x l c dng lnh ri nhn Enter.

9
Mi lnh c vit trn mt dng vi di ty , tuy nhin c th ngt
dng bng cch nhn t hp Ship+Enter.

Cn vit cc lnh theo th t trc sau, v lnh sau c th dng kt qu ca
lnh trc.
Mun thc hin nhiu lnh ch bng mt ln nhn Enter, ta a chng vo
mt cm x l.
Ch 1.4.
Cc lnh ca Maplert phong ph, tuy nhin y chng ti ch gii thiu mt s
lnh c bn trong phm vi ng dng khi lm vic vi hm s mt bin. Nu mun
tm hiu su hn v mt lnh no , trn mn hnh lm vic ca Maple, ch
g cng thc ton (Math)hoc sau du nhc lnh, ta ch cn g "[> ?<tn lnh>;"
ri n phm Enter, khi c php y ca lnh ny s c hin th bn
tham kho.V d, khi mun tm hiu v lnh tnh tch phn, ta g "[> ?int;" ri n
phm Enter, hng dn v lnh s hin th tr gip cho ngi s dng.
LP TRNH TRN MAPLE

CC LNH LP TRNH C BN
Vng lp while (Vng lp khng xc nh)
Cu trc c php:
10
While <iu kin> do <dy lnh> end do;

Chc nng:
Vng lp whilecho php lp chui cc cu lnh gia dov end dokhi m iu kin
condition vn cn ng (tc l biu thc iu kin cho gi tr true). iu kin
condition c kim tra ngay ti u mi vng lp, nu n tha mn (gi tr ca
n l ng) th cc cu lnh bn trong c thc hin, sau li tip tc kim tra
iu kin condition cho n khi iu kin khng cn tha mn na.Vng lp
whilethng c s dng khi s ln lp mt hay mt chui biu thc l khng
xc nh r, ng thi ta mun cc biu thc cn c lp trong khi mt iu
kin no cn c tha mn.
iu kin condition trong vng lp phi l mt biu thc boolean, tc l gi tr ca
n ch c th l ng hoc sai, nu khng th s sinh ra li.
Trong trng hp mun thot ra khi vng lp ngay t trong gia vng lp, ta c
th thc hin bng cch dng cu lnh RETURN, break hoc quit.
Ch rng vng lp while- do- end do; khng bt buc phi nm trn nhiu dng
lnh nhng ngi ta thng vit trn nhiu dng cu lnh d c v d hiu
hn.
Vng lp Whilecho php lp chui cc cu lnh nm gia do v od khi m iu
kin vn cn ng.
Vng lp for (Vng lp xc nh)
Cu trc c php:
for <name> from <start> by <change> to <finishs>
<tatement sequence>
end do;
Hoc dng pht biu khc:
for <name> in <expression> do
<statement sequence>
11
end do;
Chc nng:
Vng lp forc dng lp mt chui cc biu thc c t gia dov end do,
mi ln lp tng ng vi mt gi tr phn bit ca bin ch s nameng sau t
kho for. Ban u, gi tr startc gn cho bin ch s. Nu gi tr ca bin
namenh hn hay bng gi tr finish th chui lnh nm gia dov end doc
thc hin, sau bin namec gn gi tr tip theo bng cch cng thm vo n
gi tr change (name:=name+change). Sau , bin namec so snh vi finish
quyt nh xem vic thc hin chui lnh c c tip tc na khng. Qu trnh
so snh bin ch s name v thc hin chui lnh c lp lin tip cho n khi gi
tr ca bin nameln hn gi tr finish. Gi tr cui cng ca bin name s l gi tr
vt qu finishu tin.
Ch . Nu cc t kha from start hoc by change b b qua th mc nh from1 v
by1 c dng.
Vng lp for- in- do- end do;thc hin vic lp vi mi gi tr m bin ch s
namely t biu thc expression cho. Chng hn vng lp ny c s dng
hiu qu khi m gi tr ca bin name l mt phn t ca mt tp hp hoc danh
sch
Trong trng hp mun thot khi t gia vng lp, ta c th dng cc cu lnh
break, quit, return ging nh trong vng lp while.
Lnh iu kin if
Cu trc c php:
if < condition> then
statement sequence
elif <condition> then
<statement sequence>
and if;
12
Chc nng: Nu bn mun mt dy biu thc c thc hin khi iu kin no

c tha mn v mt dy biu thc khc c thc hin nu tri li th c th
dng cu lnh if- then- else- end if. Trong cu lnh trn, nu iu kin condition l
ng th chui biu thc ng sau then c thc hin, nu tri li th iu kin
condition sau t kha elifs c kim tra, nu n ng th chui lnh tng ng
sau then c thc hin, c tip tc cho n khi cc iu kin condition u khng
tha mn, th cc biu thc sau lnh elsec thc hin.
Lu rng cu trc lnh (tu chn) elif...then... c lp li vi s ln tu . T
kho elifl dng vit tt ca else if.
Cc biu thc iu kin condition c s dng trong cu lnh ifphi c to
thnh t cc bt ng thc, cc ng thc (cc php ton quan h), cc bin s, cc
php ton logic, cc hm c gi tr tr li l gi tr logic. Nu tri li th s gy ra
li.
Lnh break
Cu trc ng php:
Chc nng: Trong lc vng lp while/for ang c thc hin, nu lnh

breakc gi th chng trnh s thot ngay lp tc ra khi vng lp while/for
tn trong cng nht m c cha lnh break(v cng c th c nhiu vng lp
while/forc lng nhau). Mt v d kh in hnh trong vic s dng lnh
breakl trong qu trnh tm kim search, r rng l bn s mun dng qu trnh
qut li ngay khi bn tm thy i tng cn tm. Khi , ngay ti thi im tm
thy, bn dng lnh break nhy ra khi vng lp tm kim. Trc lnh break
thng c mt cu lnh iu kin if... then...
Nu lnh breakdng ngoi cc vng lp while/forth s sinh ra li. Ch :
breakkhng phi l t kho (t dnh ring cho Maple), v vy ta c th gn gi tr
cho bin c tn l breakm khng h sinh ra li (mc d iu ny l khng nn).
Lnh next
Cu trc c php: next
13
Chc nng: Cng ging nh cu lnh break, lnh nextc thc hin trong vng
lp while/forvi mc ch b qua mt s lnh bn trong vng lp nhy qua ln
lp tip theo. Khi gp lnh nexttrong vng lp, chng trnh b qua cc lnh tip
theo ca vng lp tn cng nht cha nextcho n khi gp t kho xc nh kt
thc vng lp ( y l lnh end do). n y vng lp tip tc nhy qua ln lp
tip theo (nu c th) bng cch tng ch s hoc kim tra iu kin quyt nh
xem c nn thc hin vng lp tip theo.
Lnh nextsinh ra li nu n c gi ngoi vng lp while/for. Tng t nh
break, nextcng khng phi l t kha, do ta hon ton c th gn cho nextmt
gi tr (xem nh nextl mt bin). Ngay trc lnh next cng thng l mt cu
lnh iu kin if... then...
S dng hm return, error:
RETURN c s dng cho gi tr hm trc khi thot khi chu trnh. Nu
khng c lnh RETURN, chu trnh t ng cho kt qu ca php tnh cui cng
trong chu trnh.
ERROR c s dng a thng ip li ra mn hnh t bn trong chu trnh.
CCH THIT LP MT CHU TRNH
Gii thiu
Maple l mt ngn ng lp trnh hng chu trnh (procedure). Chng ta c th lm
vic vi Maple bng hai ch khc nhau: Ch tng tc trc tip thng qua
vic nhp tng lnh n l ngay ti du nhc lnh ca Maple v nhn c ngay
kt qu ca lnh . Ch chu trnh c thc hin bng cch ng gi mt dy
cc lnh x l cng mt cng vic vo trong mt chu trnh (procedure) duy nht,
sau ta ch cn gi chu trnh ny v Maple t ng thc hin cc lnh c trong
chu trnh mt cch tun t v sau tr li kt qu cui cng.
Maple cha mt lng rt ln cc hm to sn p ng cho nhng yu cu tnh
ton khc nhau trong nhiu lnh vc. Cc hm ny c lu tr trong cc gi chu
trnh (package) v ngi s dng c th d dng gi n mi khi cn thit. Tuy
nhin, ngi dng Maple c th t to cho ring mnh nhng gi chu trnh cng
14
nh c th trao i dng chung nhng gi chu trnh no y, phc v cho cng

vic mang tnh c th ring ca mnh.
Cc khi nim c bn cn phi nm vng to ra mt chu trnh (procedure) l:
Cu trc proc()..end; cng vi cc khai bo trong cu trc ny (global, local,
option,...).
Cc cu trc d liu v cc hm c lin quan (dy-sequence, tp hp-set, danh
sch-list, mng-array, bng-table).
Cc hm lp trnh c bn ( nu trn) v cc hm lin quan n vic x l d
liu (eval, evalf, evalm, subs, map, convert,...).
Khai bo chu trnh
Li gi khai bo mt chu trnh:
procedure_name:=proc(parameter_sequence)
[local local_sequence] 0934379
[global global_sequence]
[options options_sequence]
statements_sequence;
end;
Gii thch cc khai bo:
parameter_name: L mt dy cc k hiu, ngn cch nhau bi cc du phy, cha
tn cc tham bin truyn cho chu trnh.
local_sequence: L mt dy cc tn c khai bo l bin cc b trong chu trnh,
n ch c gi tr s dng trong phm vi chu trnh ang xt (local c s dng
khai bo cho cc bin ch s dng bn trong mt chu trnh).
global_sequen: Dy cc tn bin ton cc c gi tr s dng ngay c bn ngoi chu
trnh.
options_sequence: Dy cc tu chn cho mt chu trnh.
statements_sequence: Dy cc cu lnh do ngi lp trnh a vo.
Tham bin
15
Tham bin (parameter) l cc bin c t gia hai du ngoc trong biu thc
proc(...). Tham bin c dng nhn d liu truyn cho chu trnh khi gi chu
trnh . V d ta c th khai bo chu trnh tnh tng ca 2 s [tong:=proc(x,y)
x+y; end.] th khi gi chu trnh ny tnh tng ca hai s 10 v 5 ta phi truyn
cc d liu ny cho cc tham bin (cho x nhn gi tr l 10, y nhn gi tr l 5), tc
l ti du nhc lnh ta phi vit tong(10, 5); v sau khi thc hin chu trnh tr li
kt qu l 15.
Tham bin c tnh cc b: chng ch c s dng bn trong chu trnh c
khai bo, bn ngoi chu trnh ny chng khng mang ngha g. Kiu ca tham
bin c th c khai bo trc tip.
Phm vi cc bin (bin ton cc, bin cc b v tham bin)
Bin ton cc:
Bin ton cc c khai bo sau t kha global trong khai bo chu trnh. Bin
ton cc c khai bo bn trong mt chu trnh, nhng c phm vi gi tr trong
ton b chng trnh, tc l bn ngoi phm vi ca chu trnh m n c khai bo
trong .
Bin cc b:
Bin cc b c khai bo sau t kho localtrong khai bo chu trnh.
Bin cc b ch c gi tr bn trong chu trnh m n c khai bo. Ngoi chu trnh
ny n khng mang ngha g.
Tham bin:
Cng ging nh bin cc b, cc tham bin ch c gi tr bn trong phm vi ca
chu trnh m n c khai bo. Sau khi chu trnh kt thc, chng khng cn gi tr.
Tham bin cn c s dng tr li kt qu, nh cc ngn ng lp trnh truyn
thng. Ngoi ra, do Maple c nhng hm c kh nng tr li nhiu hn mt gi tr.
Ta c th gp cc gi tr ny vo mt danh sch tr li nh mt phn t.
nh gi cc bin
nh gi tn hm v tham bin:
16
Nh cp trc y, cc tn bin trong mt biu thc c Maple nh gi

trc khi thc hin cc php tnh trn chng. i vi vic thc hin cc hm cng
tng t nh vy. Trc tin l tn chu trnh c nh gi. Sau ln lt n
cc i s trong danh sch cc i s truyn cho chu trnh (c nh gi t tri
sang phi). Nu tn chu trnh c nh gi tr n mt chu trnh, th chu trnh y
c thc thi trn cc i s c nh gi. Tuy nhin vn c mt s chu trnh
ngoi l: l cc hm eval, assigned, seq.
nh gi bin cc b v bin ton cc:
Cc bin cc b v tham bin truyn cho chu trnh c nh gi mt cp (nh gi
mt ln), cn cc bin ton cc th c nh gi hon ton (full evaluation). Hm
eval(...) c dng p nh gi hon ton cho bin cc b v tham bin, v nh
gi mt mc cho cc bin ton cc.
X l cc chu trnh quy (mc 2.6 trang 141)
TM LI TRONG CHU TRNH (3. trang 152)
>
Chng 2. HNH HC PHNG

2.0. TM TT L THUYT
1) Khong cch gia hai im:
"d="
17
"sqrt((x[2]-x[1])^(2)+(y[2]-y[1])^(2))"
NULL
2) im M(x,y) chia on
M[1]
M[2]
theo t s , c biu din theo cng thc:
x[1] + λx[2]
y[1] + λy[2]
x = -------------------; y = -------------------;
1 + lambda
1 + lambda
Trng hp ring =1, ta c ta trung im:
"x= (x[1]+x[2] )/(2), y=(y[1]+y[2] )/(2)."
3) ng thng:
i) Phng trnh ng thng i qua im
M(x[1], y[1])
v c h s gc k:
y = k(x - x[1]) + y[1]
ii) Phng trnh ng thng i qua hai im

18
M[1](x[1], y[1])
v
M[2](x[2], y[2])
:
x - x[1]
y - y[1]
----------- = ----------x[2] - x[1] y[2] - y[1]

trong cch vit trn, nu mu s no bng khng, th t s ca phn s phi bng khng.
iii) Phng trnh tng qut ca ng thng:
Ax+By+C=0,
vi iu kin A v B khng ng thi bng khng.
4) H hai ng thng:
piecewise(l[1], A[1] x + B[1] y + C[1] = 0, l[2],
A[2] x + B[2] y + C[2] = 0)
"[[,],[,]] "
-) iu kin song song ca
l[1]
v
l[2]
l:
A[1] B[1]
B[1] C[1]
---- = ---- and ---- <> ---19

A[2] B[2]
B[2] C[2]
-) iu kin trng nhau ca

l[1]
v
l[2]
l:
A[1] B[1]
B[1] C[1]
---- = ---- and ---- = ---A[2] B[2]
B[2] C[2]
-) iu kin ct nhau ca
l[1]
v
l[2]
l:
A[1] B[1]
---- <> ---A[2] B[2]
hay l
A[1] B[2] <> A[2] B[1]
5) Chm ng thng:
Cho 2 ng thng ct nhau
A[1] x + B[1] y + C[1] = 0
v
20
A[2] x + B[2] y + C[2] = 0

, khi , tp hp tt c cc ng thng c dng
alpha(A[1] x + B[1] y + C[1]) + beta
A[2] x + B[2] y + C[2] = 0

Vi v l nhng hng s ty , khng ng thi bng khng, c gi l chm ng thng.
6) Gc gia hai ng thng: Gi s hai ng thng c h s gc l
k[1]
v
"k[2], "
khi gc quay ngc chiu kim ng h ng thng
l[1]
cho ti khi song song vi
l[2]
, c k hiu l tnh theo cng thc:
k[2] - k[1]
tan(ϕ) = ------------1 + k[1] k[2]
i) Trng hp ring th nht: hai ng thng song song, khi v ch khi h s gc ca chng bng nhau
k[1] = k[2]
ii) Trng hp ring th hai: hai ng thng vung gc, khi v ch khi tch h s gc ca chng bng -1:
k1*k2=-1
7) Khong cch t im
21
M[0](x[0], y[0])
ti ng thng Ax+By+C=0 l:
|Ax[0] + By[0] + C|
d = ------------------/ 2 2\
sqrt\A + B /
ngha ca biu thc:
rho = Ax + By + C
l mt phng c chia thnh 3 tp con:
i) Tp hp nhng im m Ax+By+C=0, l ng thng vi phng trnh Ax+By+C=0;
ii) Tp hp nhng im m Ax+By+C>0, l na mt phng c b l ng thng
rho = 0
iii) Tp hp nhng im m Ax+By+C<0, l na mt phng c b l ng thng
rho = 0
8) Elip.
i) Phng trnh chnh tc:
2 2
x y
-- + -- = 1
2 2
a b
Nu a>b, hai tiu im thuc trc thc, c ta
/
/ 2 2\ \
/ / 2 2\ \
F[1]\-sqrt\a - b /, 0/, F[2]\sqrt\a - b /, 0/

Nu b>a, hai tiu im thuc trc tung, c ta
22
/ 2 2\\
/ 2 2\\
F[1]\0, -sqrt\a - b //, F[2]\0, sqrt\a - b //

Khi a=b, elip tr thnh ng trn, c tm ti O(0,0) bn knh R=a.
ii) Tm sai ca elip:
/
2\
| b|
epsilon = sqrt|1 - --|
|
2|
\ a/
. Tm sai ca elip lun lun nh hn 1
iii) Phng trnh tham s ca elip:
"{[[x=a.cost,],[y=bsint,]]"
iv) Phng trnh tip tuyn ca elip c tip im l
M[0](x[0], y[0])
:
xx[0] yy[0]
----- + ----- = 1
2
v) iu kin cn v ng thng Ax+By=C, tip xc elip:
2 2 2 2 2
A a +B b =C
9) Hyperbol
23

2 2
x y
-- - -- = 1
2 2
a b
Trc thc l trc Ox, hai tiu im thuc trc thc, c ta

/
/ 2 2\ \
/ / 2 2\ \
F[1]\-sqrt\a + b /, 0/, F[2]\sqrt\a + b /, 0/

ii) Tm sai ca hyperbol:
/
2\
| b|
epsilon = sqrt|1 + --|
|
2|
\ a/
. Tm sai ca elip lun lun ln hn 1
iii) Tim cn:
bx
bx
y = ---; y = - ---;
a
iv) Phng trnh tip tuyn ca elip c tip im l

M[0](x[0], y[0])
:
24
xx[0] yy[0]
----- - ----- = 1
2
v) iu kin cn v ng thng Ax+By=C, tip xc elip:
2 2 2 2 2
A a -B b =C
vi) Hyperbol lin hp:
2 2
x y
-- - -- = 1
2 2
b a
9) Parabol:
"y^(2)=2 px,"
i) Tiu im: F(c,0)
ii) Phng trnh tip tuyn ti tip im:
yy[0] = p(x + x[0])
25
10) Cc h thc lng trong tam gic: sin cos dt dknoi tiep tiep tuyen
i) nh l hm s sin:
a
---- = ---- and ---- = ---- and ---- = 2 R

sinA sinB
sinB sinC
sinC
ii) nh l hm s cosin:
2 2 2
a =b +c
- Typesetting[delayDotProduct]\((2 b) . c) . cosA, b , true/ and
2 2
b +c
- Typesetting[delayDotProduct]\((2 b) . c) . cosA, b , true/ =
2 2
c +a
- Typesetting[delayDotProduct]\((2 c) . a) . cosB, c , true/ and
26
2 2
c +a
- Typesetting[delayDotProduct]\((2 c) . a) . cosB, c , true/ =
2 2
a + b - ((2 a) . b) . cosC
11) iu kin ni tip ca t gic: T gic ABCD c hai ng thng AB v CD ct nhau ti E, hai ng
thng AC v BD ct nhau ti F. iu kin cn v ABCD ni tip l mt trong hai h thc sau y
c tha mn:
EA . EB = (Typesetting[delayDotProduct](EC . ED, FA, true)) . FC and
(Typesetting[delayDotProduct](EC . ED, FA, true)) . FC = FB .
FD
12) iu kin cho tip tuyn:
i) Khong cch t tm ng trn (c) ti ng thng l ng bng bn knh R ca ng trn.
ii) Tam gic ABC, M thuc phn ko di ca cnh AB. iu kin cn v MC l tip tuyn ca ng
trn (ABC) l h thc:
2
MA . MB = MC
13) Phng tch, trc ng phng, tm ng phng:
i) ng trn (O,R); M l mt im trn mt phng. i lng:
| 2 2|
|MO - R |
c gi l phng tch ca im M i vi ng trn O.
27
ii) Cho hai ng trn, tp hp cc im c cng phng tch i vi hai ng trn l mt ng thng.
Hai ng trn ng tm th khng c trc ng phng
iii) Ba ng trn c tm khng thng hng th ba trc ng phng ng quy, gi l tm ng phng.
2.1. IM
Mt im A trong mt phng c khai bo bi c php point(A,x,y) hoc point(A,*x,y+), trong A l
tn im, x, y, tng ng l honh , tung ca im A.
Trung im M ca on thng AB, c c php midpoint(M,A,B).
Mun xem ta ca M ta dng lnh:
Ta im M: [> coordinates(M).
Honh im M: [> HorizontalCoord(M);
Tung im M: [> VerticalCoord(M);
2.2. NG THNG
-) Khai bo ng thng i qua 2 im [> line(l,[A,B]); y l l tn ng thng, A v B l 2 im
cho.
-) Phng trnh ng thng l i qua im P cho trc v vung gc vi ng thng c tn d cho trc:
[> PerpendicularLine(l,P,d);
-) Phng trnh ng thng l i qua im P cho trc v song song vi ng thng c tn d cho trc:
[> ParallelLine(l,P,d);
-) K hiu bin honh v bin tung : _EnvHorizontalName := x: _EnvVerticalName := y:
-) nhp ng thng l c phng trnh ax+by+c=0, dng lnh [> line(l, ax+by+c=0);
-) ng thng c tn l l, mun bit phng trnh ca n, dng lnh [> equation(l);
-) Khong cch t mt im M n mt ng thng c tn l l: [> distance(M,l);
-) Hnh chiu ca im P ln ng thng l: [> projection(H,P,l); vi H l tn ca hnh chiu.
-) im i xng ca im P qua ng thng l: [> reflection(Q,P,l);
-) Tm giao im A ca 2 ng thng l, d: [>intersection(A,l,d);
-) Tnh ln ca gc gia hai ng thng d1 v d2: [> FindAngle(d1,d2);
28
2.3. ON THNG
-) Cho trc 2 im A v B: point(A,0,0),point(B,1,1):
-) on thng vi 2 u mt: [> segment(AB,[A,B]); vi AB l tn ca on thng, A v B l 2 u mt.
-) tnh di ca on AB, ta dng lnh [> distance(A,B);
-) Trung trc ca on thng: [> PerpenBisector(l,A,B); l l tn on thng, A v B l 2 im cho trc.
2.4. TAM GIC V CC NG C BIT

2.4.1. KHAI BO TAM GIC
-) Khai bo mt tam gic c tn l T vi A, B, C cho trc: Ta dng lnh [> triangle(T,[A,B,C]);
-) Tam gic c tn l T, to bi 3 ng thng d1, d2, d3. Ta dng lnh [> triangle(T,[d1,d2,d3]);
-) Tam gic T, bit di 3 cnh l a, b, c. Ta dng lnh [> triangle(T, [a,b,c]);
-) Tam gic T, khi bit 2 cnh a,b v gc C xen gia. Ta dng lnh [> triangle(T,[a,àngle`= C, b]);
-) Ta cc nh ca tam gic ABC: [> map(coordinates,DefinedAs(ABC));
-) Tnh din tch tam gic: [> area(T); T l tn ca tam gic
Th d
Cho 3 im A(0;0), B(5;5), C(0;10); cho 3 cnh a=3, b=7,c=9 v 3 gc A1=/6; C1=/3. Hy khai bo cc
tam gic sau:
1) C 3 nh l ABC;
2) Nhn 3 cnh l a,b,c;
3) C cnh a, cnh b v gc C1;
Gii
> point(A, [0, 0]); point(B, [5, 5]); point(C, [0, 10]); a := 3; b := 7; c := 9; line(AB, x+21*y-22 = 0, [x, y]);
line(BC, 5*x-12*y+7 = 0, [x, y]); line(CA, 4*x-33*y+146 = 0, [x, y]);
> triangle(T1, [A, B, C]), triangle(T2, [a, b, c]), triangle(T3, [AB, BC, CA]), triangle(T4, [a, 'angle' = (1/2)*Pi,
b]);
2.4.2. CC NG C BIT TRONG TAM GIC

29
-) ng cao, c 2 cch khai bo:

Cch th nht [> altitude(hA, A,T);
Cch th hai [> altitude(hA, A,T,H); vi hA l tn ng cao, A l nh ca tam gic T m ng cao i
qua, cn H l chn ng cao. Mun xem chi tit v hA ta dng lnh [> detail(hA); trong lnh deail, nu
khai bo theo cch th nht s cho ta bit phng trnh ng cao; nu khai bo theo cch th 2 s cho
ta ta chn ng cao.
-) ng trung tuyn: *> median(AM, A, ABC); AM l tn ng trung tuyn, A l nh ca tam gic ABC
m ng trung tuyn i qua. Mun xem chi tit v AM ta dng lnh [> detail(AM).
-) ng trung trc ca mt cnh: [> PerpenBisector(l,A,B);
-) ng phn gic trong: *> bisector(AD,A,ABC); AD l tn ng phn gic, A l nh ca tam gic ABC
m ng phn gic i qua. Mun xem chi tit v AD ta dng lnh [> detail(AD).
-) ng phn gic ngoi: *> ExternalBisector(AE,A,ABC); AE l tn ng phn gic, A l nh ca tam
gic ABC m ng phn gic i qua. Mun xem chi tit v AE ta dng lnh [> detail(AE).
Th d
Cho tam gic ABC, vi A(1,1), B(1,-2), C(3,3). Hy vit phng trnh ng cao, trung tuyn, trung trc,
phn gic trong v phn gic ngoi ca tam gic ABC xut pht t nh A; vit phng trnh ng trung
trc ca cnh AB.
Gii:
> point(A, [1, 1]), point(B, [1, -2]), point(C, [3, 3]), triangle(ABC, [A, B, C]);
> altitude(hA, A, ABC);
> median(AM, A, ABC); detail(AM);
> bisector(AD, A, ABC); detail(AD);
> ExternalBisector(AE, A, ABC); detail(AE);
> PerpenBisector(l, A, B); detail(l);
2.4.3. CC IM C BIT TRONG TAM GIC
-) Trng tm ca tam gic: [> centroid(G,T); G l trn trng tm, T tn l tam gic.
-) Trc tm ca tam gic: [> orthocenter(H,T);
-) Tm ng trn ni tip.
-) Tm ng trn ngoi tip.
30
-) Tm ng trn bng tip.
2.5. NG TRN
-) ng trn i qua 3 im A,B,C; dng lnh [> circle(c1, [A, B, C], n, 'centername'=m); y c1 l tn
ng trn, m l k hiu tm ca ng trn.
-) ng trn i qua 3 im A,B,C; dng lnh [> circle(c1, [A, B, C], [x,y]); y c1 l tn ng trn.
-) ng trn c tm l im A, vi bn knh r:
[> circle(C, [A, r]); hay l: [> circle(C, [A, r], [x, y]);
-) ng trn C c phng trnh cho trc:
[> circle(C,
" x^(2)+y^(2)-2*a*x-2*b*y+c=0,[x,y]);"
-) Tm k hiu tm ca ng trn C: [> center(c);
-) Tm ta tm ca ng trn C: [> coordinates(center(c));
-) Tnh bn knh ca ng trn C: [> radius(c);
-) Phng tch ca im M i vi ng trn C: [> powerpc(M,C);
-) Trc ng phng ca hai ng trn.
-) Tm ng phng ca 3 ng trn.
-) Tm giao im ca 2 ng (mt ng trn mt ng thng hoc hai ng trn) C1 v C2: [>
intersection(H,C1, C2, [M,N]); y M v N l 2 giao im, H l tp hp cc thng tin v hai giao im
m ta c th tm bi lnh [> detail(H);
2.6. TIP TUYN CA NG TRN
-) Tip tuyn ti mt im M thuc ng trn c: [>tangentpc(t,M,c); y t l tn ca tip tuyn. M l
tip im bit.
-) Tip tuyn vi ng trn c v i qua im M cho trc: [>TangentLine(T,M,c,[t1,t2]); y T l tp
hp cc thng tin v tip tuyn, c th tra cu bi lnh [> detail(T); t1, t2 l tn ca mi tip tuyn.
-) ng trn c c tm O ni tip tam gic T: [> incircle(c,T,'centername'=O);
31
-) Ba ng trn bng tip tam gic: [> excircle(H,T, [c1(o1),c2(o2),c3(o3)]); H l tp hp cc thng tin v
3 vng trn bng tip, T l tam gic cho, *c1(o1),c2(o2),c3(o3)+ l 3 ng trn bng tip vi tm l
O1, O2, O3.
Ch : c th ch dng lnh th 2 m khng cn n lnh th nht.
2.7. MT SIM, NG THNG, NG TRN.
1) im Gecgon: [>GergonnePoint(G, ABC); y G l tn ca im, ABC l tn tam gic. im Gecgon l
im ng quy ca 3 ng thng AA1, BB1, CC1. A1, B1, C1 l cc tip im ca ng trn ni tip vi
3 cnh.
2) im Nagel : [> NagelPoint(N, T); y N l tn ca im, ABC l tn tam gic. im Nagel l im
ng quy ca 3 ng thng AA1, BB1, CC1. A1, B1, C1 l cc tip im ca ng trn bng tip vi 3
cnh.
3) ng thng Simpson: *> SimpsonLine(sl,N,T); sl l tn ng thng Simson, N l im h t ng
trn ngoi tip tam gic T.
>
2.8. NHM LNH KIM TRA
Nhm lnh kim tra bt u bng Are hoc Is dng kim tra tnh ng hoc sai ca mt tnh cht no
.
S th t
C php
Chc nng
1
[> ArePrallrel (l1,l2,cond);
Kim tra tnh song song ca hai ng thng l1, l2.
2
[> Areconcurrent(l1,l2,l3,cond);
Kim tra tnh ng quy ca 3 ng thng l1, l2, l3.
3
[> ArePerpendicular(l1,l2,cond);
Kim tra tnh vung gc ca hai ng thng l1, l2.
32
4
[> AreTangent(f,g);
Kim tra tnh tip xc gia hai ng f v g (mt ng thng vi mt ng trn hoc hai ng trn.
5
[> IsOnCircle(A,c,cond);
Kim tra xem im F c nm trn ng trn c hay khng?
6
[> IsOnline(A,l,cond);
Kim tra xem im F c nm trn ng thng l hay khng?
7
[> IsRightTriangle(ABC,cond);
Kim tra tnh vung ca tam gic c tn l ABC
8
[> AreConcyclic(P1,P2,P3,P4);
Kim tra 4 im P1, P2, P3, P4 thuc 1 ng trn
9
[> AreSimilar(T1, T2, cond);
Kim tra tnh ng dng ca hai tam gic
10
[> AreCollinear(A,B,C);
Ki
m tra tnh thng hng ca ba im A,B,C
Ch :
-) C th b iu kin cond hoc s dng trong trng hp c cha tham s.
-) Khi kt thc cc lnh ny v enter, kt qu s l true hoc false.
-) Lnh 4 v lnh 8 c th thay th cho nhau.
33
-) Trong mt s trng hp phi dng lnh [> assume(logic);
HNH HC KHNG GIAN

TM TT L THUYT
1) Khong cch gia hai im:
"d="
"sqrt((x[2]-x[1])^(2)+(y[2]-y[1])^(2)+(z[2]-z[1])^(2))"
im M(x,y,z) chia on
34
M[1]
M[2]
theo t s , c ta biu din theo cng thc:
x[1] + λx[2]
x = -------------------;
1 + lambda
y[1] + λy[2]
y = -------------------;
1 + lambda
z[1] + λz[2]
z = -------------------;
1 + lambda
Trng hp ring =1, ta c ta trung im:
"x= (x[1]+x[2] )/(2), y=(y[1]+y[2] )/(2),z=(z[1]+z[2] )/(2)."
2) ng thng:
i) Phng trnh ng thng i qua hai im

M[1](x[1], y[1], z[1])
v
M[2](x[2], y[2], z[2])
35
:
x - x[1]
y - y[1]
y - y[1]
z - z[1]
----------- = ----------- and ----------- = ----------x[2] - x[1] y[2] - y[1]
y[2] - y[1] z[2] - z[1]
trong cch vit trn, c quy c nu mu s no bng khng, th t s ca phn s phi bng khng.
Vector ch phng:
#mover(mi("v"),mo("→")) = (x[2] - x[1], y[2] - y[1],
z[2] - z[1])
ii) Phng trnh dng tham s
x = x[0] + at; y = y[0] + bt; z = z[0] + ct;
ng thng i qua im
"M[0](x[0],y[0],z[0]), "
c vector ch phng
"(v)=(a,b,c). "
C th kh tham s t v c phng trnh
x - x[0] y - y[0]
y - y[0] z - z[0]
-------- = -------- and -------- = -------a
iii) Phng trnh tng qut ca ng thng:

piecewise(P[1], A[1] x + B[1] y + C[1] z + D[1] = 0, P[2],
A[2] x + B[2] y + C[2] z + D[2] = 0)
4) H hai mt phng
36
-) iu kin song song ca

P[1]
v
P[2]
l:
A[1] B[1]
B[1] C[1]
C[1] D[1]
---- = ---- and ---- = ---- and ---- <> ---A[2] B[2]
B[2] C[2]
C[2] D[2]
-) iu kin trng nhau ca

P[1]
v
P[2]
l:
A[1] B[1]
B[1] C[1]
C[1] D[1]
---- = ---- and ---- = ---- and ---- = ---A[2] B[2]
B[2] C[2]
C[2] D[2]
-) iu kin ct nhau ca
P[1]
v
P[2]
l:
A[1] B[1]
37
---- <> ---A[2] B[2]

hoc
B[1] C[1]
---- <> ---B[2] C[2]
hoc
C[1] A[1]
---- <> ---C[2] A[2]
hay l
A[1] B[2] <> A[2] B[1]
hoc
B[1] C[2] <> B[2] C[1]
hoc
A[2] B[1] <> A[1] B[2]
5) Chm mt phng:
Cho 2 mt phng ct nhau
A[1] x + B[1] y + C[1] = 0
v
A[2] x + B[2] y + C[2] = 0
, khi , tp hp tt c cc mt phng c dng
alpha(A[1] x + B[1] y + C[1] z + D[1]) + beta
38
A[2] x + B[2] y + C[2] z + D[2] = 0

Vi v l nhng hng s ty , khng ng thi bng khng, c gi l chm mt phng.
6) Gc gia hai mt phng l gc nhn to bi hai vector php tuyn
7) Khong cch t im
M[0](x[0], y[0], z[0])
ti mt phng Ax+By+Cz+D=0 l:
|Ax[0] + By[0] + Cz[0] + D|
d = --------------------------/ 2 2 2\
sqrt\A + B + C /
ngha ca biu thc:
rho = Ax + By + Cz + D
Khng gian c chia thnh 3 tp con:
i) Tp hp nhng im m =Ax+By+Cz+D=0, l mt phng vi phng trnh
Ax+By+Cz+D=0,
ii) Tp hp nhng im m =Ax+By+Cz+D>0, l na khng gian c b l mt phng

rho = 0
iii) Tp hp nhng im m =Ax+By+C<0, l na mt phng c b l ng thng
rho = 0
7) Mt cu:
2 2
39
(x - x[0]) + (y - y[0]) + (z - z[0]) = R

ii) Phng trnh tng qut:
"x^(2)+y^(2)+z^(2)-2 a[]x-2 by-2 cz+d=0, "
vi iu kin:
/2 2 2
>\a + b + c - d, 0/
8) iu kin mt phng l tip din ca mt cu: khong cch t tm mt cu n mt phng bng bn

knh mt cu.
9) Mt s bi ton
1) Phng trnh mt phng i qua ba im:
M[1](x[1], y[1], z[1]);
M[2](x[2], y[2], z[2]);
M[3](x[3], y[3], z[3]);
Typesetting[delayDotProduct](det, Matrix(3, 3, {(1, 1) = `+`(x,
`-`(x[1])), (1, 2) = `+`(y, `-`(y[1])), (1, 3) = `+`(z,
`-`(z[1])), (2, 1) = `+`(x[2], `-`(x[1])), (2, 2) =
`+`(y[2], `-`(y[1])), (2, 3) = `+`(z[2], `-`(z[1])), (3, 1)
= `+`(x[3], `-`(x[1])), (3, 2) = `+`(y[3], `-`(y[1])), (3,

40
3) = `+`(z[3], `-`(z[1]))}), true) = 0

2) Phng trnh mt phng i qua im
M[0](x[0], y[0], z[0])
v song song vi hai vector
#mover(mi("a"),mo("→")) = (a[1], a[2], a[3]),
#mover(mi("b"),mo("→")) = (b[1], b[2], b[3])

cho trc.
Typesetting[delayDotProduct](det, Matrix(3, 3, {(1, 1) = `+`(x,
`-`(x[0])), (1, 2) = `+`(y, `-`(y[0])), (1, 3) = `+`(z,
`-`(z[0])), (2, 1) = a[1], (2, 2) = a[2], (2, 3) = a[3], (3,
1) = b[1], (3, 2) = b[2], (3, 3) = b[3]}), true) = 0
3) V tr tng i gia mt phng P v ng thng l:

Gi s c mt phng P cho bi phng trnh: Ax+By+Cz+D=0
v ng thng l c phng trnh:
x = x[0] + at; y = y[0] + bt; z = z[0] + ct;
i) iu kin ct nhau: Vector ch phng ca ng thng khng trc giao vi vector php tuyn ca
mt phng:
41
Ab + Bb + Cc <> 0
ii) iu kin song song:
Ab + Bb + Cc = *(0, v) Ax[0] + By[0] + Cz[0] + D and *(0, v) Ax
[0] + By[0] + Cz[0] + D <> 0
iii) iu kin l thuc P:

Ab + Bb + Cc = *(0, v) Ax[0] + By[0] + Cz[0] + D and *(0, v) Ax
[0] + By[0] + Cz[0] + D = 0

4) iu kin cho nhau ca 2 ng thng
Cho hai ng thng
x - x[1] y - y[1]
y - y[1] z - z[1]
-------- = -------- and -------- = -------a[1]
b[1]
b[1]
c[1]
v
x - x[2] y - y[2]
y - y[2] z - z[2]
-------- = -------- and -------- = -------a[2]
b[2]
b[2]
c[2]
iu kin hai ng thng cho nhau l:
Typesetting[delayDotProduct](det, Matrix(3, 3, {(1, 1) =
`+`(x[2], `-`(x[1])), (1, 2) = `+`(y[2], `-`(y[1])), (1, 3)

42
= `+`(z[2], `-`(z[1])), (2, 1) = a[1], (2, 2) = b[1], (2, 3)
= c[1], (3, 1) = a[2], (3, 2) = b[2], (3, 3) = c[2]}), true) <>
5) iu kin ng phng ca 3 vector:
Typesetting[delayDotProduct](det, Matrix(3, 3, {(1, 1) = a[1],
(1, 2) = b[1], (1, 3) = c[1], (2, 1) = a[2], (2, 2) = b[2],
(2, 3) = c[2], (3, 1) = a[3], (3, 2) = b[3], (3, 3) = c[3]}),
true) = 0
5') iu kin ng phng ca 4 im
M[0](x[0], y[0], z[0]);

M[1](x[1], y[1], z[1]);
M[2](x[2], y[2], z[2]);
M[3](x[3], y[3], z[3]);
Typesetting[delayDotProduct](det, Matrix(3, 3, {(1, 1) =

43
`+`(x[1], `-`(x[0])), (1, 2) = `+`(y[1], `-`(y[0])), (1, 3)
= `+`(z[1], `-`(z[0])), (2, 1) = `+`(x[2], `-`(x[0])), (2,
2) = `+`(y[2], `-`(y[0])), (2, 3) = `+`(z[2], `-`(z[0])),
(3, 1) = `+`(x[3], `-`(x[0])), (3, 2) = `+`(y[3],
`-`(y[0])), (3, 3) = `+`(z[3], `-`(z[0]))}), true) = 0
6) Phng trnh mt cu i qua 4 im khng ng phng

MT SLNH CA MAPLE 16
1.1. im
1) im M trong khng gian c khai bo bi lnh [> point(M,x,y,z) hoc point(M,*x,y,z+), trong M l
tn im, x, y, z tng ng l honh , tung v cao ca im M.
Ta ca im c th chn ngu nhin:
Lnh 1 *> randpoint(Tn im, khong 1, khong 2, khong 3);
Lnh 2 *> randpoint(Tn im, i tng, khong 1, khong 2, khong 3);
i tng l ng thng, mt phng, mt cu, ngha l im c chn ngu nhin trn cc i tng
2) Tng t nh trong hnh hc phng, ta cng c:

Trung im ca on thng AB, c c php midpoint(M,A,B).
Mun xem ta ca M ta dng lnh:
Ta im M: [> coordinates(M).
44
on thng
1) on thng khng nh hng: [> segment(tn, [P1,P2]) hoc [> segment(tn, P1,P2);
2) on thng c nh hng:
[> dsegment(tn, [P1,P2]) hoc [> dsegment(tn, P1,P2).
1.2. ng thng
1) ng thng d i qua im M(x0,y0,z0) v c vector ch phng V(a1,a2,a3), mun nhp di dng
tham s {x=x0+a1.t, y=y0+a2.t, z=z0+a3.t}, ta dng lnh:
[> line(d,[x0+a1.t, y0+a2.t, z0+a3.t],t);

2) ng thng d i qua im M(x0,y0,z0) v c vector ch phng V(a1,a2,a3), mun nhp chnh tc
x - x0 y - y0
y - y0 z - z0
------ = ------ and ------ = -----a1
a2
a2
a3
ta dng lnh: [> line(d,[point(M,2,3,4),[3,2,1]],t);

3) ng thng d c dng tng qut:
gi s c 2 mt phng P1 v P2, c cho bi hai phng trnh mt phng:
"{[[a1.x+b1.y+c1.z+d1=0,],[a2.x+b2.y+c2.z+d2=0,]]"
Ta khai bo hai mt phng P1, P2 bi cc lnh:
[> plane(P1,[a1.x+b1.y+c1.z+d1=0,[x,y,z]);
[> plane(P2,[a2.x+b2.y+c2.z+d2=0,[x,y,z]);
45
Khi ng thng d l giao tuyn ca P1 v P2 c khai bo bi lnh:

[> line(d,[P1,P2]);
4) Khai bo vector: Mun nhp vector u=(x,y,z) ta dng lnh:
[> u:=([x,y,z]); hoc [> u := <x|y|z>;

hai lnh ny cho ta vector hng,
[> u:=<x,y,z>; lnh ny cho ta vector ct.

5) Tch c hng ca 2 vector: trc ht phi m gi lnh *> with(linalg); sau dng lnh
[> crossprod(u,v);
6) Tch v hng ca 2 vector:
[> dotprod(u,v); hoc [> dotprod(u,v,orthogonal);
7) Vector ch phng ca ng thng d:
[> ParallelVector(d);
8) Trc trong khng gian (ng thng c nh hng):[>
line(d, [x[1] + at, y[1] + bt, z[1] + ct], t)
d l tn ca trc, [
x[1]
+at,
y[1]
+bt,
z[1]
+ct] l phng trnh trc vit dng tham s, t l tham s.
Mt phng
Mt phng trong maple c khai bo vi cc lnh nh sau:
46
S th t
Lnh
Chc nng
1
[> plane(P, [A,n],[x,y,z]);
Mt phng P, i qua im A v c vector php tuyn n.
2
[> plane(P, [d1,d2]);
Mt phng P i qua 2 ng thng d1 v d2.
3
[>plane(P, [A,B,C]);
Mt phng P i qua 3 im A, B, C.
4
[> plane(P, [A,d1,d2]);
Mt phng P i qua im A v song song vi 2 ng thng d1 v d2.
5
[>plane(P, ax+by+cz+d=0);
Mt phng P c phng trnh l ax+by+cz+d=0.
6
[> parallel(P, M, alpha);
Mt phng P i qua im M v song song mt phng alpha.
7
"[> NormalVector(P);"
Tm vector php tuyn ca mt phng P.
8
47
TAM GIC
1) Tam gic bit ba nh l A, B, C: [> triangle(T,[A,B,C]);
2) Tam gic bit phng trnh 3 cnh a,b,c: [> triangle(T,[a,b,c], [x,y,z]);
Nu cc trc l u,v,w th thay [x,y,z] bi [u,v,w]
MT CU
1) Mt cu i qua 4 im A, B, C, D: [> sphere(S,[A,B,C,D], n, `centername`=J);
Trong :
-) S l tn ca mt cu.
-) n=[x,y,z] -tn cc trc ta
-) J l tn tm mt cu.
2) Mt cu c ng knh l AB, vi A v B l hai im: [> sphere(S,[A,B], n, `centername`=J);
3) Mt cu c tm J v bn knh r: [> sphere(S,[J,r], n, `centername`=J);
J l tn ca tm.
4) Mt cu c tm J v tip xc mt phng P: [> sphere(S,[J,P], n, `centername`=J);
J l tn ca tm.
5) Cc yu t lin quan n mt cu:
a) Tip din P ti A ca mt cu S: [> TangentPlane(P,A,S);
b) Phng tch ca im M i vi mt cu S: [> powerps(M,s);
c) Mt ng phng P ca hai mt cu
S[1]
v
S[2]
: [> RadicalPlane(P,
48
S[1]
,
S[2]
);
d) Trc ng phng d ca ba mt cu: [> RadicalLine(d, s1, s2, s3);
e) Tm ng phng J ca 4 mt cu: [> RadicalCenter(J, s1, s2, s3, s4);
f) Tnh bn knh mt cu S: [> radius(S);
g) Tm tm mt cu S: [> center(S);
KHI A DIN
1) Khi t din bit bn nh A, B, C, D: [> gtetrahedron(Ten, [A,B,C,D]);
2) Khi t din bit bn mt: [> gtetrahedron(Ten, [
P[1], P[2], P[3], P[4]
]);
3) Hnh hp ch nht: [> parallelepiped(ten,[
d[1], d[2], d[3]
]);
d[1], d[2], d[3]
l 3 cnh xut pht t mt nh.
CC PHP BIN HNH TRONG KHNG GIN
1) Php t nh tin: N l nh ca M qua php t nh tin theo vector
"(AB: )"
[> translation(N,M,AB;
Ch : AB l on thng c hng.
2) Php i xng:
49
a) Qua ng thng: N l nh ca N ca php i xng qua mt phng P:

[> reflection(N,M,P);
b) Qua mt ng thng: N l nh ca M ca php i xng qua ng thng l:
[> reflection(N,M,l);
c) Qua mt tm: N l nh ca M ca php i xng qua tm C:
[> reflection(N,M,C);
3) Php quay: N l nh ca M qua php quay vi gc quay , trc quay l l:
*> rotation(N, M, , l);
Ch : gc quay c th m, c th dng; trc quay l l ng thng c hng.
4) Php v t: N l nh ca M qua php v t tm C, t s k:
[> homothety(N,M,k,C);
5) Php chiu vung gc:
a) Chiu im A ln ng thng l, im nh l Q: [> projection(Q, A, l);
b) Chiu im A ln mt phng P, im nh l Q: [> projection(Q, A, P);
c) Chiu on thng l (hoc ng thng l) ln mt phng P, nh l d: [>projection(d, l, P);
TM GIAO CA CC I TNG HNH HC
1) [> intersection(Tn, l[1], l[2]);
Tm giao ca hai ng thng, kt qu l im nu chng ct nhau, ngc li l "Null"
2) [> intersection(Tn, P[1], P[2]);
Tm giao ca hai mt phng, kt qu l ng nu chng ct nhau, ngc li l "Null"
3) [> intersection(Tn, l, P);
Tm giao ca ng thng v mt phng, kt qu l im nu chng ct nhau, ngc li l "Null"
4) [> intersection(Tn, l, S);
Tm giao ca ng thng v mt cu, kt qu l im nu chng ct nhau, ngc li l "Null"
5) [> intersection(Tn, P[1], P[2],P[3]);
50
Tm giao ca ba mt phng, kt qu l ng nu chng ct nhau, ngc li l "Null"

TNH GC
1) [> FindAngle(l[1],l[2]); Tnh gc ca hai ng thng ct nhau.
2) [> FindAngle(P[1],P[2]); Tnh gc ca hai mt phng ct nhau.
3) [> FindAngle(S[1],S[2]); Tnh gc ca hai mt phng ct nhau.
4) [> FindAngle(l,P); Tnh gc ca ng thng v mt phng ct nhau.
5) [> FindAngle(A,T); Tnh gc A ca tam gic T.
KHONG CCH
Nhm lnh v khong cch c tnh trong maple
STT
Lnh
Chc nng
Ch thch
1
[> distance(A,B)
Khong cch gia hai im A v B
2
[> distance(l1,l2)
Khong cch gia hai ng thng l1 v l2
ng thng vit dng tham s
3
[> distance(P1,P2)
Khong cch gia hai mt phng P1 v P2
51
4
[> distance(A,P)
Khong cch t im A n mt phng P
5
[> distance(A,l)
Khong cch t im A n ng thng l
6
[> distance(l,P)
Khong cch t ng thng l n mt phng P
>
1.8. Nhm lnh kim tra
Nhm lnh kim tra bt u bng Are hoc Is dng kim tra tnh ng hoc sai ca mt tnh cht no
.
S th t
Lnh
Chc nng
1
[> AreConcurrent (P,Q,R, cond);
Kim tra tnh thng hng ca 3 im P, Q, R.
2
[> ArePrallrel (l1,l2,cond);
Kim tra tnh song song ca hai ng thng l1, l2.
52
3
[> Areconcurrent(l1,l2,l3,cond);
Kim tra tnh ng quy ca 3 ng thng l1, l2, l3.
4
[> ArePerpendicular(l1,l2,cond);
Kim tra tnh vung gc ca hai ng thng l1, l2.
5
[> ArePerpendicular(l,P,cond);
Kim tra tnh vung gc ca ng thng l vi mt phng P.
6
[> ArePerpendicular(P1,P2,cond);
Kim tra tnh vung gc ca hai mt phng P1 v P2.
7
[> AreCoplanar(A,B,C,D)
Kim tra tnh ng phng ca bn im A,B,C,C
8
[> AreCoplanar(l1,l2)
Kim tra tnh ng phng ca hai ng thng
9
[> AreParallel(l1,l2)
Kim tra tnh song song ca hai ng thng l1 v l2
10
[> AreParallel(P1,P2)
Kim tra tnh song song ca hai mt phng P1 v P2
11
53
[> AreParallel(l,P)
Kim tra tnh song song ca ng thng l v mt phng P
12
[> IsOnCircle(A,c,cond);
Kim tra xem im A c thuc ng trn c hay khng?
13
[> IsOnline(A,l,cond);
Kim tra xem im A c thuc ng thng l hay khng?
14
[> IsRightTriangle(ABC,cond);
Kim tra tnh vung ca tam gic c tn l ABC
IM TRONG CA A GIC LI
BI TON
Khi gii bi ton hnh hc i khi ta gp khi nim im M nm trong mt hnh
no , chng hn, im M bn tronggc xOy, im M bn trong tam gic
ABC...Gp nhng trng hp nh th ny, ngi ta thng v im Mmt cch
trc gic.
Vy khi nim chnh xc im trong l g? Lm th no bit im M trong hay
ngoi mt hnh F
54
Nu hnh Fl hnh trn hay hnh elip, c iu kin cn v kt lun im M

thuc hay khng thuc hnh F. Tuy nhin, trng hp F l mt a gic, khng nh
im M thuc hay khng thuc a gic l bi ton
Trong khun kh Lun vn ny ta gi thit hnh F l mt a gic li, c nh
ngha nh sau:
nh ngha:a gic F c gi l li, nu mi on thng AB c hai u mt
thuc bin ca a gic F th c on thng AB thuc a gic F.
Bi ton:Trn mt phng cho mt a gic li v im M. Hy kim tra xem im
Mc thuc min trong ca a gic hay khng?
LI GII
Trc ht ta c nhn xt: im M thuc min trong ca a gic, nu tn ti mt
on thng cha im M v c hai u mt thuc bin ca a gic.
Gi s n nh ca a gic cho
Ta thc hin cc bc sau y:
i) Vit phng trnh cc cnh ca a gic
ii) Vit phng trnh ng thng i qua nh no (nh
chng hn) v qua
M, gi s ng thng ny ct bin ca a gic ti im B.

iii) Kim tra im M c thuc on
?
Nu im M thuc on
v khng l mt trong hai u mt, th M l im
trong a gic; nu M l mt trong hai u mt th M l im trn bin; nu M

thuc phn ko di ca
th M l im ngoi ca a gic
Nhp d liu
>
>
> n:=6:
> a:=[1,2,5/2,2,1,1/2];
b:=[0,0,sqrt(3)/2,2*sqrt(3)/2,2*sqrt(3)/2,sqrt(3)/2];
55
>
point(M,[2,0.5]),point(A0,[0,0]),point(A1,[a[1],b[1]]),
point(A2,[a[2],b[2]]),point(A3,[a[3],b[3]]),point(A4,[a
[4],b[4]]),point(A5,[a[5],b[5]]),point(A6,[a[6],b[6]]);
>
segment(A0A1,[A0,A1]),segment(A1A2,[A1,A2]),segment(A2A
3,[A2,A3]),segment(A3A4,[A3,A4]),segment(A4A5,[A4,A5]),
segment(A5A6,[A5,A6]),segment(A6A1,[A6,A1]);
> segment(A1M,[A1,M]),line(d,[A1,M]),line(l34,[A3,A4]);
> intersection(N, l34, d);segment(MN,[M,N]);
> draw([M,N,A1M,MN,
A1A2,A2A3,A3A4,A4A5,A5A6,A6A1],printtext=true,title="A
GIC");
56
>
Phng trnh tham s cc cnh a gic

> for i to n-1 do
print(`Phuong trinh tham so canh [`,i,i+1,`]`);
x[i,i+1] := t[i,i+1]*a[i]+(1-t[i,i+1])*a[i+1];
y[i,i+1] := t[i,i+1]*b[i]+(1-t[i,i+1])*b[i+1];
`------------------------------------`
end do;
print(`Phuong trinh tham so cua duong thang A1M`);
x:= (1-t)*a[1]+t*HorizontalCoord(M);
y:= (1-t)*b[1]+t*VerticalCoord(M);
57
>
Gii h phng trnh tm giao im ca ng thng
gic. H phng trnh cho nghim t v
vi cc cnh
Nu h phng trnh cho nghim t>1, chng t

58
ca a
im M l im trong ca on thng
. T suy ra im M l im trong ca a gic.
Nu t=1, suy ra im M thuc bin a gic. Nu t<1, chng t im M l im ngoi a ic.

>
for i from 2 to n-1 do
if 1=1 then
Delta[i]:=a[i]*VerticalCoord(M)-HorizontalCoord(M)*b[i]:
end if;
if (Delta[i]<>0) then
N[i]:=solve({(1-t)*a[1]+t*HorizontalCoord(M)=t[i,i+1]*a[i]+(1t[i,i+1])*a[i+1],(1-t)*b[1]+t*VerticalCoord(M)=t[i,i+1]*b[i]+(1t[i,i+1])*b[i+1]},{t,t[i,i+1]});
end if;
if (rhs(N[i][1])>1)and(rhs(N[i][2])>0)and (rhs(N[i][2])<1) then
print(N[i][1],N[i][2],`Delta[`,i,`]=`,Delta[i]);
print(` IM M L IM TRONG A GIC`);
end if;
end do;
>
59
T GIC Y
> restart:with(geometry):with(student):
BI:
T gic y l t gic c cc cp cnh i ct nhau. T gic y c nhiu

tnh cht hay. Trong bi ny ta kim tra mt s tnh cht nh Maple.
a) ABCD l t gic y (c th li hoc lm), E l giao im ca hai ng
thng AB v CD;F l giao im ca AC v BD. M1, M2 v M3 ln lt l trung
im ca AC, BD v EF; khi M1, M2 v M3 thuc mt ng thng, k hiu
ng thng ny l l1.
b) Trc tm cc tam gic ABF, DCF, BCE, ADE thuc mt ng thng, k hiu
ng thng ny l l2.
c) Chng minh rng l1 vung gc vi l2.
d) Bn ng trn ngoi tip bn tam gic ABF, DCF, BCE, ADE ng quy ti
im J.
e) Bn tm ng trn d) v im J thuc mt ng trn.
LI GII:
>
point(A,[0,0]),point(B,[2,0]),point(C,[4,2]),point(D,[1
,5]);
>
line(d1,[A,B]),line(d2,[B,C]),line(d3,[C,D]),line(d4,[D
,A]);
> intersection(E,d2,d4),intersection(F,d1,d3);
line(d5,[E,F]),line(d6,[B,D1]);
segment(AB,[A,B]),segment(BC,[B,C]),segment(CD1,[C,D]),
segment(DA,[D,A]);
segment(AC,[A,C]),segment(EF,[E,F]),segment(BD,[B,D]);
segment(AE,[A,E]),segment(EB,[E,B]),segment(BF,[B,F]),s
egment(FC,[F,C]);
60
>
midpoint(M1,AC),midpoint(M2,BD1),midpoint(M3,EF);segmen
t(M1M2,[M1,M2]),segment(M2M3,[M2,M3]),segment(M1M3,[M1,
M3]);
Kim tra tnh thng hng ca 3 im M1, M2, M3

> AreCollinear(M1,M2,M3);line(l1,[M1,M2]);
>
triangle(ABE,[A,B,E]),triangle(BCF,[B,C,F]),triangle(AD
1F,[A,D,F]),triangle(CDE,[C,D,E]);
orthocenter(H1,ABE),orthocenter(H2,BCF),orthocenter(H3,
ADF),orthocenter(H4,CDE);
segment(H1H2,[H1,H2]),segment(H2H3,[H2,H3]),segment(H3H
4,[H3,H4]),segment(H1H4,[H1,H4]);
>
> AreCollinear(H1,H2,H3,H4);line(l2,[H3,H2]);
Kim tra s vung gc ca l1 v l2

>
Bn ng trn ngoi tip bn tam gic:
>
circle(C1,[A,B,E],[x,y]):circle(C2,[B,C,F],[x,y]):circl
e(C3,[A,D1,F],[x,y]):circle(C4,[C,D1,E],[x,y]):
Equation(C1):
61
Kim tra tnh ng quy ca 4 ng trn

>
solve({Equation(C1),Equation(C2),Equation(C3),Equation(C
4)},{x,y});
>
draw([AB(color=green),BC(color=green),CD1(color=green),
D1A(color=green),AE(color=green),EB(color=green),
BF(color=green),FC(color=green),AC(color=blue),
BD1(color=blue),EF(color=blue),M1(color=red),M2(color=r
ed),
M3(color=red),M1M2(color=red),M2M3(color=red),
M1M3(color=red),H1H2(color=red),H2H3(color=green),C1,C2
,C3,C4
],#axes=none,
printtext=true,
title="T GIC Y ");
62
TNH DIN TCH A GIC BT K

BI: Trn mt phng cho n im
, ni cc im
theo th t ta c a gic li hoc lm. Hy tnh din tch a

gic
LI GII
nh ngha: a gic
th t
) Tra ttc O
c gi l nh hng dng, nu i theo
s thy min a gic pha tay tri.

vi O l gc ta . Gi s ta cc im
, khi din tch tam gic
c tnh bi cng
thc:
Ch rng vi cng thc ny din tch tam gic c th nhn gi tr dng hoc
m, ty theo tam gic c nh hng dng hay m.
Khi din tch ca a gic
...
c tnh theo cng thc (xem [4], trang
14).
Nhn xt: Cng thc nhn c trn ng vi a gic li v lm khng t ct.

CHNG TRNH TNH DIN TCH A GIC
> restart:with(student): with(geometry):
n:=1000:
63
################################################################
#####
for i from 1 to n do
a[i]:=i;
b[i]:=i^2;
end do:
#a[1]:=2:
#a[2]:=4:
#a[3]:=6:
#a[4]:=8:
#a[5]:=10:
#a[6]:=9:
#a[7]:=7:
#a[8]:=5:
#a[9]:=3:
#a[10]:=1:
#b[1]:=1:
#b[2]:=4:
#b[3]:=9:
#b[4]:=16:
#b[5]:=25:
#b[6]:=7:
#b[7]:=5:
#b[8]:=5:
#b[9]:=3:
#b[10]:=1:
################################################################
L:=[seq(dt[i],i=1..n-1)]:
for i to n-1 do
dt[i] := evalf((a[i]*b[i+1]-a[i+1]*b[i])*(1/2));
end do:
##########################################################
Dt:=add(dt[i],i=1..n-1);
S:=evalf(Dt-(a[1]*b[n]-a[n]*b[1])*(1/2));
>
>
64
THUT TON KIM TRA TNH LI CA A

GIC
A GIC LI
a gic li l i tng quan trng ca hnh hc, trong hu ht cc a gic m ton
hc nghin cu l a gic li, nh hnh tam gic, hnh thang, hnh bnh hnh,...
Tnh li ca a gic khng nhng ch c ngha trong hnh hc phng m cn c
trong hnh hc khng gian, chng hn nh: hnh chp, chp ct l li khi v ch khi
a gic y ca n l a gic li. iu ny vn cn ng cho hnh lng tr.
KIM TRA TNH CHT LI CA A GIC

nh ngha: a gic li l a gic m nu ta ko di bt c cnh ca n th
ton b a gic thuc v mt na mt phng c b l cnh ko di .
a gic lm l a gic khng li, hay ni cch khc l, tn ti mt cnh nu
ta ko di cnh th a gic thuc v c hai na mt phng c b l cnh
ko di .
BI TON:Trn mt phng cho n im A[1], A[2],...,A[n], vi ta tng ng
l (a[i],b[i]), i=1..n. Cn kim tra tnh cht li ca a gic A[1]A[2]...A[n].
LI GII
) NhHai im M(x1, y1) v N(x2, y2) cng mt pha ca ng thng
ax+by+c=0, nu v ch nu tha mn iu kin
(ax1+by1+c).(ax2+by2+c)>0.
2) Lp mt danh sch a:=[a[1], a[2],..., a[n], a[1]] v mt danh sch b= [b[1],
b[2],..., b[n], b[1]] .
3) Vit phng trnh ng thng cc cnh l[i,i+1]ca a gic i qua 2 nh lin
tip A[i] v A[i+1], ring ng thng cui cng k hiu l l[n,1] i qua hai
nh A[n] v A[1]. Gi s cc ng thng c dng:
l[i,i+1]:=m[i]x[j]+n[i].y[j]+c[i]=0, j=1..n.
-) Tnh cc i lng d[j,i]=m[i]x[j]+n[i].y[j]+c[i], j=1..n.
Nu tn ti i0 v tn ti j0 v j1 sao cho d[j0,i0].d[j1,i0]<0, chng t c hai nh
thuc v hai pha ca ng thng l[i0,i0+1], t kt lun a gic cho l a
gic lm.
V a gic
Nhp a gic:
65
C nhiu cch xc nh mt a gic, nhng c 2 cch thng dng nht thng

c s dng, l:
-) Cho tp hp ta cc nh.
-) Cho phng trnh ng thng cha cc cnh ca a gic.
>
>
> n:=8:
> a:=array(1..n);b:=array(1..n);
> a:=[1,3,2,-2,-3,-3,-2,2,3];b:=[0,2,3,3,2,-2,-3,-3,-2];
> A[1]:=point(A1,[a[1],b[1]]):
A[2]:=point(A2,[a[2],b[2]]):
A[3]:=point(A3,[a[3],b[3]]):
A[4]:=point(A4,[a[4],b[4]]):
A[5]:=point(A5,[a[5],b[5]]):
A[6]:=point(A6,[a[6],b[6]]):
A[7]:=point(A7,[a[7],b[7]]):
A[8]:=point(A8,[a[8],b[8]]):
66
>
segment(A1A2,[A[1],A[2]]),segment(A2A3,[A[2],A[3]]),seg
ment(A3A4,[A[3],A[4]]),segment(A4A5,[A[4],A[5]]),
segment(A5A6,[A[5],A[6]]),segment(A6A7,[A[6],A[7]]),seg
ment(A7A8,[A[7],A[8]]),segment(A8A1,[A[8],A[1]]):
>
draw([A1A2,A2A3,A3A4,A4A5,A5A6,A6A7,A7A8,A8A1],printtex
t=true,title="A GIC");
Kim tra tnh cht li ca a gic

> for i to n do
l[i]:=(b[i+1]-b[i])*x-(a[i+1]-a[i])*ya[i]*b[i+1]+a[i+1]*b[i]:
end do:
> n:=8:
lom := 0;
for i to n do
67
duong := 0: am := 0:
for j to n do
d[j] := evalf(subs(x = a[j],y = b[j],l[i]));
if d[j] > 0 then duong := duong+1;
elif d[j] < 0 then am := am+1;
end if;
end do:
if (duong+am>0)and( duong*am>0) then
lom := lom+1;break;
end if;
end do:
if lom > 0 then print(À GIC CHO L LM`);
else print(À GIC CHO L LI`);
end if;
>
68
KIM TRA TNH LI CA A GIC

C nhiu tiu chun khng nh mt a gic l li hay lm, bi trc ta
s dng nh ngha truyn thng v a gic li. Trong bi ny, ta s dng
mt tiu chun khc a gic li, l:
iu kin cn v a gic li l mi gc trong ca n nh hn .
p dng tiu chun trn, ta c thut ton kim tra tnh li ca mt a gic khi
bit ta cc nh
> restart: with(student):with(geometry):
NHP TA CC NH
> n:=8:
a:=array[1..n]:
> a:=[1,2,3,3,2,1,0,0,1];
b:=[0,0,1,2,3,3,2,1,0];
V D V A GIC LI
V a gic
>
[3],b[3]]),point(A4,[a[4],b[4]]),point(A5,[a[5],b[5]]),
[8],b[8]]);
>
4,[A3,A4]),segment(A4A5,[A4,A5]),
8,[A7,A8]),segment(A8A1,[A8,A1]):
>
69
>
Khng gim tnh tng qut, ta gi s a gic c hng dng, khi xut
pht t nh A[1], i ti cc nh A[2]...A[n], v cui cng v A[1]. Khi i t
cnh A[i-1]A[i] sang cnh A[i]A[i+1], ta phi quay mt gc [i]. Khi ba
mnh sau y l tng ng:
i) Gc
tha mn bt ng thc 0<[i]<.
ii) sin[i]>0.
iii) [i]=u[i].v[i+1]-u[i+1].v[i]>0,
y (u[i], v[i]) v (u[i+1], v[i+1]) l ta cc vector A[i-1]A[i] v
A[i]A[i+1].
Sau y ta s dng iii) kim tra tnh li ca a gic.
Ta c mnh : iu kin cn v a gic li l mi gc trong ca n nh
hn .
Tnh ta cc vector cnh ca a gic:
>
for i to n-1 do
u[i]:=a[i+1]-a[i]:
70
v[i]:=b[i+1]-b[i]:
end do;
u[n]:=a[1]-a[n];
v[n]:=b[1]-b[n];
Xt du cc [i], nu [i]>0 vi mi i=1..n th a gic li

> dem:=0:
for i to n-1 do
Delta[i]:=evalf(u[i]*v[i+1]-u[i+1]*v[i]);
if Delta[i]>0 then dem:=dem+1;
print(dem);
71
end if;
end do;
Delta[n]:=evalf(u[n]*v[1]-u[1]*v[n]);
if Delta[n]>0 then dem:=dem+1; end if;
if dem=n then
print(À GIC CHO L A GIC LI`);
else print(À GIC CHO L A GIC LM`);
end if;
72
>
################################################################
##################
################################################################
###################
################################################################
####################
V D V A GIC LM
> n:=8:
a:=array[1..n]:
> a:=[1,2,1,3,2,1,0,0,1];
b:=[0,0,1,2,3,3,2,1,0];
>
V a gic
>
[3],b[3]]),point(A4,[a[4],b[4]]),point(A5,[a[5],b[5]]),
[8],b[8]]);
>
4,[A3,A4]),segment(A4A5,[A4,A5]),
8,[A7,A8]),segment(A8A1,[A8,A1]):
>
73
>
Khng gim tnh tng qut, ta gi s a gic c hng dng, khi xut
pht t nh A[1], i ti cc nh A[2]...A[n], v cui cng v A[1]. Khi i t
cnh A[i-1]A[i] sang cnh A[i]A[i+1], ta phi quay mt gc [i]. Khi ba
mnh sau y l tng ng:
i) Gc
tha mn bt ng thc 0<[i]<.
ii) sin[i]>0.
iii) [i]=u[i].v[i+1]-u[i+1].v[i]>0,
y (u[i], v[i]) v (u[i+1], v[i+1]) l ta cc vector A[i-1]A[i] v
A[i]A[i+1].
Sau y ta s dng iii) kim tra tnh li ca a gic.
Ta c mnh : iu kin cn v a gic li l mi gc trong ca n nh
hn .
Tnh ta cc vector cnh ca a gic:
>
for i to n-1 do
u[i]:=a[i+1]-a[i]:
74
v[i]:=b[i+1]-b[i]:
end do;
u[n]:=a[1]-a[n];
v[n]:=b[1]-b[n];
Xt du cc [i], nu [i]>0 vi mi i=1..n th a gic li

> dem:=0:
for i to n-1 do
Delta[i]:=evalf(u[i]*v[i+1]-u[i+1]*v[i]);
if Delta[i]>0 then dem:=dem+1;
print(dem);
75
end if;
end do;
Delta[n]:=evalf(u[n]*v[1]-u[1]*v[n]);
if Delta[n]>0 then dem:=dem+1; end if;
if dem=n then
print(À GIC CHO L A GIC LI`);
else print(À GIC CHO L A GIC LM`);
end if;
76
TRC NG PHNG-TM NG
PHNG
Trong Maple c sn cc lnh tm trc ng phng ca hai ng trn v tm tm ng
phng ca 3 ng trn. Trong bi ny chng ta xy dng trc ng phng v tm ng
phng t cc lnh n gin ca Maple.
TRC NG PHNG CA 2 NG TRN

> Trucdangphuong := proc(a1,b1,c1,a2,b2,c2,a3,b3,c3)
local x,y,vt, L:=[op(L),vt[3]],truc12,truc23,truc31,N;
description "add a list of numbers and multiply by a
constant";
> vt[1]:=x^2+y^2-2*a1*x-2*b1*y+c1;
> vt[2]:=x^2+y^2-2*a2*x-2*b2*y+c2;
vt[3]:=x^2+y^2-2*a3*x-2*b3*y+c3;
if ((a1=a2) and (b1=b2))then print(`hai ng trn vt1 v vt2
ng tm, khng c trc ng phng`);
else
print(`Trc ng phng ca hai ng trn vt1 v vt2 l`,vt[1]vt[2]):
end if;
else
end if;
else
end if;
truc12:=vt[1]-vt[2];
print(` Tm ng phng ca ba ng trn l `);
N:=solve({truc12,truc23,truc31},{x,y});
end proc:
77
> Trucdangphuong(0,0,-9,0,4,-16,7,0,4);
>
>
T GIC NI TIP
BI:
Cho 4 ng trn O1, O2, O3, O4. Bit rng O1 tip xc vi O2 ti M12, O2 tip xc vi O3 ti
M23,O3 tip xc vi O4 ti M34,O4 tip xc vi O1 ti M41. Chng minh rng 4 im M12,
M23, M34, M41 thuc mt ng trn.
LI GII:
> HaiDuongTron:= proc(a1,b1,R1,a2,b2,R2)
local x,y;
description "add a list of numbers and multiply by a constant";
point(C1,[a1,b1]); point(C2,[a2,b2]);
circle(vt1, [C1,R1],[x, y]);circle(vt2, [C2,R2],[x, y]);
intersection(M12,vt1, vt2);
end proc:
> HaiDuongTron(0,0,1,3,0,2);
> M12;
78
>
>
THUT TON KIM TRA TNH N CA A

GIC
KIM TRA TNH CHT N CA A GIC
nh ngha: a gic n l a gic khng c hai cnh no ct nhau. a
gic khng n (cn gi l a gic t ct) l a gic tn ti mt cp cnh
ct nhau.
Ch : Cnh ca a gic l on thng c hai u mt l hai nh lin tip ca a
gic, ch khng phi ng thng cha cnh . V vy, khi nim hai cnh ct
nhau phi hiu l hai on thng ct nhau.
BI TON:Trn mt phng cho n im A[1], A[2],...,A[n], vi ta tng ng
l (a[i],b[i]), i=1..n. Cn kim tra ng gp khc khp kn A[1]A[2]...A[n]A[1]
c t ct hay khng?
LI GII
1) Lp mt danh sch a:=[a[1], a[2],..., a[n], a[1]] v mt danh sch b= [b[1],
b[2],..., b[n], b[1]] .
) Vitr[i]A[i+1], rihng cm v
V a gic
Nhp a gic: Nhp tp hp ta cc nh. ca a gic. Gi s cho n
nh A1, A2,...An cng vi ta ca chng. tin cho vic lp trnh v
dau, ta lu honh vo mt danh sch a v lu tung vo danh sch b,
nhng mi danh sch c n+1 thnh phn, thnh phn th n+1 bng thnh
phn th 1. Ni r hn:
79
tng t nh vy, ta c danh
sch b cha cc tung ca cc nh, v cng c (n+1) phn t v phn t cui

cng bng phn t u tin.
> restart: with(student): with(geometry): n:=8;
> a:=[0,1,0,2.5,3,3,1,-1,0]; b:=[0,-1,4,1,3,4,4,1,0];
>
point(A1,[a[1],b[1]]),point(A2,[a[2],b[2]]),point(A3,[a[3],b[3]]
),point(A4,[a[4],b[4]]),point(A5,[a[5],b[5]]),
point(A6,[a[6],b[6]]),point(A7,[a[7],b[7]]),point(A8,[a[8],b[8]]
);
>
segment(A1A2,[A1,A2]),segment(A2A3,[A2,A3]),segment(A3A4,[A3,A4]
),segment(A4A5,[A4,A5]),
segment(A5A6,[A5,A6]),segment(A6A7,[A6,A7]),segment(A7A8,[A7,A8]
),segment(A8A1,[A8,A1]):
>
draw([A1A2,A2A3,A3A4,A4A5,A5A6,A6A7,A7A8,A8A1],printtext=true,ti
tle="A GIC T CT"):
THUT TON KIM TRA TNH CHT T CT CA A GIC

PHNG TRNH THAM S CC CNH CA A GIC
for i to n-1 do
print(`Phuong trinh tham so canh A[`,i,i+1,`]`);
x[i,i+1]:=t[i,i+1]*a[i]+(1-t[i,i+1])*a[i+1];
y[i,i+1]:=t[i,i+1]*b[i]+(1-t[i,i+1])*b[i+1];
`------------------------------------`
end do;
>
>
LP H PHNG TRNH TM GIAO IM CC CNH CA A GIC

> for i to n do
80
for j from i+2 to n do

print(x[i, i+1] = x[j, j+1], y[i, i+1] = y[j, j+1])
end do;
print(`----------------------------------------`)
end do;
GII H PHNG TRNH TM GIAO IM CC CNH CA A GIC
T CT
> for i to n do
for j from i+2 to n do
N := solve({x[i,i+1] = x[j,j+1], y[i,i+1] = y[j,j+1],0
< t[i,i+1],0 <
t[j,j+1],t[i,i+1]<1,t[j,j+1]<1},{t[i,i+1],t[j,j+1]});
print(N);
end do:
end do:
>
>
ELIP
BI:
Tm qu tch cc im m t k c 2 tip tuyn ti elip v
vung gc vi nhau.
LI GII:
restart:with(geometry):with(student):
a:=2;b:=3;
E:=x^2/a^2+y^2/b^2=1:
>
> tt1:=A1*(x-xM)+B1*(y-yM)=0;tt2:=A2*(x-xM)+B2*(y-yM)=0;
> tt1:=expand(A1*(x-xM)+B1*(y-yM)=0);
tt2:=expand(A2*(x-xM)+B2*(y-yM)=0);
81
> pt1:=simplify(expand(A1^2*a^2+B1^2*b^2=(-A1*xM-B1*yM)^2));
pt2:=expand(A2^2*a^2+B2^2*b^2=(-A2*xM-B2*yM)^2);
pt3:=A1*A2+B1*B2;
> solve({pt1,pt2,pt3,A1>0},{A1,A2,B1,B2});
>
>
82
KT LUN
Cng nh mt s tc gi i trc, lun vn s dng cc lnh c sn ca Maple
gii cc bi ton hnh hc. Gip cho gio vin v hc sinh gii bi ton hnh hiu
qu hn.
Lun vn t c mt s kt qu sau:
-) nu mt vi bi ton m Maple cha gii, s dng cc lnh c sn ca Maple
gii chng, l:
i) Kim tra tnh li ca mt a gic.
ii) Tnh din tch mt a gic bt k.
iii) Kim tra mt im c thuc min a gic hay khng.
iv) Vit phng trnh mt phng phn gic ca nh din.
V thi gian c hn, tc gi vn cn mt s bi ton sau y cha thc hin c:
-) Kim tra tnh li ca khi a din.
-) Kim tra mt im thuc min trong ca mt a gic lm, khng t ct.
-) Dng thit din ca khi a din
-) S dng gi plots, plottools, draw gii bi ton qu tch.
Tc gi s c gng gii chng trong thi gian sm nht.
Lun vn cn nhiu hn ch, cha khai thc c nhiu th mnh ca Maple. Rt
mong s gp ca cc thy cc c v cc bn
83
TI LIU THAM KHO

[1] Phm Huy in,Phm Cnh Dng, T Duy Phng, Tnh ton, lp trnh &
Ging dy Ton hc trn Maple, NXB Khoa hc v K thut, H ni 2002.
[2] Trnh Thanh Hi, Gio trnh s dng phn mm h tr dy hc ton, Thi
Nguyn, 2005, www.mathvn.com.
[3] V Thanh Hiu, Sch in t Mn gii tch ton hc hm s mt bin, Lun
vn Thc s Ton hc, Trng i hc khoa hc-HTN, 2011.
[4] . , , , 1967. (Dch t nguyn bn ting c).
[5] http://boxmath.vn/4rum/f493/ti liu hng dn s dng maple bng ting vit
[6] http://www.maplesoft.com,
84
85

Sử Dụng Maple Giải Một Số Dạng Bài Toán Hình Học

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Sử Dụng Maple Giải Một Số Dạng Bài Toán Hình Học

Uploaded by

Copyright:

Available Formats

I HC THI NGUYN

S DNG MAPLE GII MT S

LUN VN THC S TON HC

THI NGUYN 2012

-) Lun vn ng gp mt phn nh trong vn dy hnh hc trong cc trng

Chng 1. GII THIU V MAPLE-16

MI TRNG TNH TON

Maple, c th bao gm cc i tng c bn ca Maplenh lnh, kt qu tnh

mi mc c th cha nhng on(paragraph) v nhng mc con(subsection).

ta c th m mt mc ra c hoc gi li khi c xong bng cch kch chut

ngang vi vi mc , sau s dng chc nng Insert Section. Mun thm

Siu lin kt (Hyperlink)

Mt s quy c, k hiu trong Maple

vit l exp(x), s e vit l exp(1); cn bc hai ca x vit

bng du hai chm th kt qu khng hin ra trn mn hnh, cn kt thc bng

cm x l c dng lnh ri nhn Enter.

Mi lnh c vit trn mt dng vi di ty , tuy nhin c th ngt

dng bng cch nhn t hp Ship+Enter.

LP TRNH TRN MAPLE

While <iu kin> do <dy lnh> end do;

Chc nng: Nu bn mun mt dy biu thc c thc hin khi iu kin no

Chc nng: Trong lc vng lp while/for ang c thc hin, nu lnh

nh c th trao i dng chung nhng gi chu trnh no y, phc v cho cng

Nh cp trc y, cc tn bin trong mt biu thc c Maple nh gi

Chng 2. HNH HC PHNG

Trng hp ring =1, ta c ta trung im:

"x= (x[1]+x[2] )/(2), y=(y[1]+y[2] )/(2)."

y = k(x - x[1]) + y[1]

ii) Phng trnh ng thng i qua hai im

----------- = ----------x[2] - x[1] y[2] - y[1]

A[2] x + B[2] y + C[2] = 0)

---- = ---- and ---- <> ---19

-) iu kin trng nhau ca

---- = ---- and ---- = ---A[2] B[2]

A[2] x + B[2] y + C[2] = 0

A[2] x + B[2] y + C[2] = 0

F[1]\-sqrt\a - b /, 0/, F[2]\sqrt\a - b /, 0/

F[1]\0, -sqrt\a - b //, F[2]\0, sqrt\a - b //

v) iu kin cn v ng thng Ax+By=C, tip xc elip:

i) Phng trnh chnh tc:

Trc thc l trc Ox, hai tiu im thuc trc thc, c ta

F[1]\-sqrt\a + b /, 0/, F[2]\sqrt\a + b /, 0/

iv) Phng trnh tip tuyn ca elip c tip im l

v) iu kin cn v ng thng Ax+By=C, tip xc elip:

vi) Hyperbol lin hp:

---- = ---- and ---- = ---- and ---- = 2 R

- Typesetting[delayDotProduct]\((2 b) . c) . cosA, b , true/ and

- Typesetting[delayDotProduct]\((2 b) . c) . cosA, b , true/ =

- Typesetting[delayDotProduct]\((2 c) . a) . cosB, c , true/ and

- Typesetting[delayDotProduct]\((2 c) . a) . cosB, c , true/ =

(Typesetting[delayDotProduct](EC . ED, FA, true)) . FC = FB .

2.4. TAM GIC V CC NG C BIT

2.4.2. CC NG C BIT TRONG TAM GIC

-) ng cao, c 2 cch khai bo:

-) Tm ng trn bng tip.

m tra tnh thng hng ca ba im A,B,C

-) Trong mt s trng hp phi dng lnh [> assume(logic);

HNH HC KHNG GIAN

"x= (x[1]+x[2] )/(2), y=(y[1]+y[2] )/(2),z=(z[1]+z[2] )/(2)."

i) Phng trnh ng thng i qua hai im

----------- = ----------- and ----------- = ----------x[2] - x[1] y[2] - y[1]

y[2] - y[1] z[2] - z[1]

-------- = -------- and -------- = -------a

#mover(mi("b"),mo("→")) = (b[1], b[2], b[3])