nhập môn phương pháp xác suất tiểu luận

Chapter 1.
Combinatorics and its
applications
1.3. Use the knowledges of

combinatorics to solve some problems
of geometric
lecter
Dr. Duong Xuan Giap
Department of Mathematics, College of Education, Vinh University
lecter Dr. Duong Xuan Giap Department of Mathematics, College of Education, Vinh University
Chapter 1. Combinatorics and its applications 1.3. Use the knowledges of combinatorics to solve some problems of geo
Example 1.3.1
Randomly select two points from the vertices of the
n-vertex (n ≥ 3) convex polygon. Calculate the prob-
ability to connect two selected points to get a diagonal
of a convex polygon?
Solution. Each diagonal is uniquely identified by a pair
of non-adjacent vertices of a convex polygon. Hence
there is a total of Cn2 − n ways to select the two
joined points that make up the diagonal of the polygon.
Therefore, the required probability is equal to
Cn2 − n
.
Cn2
Example 1.3.2
Given 20 points on a circle, how many polygons take
the points in 20 points as vertices?
Solution. A polygon can have 3 vertices, 4 vertices,
..., 20 vertices. Since the 20 vertices lie on a circle, no
3 points are collinear. Therefore, any point k produces
k - convex polygon. So there is a total of C20 3
+ C204
+
... + C20 polygons.
20
Example 1.3.3
How many parallelograms are formed when given m
(m ≥ 2) parallel lines intersected by n (n ≥ 2) another
parallel lines?
Solution. We notice that each parallelogram is defined
by 2 lines in the group of the first m parallel lines,
together with 2 lines in the group of the second n
parallel lines. Therefore, we infer that the number of
required parallelograms is
Solution. We notice that each parallelogram is defined
by 2 lines in the group of the first m parallel lines,
together with 2 lines in the group of the second n
parallel lines. Therefore, we infer that the number of
required parallelograms is Cm2 × Cn2.
Example 1.3.4
Ph¡t biºu v chùng minh b i to¡n sau b¬ng ti¸ng Anh:
Cho 4n gi¡c ·u. Chån ngü nhi¶n 4 iºm trong sè c¡c
¿nh cõa a gi¡c ·u. T½nh x¡c su§t º 4 iºm ÷ñc
chån t¤o th nh:
a) h¼nh vuæng?
b) tù gi¡c trong â câ 3 c¤nh cõa nâ l 3 c¤nh n o â
cõa a gi¡c ·u?
Question. Given a regular 4n-gon. Randomly choose
four of the vertices of regular polygon. Calculate the
probability to connect four selected points to get:
a) a quare?
b) a quadrilateral that its three sides are some three
sides of a given regular polygon?
Solution. a) Notice that each vertex will have 3 other
vertices forming a square (the two diagonals of the
square will be perpendicular at the center of the regular
polygon). Since each vertex will be counted 4 times like
that, there are n squares. So the required probability
is: n
4 .
C4n
b) Notice that if the three sides of a quadrilateral are
some three sides of regular 4n-gon, then they must be
consecutive. So we count the number of quadrilaterals
by counting the middle side of these consecutive three
sides. Thus, there are 4n quadrilaterals that satisfy all
problem's requirements. Thus, the required probability
is
4n
4 .
C4n
Example 1.3.5
Cho 2n-gi¡c ·u. Chån ngü nhi¶n 3 iºm trong sè
c¡c ¿nh cõa a gi¡c ·u. T½nh x¡c su§t º:
a) 3 iºm ÷ñc chån t¤o th nh mët tam gi¡c vuæng?
b) 3 iºm ÷ñc chån t¤o th nh mët tam gi¡c câ óng
mët c¤nh chung vîi c¤nh cõa a gi¡c ·u?
Question. Given a regular 2n-gon. Randomly choose
three of the vertices of regular polygon. Calculate the
probability to connect three selected points to get:
a) a right triangle?
b) a triangle whose exactly one side is the side of a
given regular polygon?
Solution.
Example 1.3.6
Chån ngü nhi¶n 3 iºm trong sè c¡c ¿nh cõa n-gi¡c
·u (n ≥ 4). T½nh x¡c su§t º 3 iºm ÷ñc chån n y
t¤o th nh mët tam gi¡c tò?
Question. Randomly choose three of the vertices of
regular n-gon (n ≥ 4). Calculate the probability of
the event that the selected points form the vertices of
an obtuse triangle.
Example 1.3.7
Cho n gi¡c lçi M. Chån ngü nhi¶n 3 ¿nh a gi¡c M.
T½nh x¡c su§t º 3 iºm ÷ñc chån t¤o th nh mët tam
gi¡c câ c¡c c¤nh ·u l ÷íng ch²o cõa a gi¡c M.
Solution. Câ t§t c£ Cn3 c¡ch chån 3 ¿nh.
Dòng ph÷ìng ph¡p gi¡n ti¸p (ph¦n bò). Do c¡c c¤nh
tam gi¡c l ÷íng ch²o cõa a gi¡c lçi n¶n c¡c ¿nh
cõa tam gi¡c l ¿nh cõa a gi¡c M. Gi£ sû ng÷ñc l¤i,
n¸u tam gi¡c khæng thäa m¢n y¶u c¦u.
n¸u tam gi¡c khæng thäa m¢n y¶u c¦u. Khi â, ta câ
2 tr÷íng hñp x£y ra:
Tr÷íng hñp 1: Câ óng 2 c¤nh l c¤nh a gi¡c lçi.
Khi â, 2 c¤nh â ph£i l 2 c¤nh li¶n ti¸p nhau cõa a
gi¡c lçi, do â nâ x¡c ành bði ¿nh ð giúa 2 c¤nh.
Khi â, 2 c¤nh â ph£i l 2 c¤nh li¶n ti¸p nhau cõa a
gi¡c lçi, do â nâ x¡c ành bði ¿nh ð giúa 2 c¤nh. Do
vªy, câ n tam gi¡c lo¤i n y.
Tr÷íng hñp 2: Câ óng 1 c¤nh l c¤nh cõa a gi¡c.
a gi¡c câ n c¤nh n¶n câ n c¡ch chån 1 c¤nh cõa tam
gi¡c. Câ n − 4 c¡ch chån ¿nh cán l¤i cõa tam gi¡c.
Vªy theo quy tc nh¥n, ta câ n(n − 4) tam gi¡c lo¤i
n y.
Vªy theo quy tc nh¥n, ta câ n(n − 4) tam gi¡c lo¤i
n y.
Tø â, câ Cn3 − n(n − 4) − n c¡ch chån 3 ¿nh t¤o
th nh mët tam gi¡c câ t§t c£ c¡c c¤nh ·u l ÷íng
ch²o cõa a gi¡c M. Do â, x¡c su§t c¦n t¼m l
Cn3 − n(n − 4) − n
.
Cn3
Example 1.3.8
Cho n gi¡c lçi thäa m¢n khæng câ 3 ÷íng ch²o n o
çng quy t¤i mët iºm. Câ bao nhi¶u tam gi¡c m c¡c
c¤nh cõa nâ n¬m tr¶n c¡c c¤nh ho°c c¡c ÷íng ch²o
cõa n gi¡c lçi ¢ cho?
Question. Let a convex n-gon such that no three diag-
onals have a common interior point. Find the number
of triangles whose sides lie on the sides or the diagonals
of the given convex n-gon.
Solution.L÷u þ r¬ng c¡c tam gi¡c c¦n t¼m câ c¡c ¿nh
khæng nh§t thi¸t l ¿nh cõa a gi¡c lçi.
Solution. L÷u þ r¬ng c¡c tam gi¡c c¦n t¼m câ c¡c ¿nh
khæng nh§t thi¸t l ¿nh cõa a gi¡c lçi. Ta chia c¡c
tam gi¡c c¦n t¼m th nh c¡c tr÷íng hñp sau:
Tr÷íng hñp 1: C£ 3 ¿nh ·u l ¿nh cõa a gi¡c lçi.
Tr÷íng hñp n y a gi¡c lçi câ n ¿nh, ta chån 3 ¿nh
s³ t¤o th nh tam gi¡c c¦n t¼m.
s³ t¤o th nh tam gi¡c c¦n t¼m. Do â câ Cn3 tam gi¡c.
Tr÷íng hñp 2: Câ óng 2 ¿nh l ¿nh cõa a gi¡c lçi.
Tam gi¡c lo¤i n y ÷ñc x¡c ành bði 4 ¿nh cõa a
gi¡c. Ng÷ñc l¤i, cù 4 ¿nh cõa a gi¡c s³ t¤o ra 4 tam
gi¡c c¦n t¼m.
gi¡c c¦n t¼m. Vªy câ 4Cn4 tam gi¡c.
gi¡c c¦n t¼m.
Tr÷íng hñp 4: Khæng câ ¿nh n o l ¿nh cõa a gi¡c
lçi.
lçi.
Tam gi¡c n y ÷ñc x¡c ành bði 6 ¿nh cõa a gi¡c.
Ng÷ñc l¤i, cù 6 ¿nh ch¿ t¤o th nh 1 tam gi¡c c¦n t¼m.
lçi.
Vªy câ Cn6 tam gi¡c.
lçi.
Vªy câ Cn6 tam gi¡c.
Vªy, sè tam gi¡c c¦n t¼m l : Cn3 + 4Cn4 + 5Cn5 + Cn6.

nhập môn phương pháp xác suất tiểu luận

Uploaded by

Document Information

Original Description:

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

nhập môn phương pháp xác suất tiểu luận

Uploaded by

Copyright:

Available Formats

Chapter 1.

Combinatorics and its

1.3. Use the knowledges of

Department of Mathematics, College of Education, Vinh University

You might also like