Makalah Teaching 1
Makalah Teaching 1
By
Dita Arianti (150311600204)
Dwi Rosi Nurani (150311600489)
Dwi Ujianti (150311600870)
DEPARTMENT OF MATHEMATICS
JANUARI 2019
PLAN OF LEARNING IMPLEMENTATION
Subject : Matematics
Grade/Semester : XII/II
A. Competency Standards:
B. Learning Objectives :
C. Materi Pembelajaran
Kaidah Pencacahan
Aturan Penjumlahan
Aturan penjumlahan digunakan untuk mengetahui banyaknya cara yang terdapat banyak
n1 cara pada kejadian pertama dan n2 cara pada kejadian kedua . Banyaknya cara
keseluruhan adalah n1
Contoh Penerapan Aturan Penjumlahan adalah:
Berapa banyak cara keseluruhan jika akan menggunakan baju jika mempunyai lengan
pendek dan 17 baju lengan panjang.
Banyak cara menggunakan baju adalah 8 + 17 = 25 cara
Aturan Perkalian
Aturan perkalian digunakan untuk mengetahui banyaknya cara yang dapat digunakan
jika terdapat n1 cara pada kejadian pertama dan masing-masing kejadian pada kejadian
pertama memiliki sebanyak n2 cara. Banyaknya cara keseluruhan adalah n1 × n2.
Permutasi dan Kombinasi
Permutasi
Permutasi adalah pengaturan sejumlah berhingga objek tanpa pengulangan, yang dipilih
dari sejumlah berhingga objek lain yang lebih besar atau sama banyak dari objek yang
diatur.
Notasi Faktorial
Simbol m! dengan m bilangan asli, dibaca “m faktorial” digunakan untuk menyatakan
perkalian dari m bilangan asli pertama, yaitu
m! = 1.2.3…m = 1 x 2 x 3 x … x m
a. 5! = 1.2.3.4.5.= 120
b. 3! (7-5)! 3!.2! = 6.2 = 12
4! 1.2.3.4 24
c. 24
0! 1 1
d. Penugasan kepada 4 karyawan untuk mengemudikan 3 kendaraan dapat dilakukan
dengan 24 cara. Jika dikaitkan dengan informasi soal ini dan notasi faktorial maka
4! 4! 1.2.3.4
diperoleh 24
(4 3)! 1! 1
Teorema 2.1
Banyaknya permutasi dari n objek diambil r unsur pada suatu saat adalah
n!
nPr =
(n r )!
Permutasi dengan pengulangan adalah permutasi dari n objek diambil r tetapi dari n
objek tersebut ada beberapa yang terulang.
Teorema 2.2
Teorema 2.3
Sampel Terurut
Jika sebuah bola diambil dari wadahnya sebanyak r kali maka yang dipilih adalah
sampel terurut berukuran r.
n.n.n … n = nr
n!
nPr = n(n-1) (n-2) … (n – r + 1) =
(n r )!
Kombinasi
Teorema 2.3
Banyaknya kombinasi dari n objek diambil r unsur pada suatu saat adalah
n Pr n!
nCr =
r! r!(n r )!
n
Kombinasi nCr = C(n r) atau
r
Fundamental Principles of Counting
Example :
The Rule of Product : If a procedure cen be broken down into first and
second stages, and if there are 𝒎possible outcomes for the first stage
and if, for each of these outcomes, there are 𝒏 possible outcomes for
the second stage, then the total procedure can be carried out, in the
designated order, in 𝒎𝒏 ways
Example :
1) The drama club of Central University is holding tryouts for a sping play. Whit
six men and eight women auditioning for the leading male and female roles, by
the rule of product the director can cast his leading couple in 6 × 8 = 48 ways
2) In trying to reach a decision on plant expansion, an administrator assigns 12 of
the employees to two committees. Committee A consist of five members and is
to investigate possible favorable results form such an expansion. The other seven
employees, committe B, will scrutinize possible unfavorable repercussions.
Should the administrator decide to speak to just one committee member before
making her decision, then by the rule of sum there are 12 employees she can call
upon for input. However, to be a bit more unbiased, she decides to speak with a
member of committee A on Monday, and then whit a member of commuttee B
on Tuesday, before reaching a decision. Using the following principle, we find
theat she can select two such employees to speak with in 5 × 7 = 35 ways.
3. Permutations
Continuing to examine applications of the rule of product, we turn now to counting
linear arrangements of objects. These arrangements are often called permutations
when the objects are distinct.
Definition 1
𝟎! = 𝟏
Definition 2
Banyaknya permutasi dari n objek diambil r unsur pada suatu saat adalah
n!
nPr =
(n r )!
Example :
1. In how many ways can we selesct three students from a group of five students to
stand in line for a picture? In how many ways can we arrange all five of these
students in a line for a picture?
Solution:
First, note that the order in which we select the students matters. There are
five ways to select the first student to stand at the start of the line. Once this
student has been selected, there are four ways to selesct the second student in the
line. After the first and second students have been selescted, there are three ways
to select the third student in the line. By the product rule, there are 5 × 4 × 3 =
60 ways to select three students from a group of five students to stand in line for
a picture.
To arrange all five students in aline for a picture, we select the first student
in five ways, the second in four ways, the third in three ways, the fourth in two
ways, and the fifth in one way. Consequently, there are 5.4.3.2.1 = 120 ways to
arrange all five students in aline for a picture.
Theorem 2
7!
= 840
3! 1! 1! 1! 1!
In which all four A’s are together. The get this last result, we considered
all arrangements of the seven syombols AAAA (one symbol),S,S,S,M,U,G
4. Combinations
Kombinasi adalah pengaturan sejumlah berhingga objek yang dipilih tanpa
memperhatikan urutannya.
Theorem 2
𝑷(𝒏,𝒓) 𝒏!
𝑪(𝒏, 𝒓) = 𝒓!
= 𝒓!(𝒏−𝒓)!
, 𝟎 ≤ 𝒓 ≤ 𝒏.
Example :
1) How many ways are there to select five players from a 10-member tennis team to
make a trip to a match at another school?
Solution:
The answer is given by the number of 5-combinations of set with 10 elements. By
theorem, the number of such cmbinations is
10!
𝐶 = (10,5) = = 252
5! .5!
D. Learning Methods :
Tools :
- Worksheet (LKS)
- Laptop
- LCD
- Boardmarker and whiteboard
E. Learning Procedure :
Knowing,
................................................... ...................................................
NIP. NIP.