კომბინატორიკა
კომბინატორიკა
Pn 1 2 3 n
Pn n !
Pn n Pn 1 .
1
$ 2. wyoba da misi raodenobis gamosaTvleli formula
wyobaTa Tvisebebi.
Tviseba. .
Tviseba. .
Tviseba.
2
n!
C nm .
m! (n m)!
jufTebaTa Tvisebebi:
Tviseba. C n0 1 .
Tviseba. C n1 n .
Tviseba. C nm C nn m .
3
( a b) n C n0 a 5 C n1 a n 1b C n2 a n 2 b 2 C nm a n m b m C nn b n .
miRebul formulas niutonis formula (anu binomi) ewodeba.
niutonis binomis C nm koeficientebs binomuri koeficientebi ewodebaT.
12
12 2
magaliTi. vipovoT x x 3 daSlis mexuTe wevri.
amoxsna. visargebloT zemoT ganxiluli formuliT, gveqneba:
8 4
12 23 20
T4 C x
4
12
x 495 x 3 .
$ 5. paskalis samkuTxedi
C 00 1
4
C10 1 C11 1
C 20 1 C 21 2 C 22 1
C 30 1 C 31 3 C 32 3 C 33 1
C 40 1 C 41 4 C 42 6 C 43 4 C 44 1
. . . . . . . . . . . . . . . . . . . . . . . . . . . . .
mas paskalis samkuTxedi qvia. albaT SeamCnevdiT, rom aq yoveli
ricxvi misi ori zeda mezoblis jamia. sazogadod
damatebiTi amocanebi.
5
5. klasis 27 moswavlidan konferenciisaTvis unda airCion 3
delegati. ramdeni xerxiT SeiZleba amis gakeTeba?
8. amoxseniT gantoleba:
15 An2
a) Ax 6C x x x ; b)
3 2 2
Cn4 ;
4
4
g) An 2 224 n( n 2) ; d) Cn3 Cn2 15(n 2 -1)
11. gamoTvaleT:
1. ( x 1) 4 ; 2. (2 x 2 y ) 5 ; 3. ( a b ) 4 ;
4. ( x y ) ; 5. ( 2a b / 3) ; 6. ( x / 2 1 / x ) .
6 2 7 7
1. (a 3 2b 2 )12 , m 7 ; 2. (2 x 1 / 2 y )19 , m 8 ;
3. (a
1/ 2
1 / 2b 1 / 3 )18 , m 4 ; 4. ( x y ) 25 , m 20 ;
5. (3 x y / 3) , m 11
15
13.
ipoveT x x 2
12
daSlis im wevris nomeri, romelic ar Seicavs x -
s.
Factorial
The product of a given integer and all smaller positive integers. The factorial of n is written n!
and is read aloud "n factorial".
Note: By definition, 0! = 1.
Permutation Formula
A formula for the number of possible permutations of k objects from a set of n. This is usually
written nPk .
Formula:
different lineups
Binomial Coefficients
Numbers written in any of the ways shown below. Each notation is read aloud "n choose r."
7
A binomial coefficient equals the number of combinations of r items that can be selected from a
set of n items. It also represents an entry in Pascal's triangle. These numbers are called binomial
coefficients because they are coefficients in the binomial theorem.
Formula:
Examples:
Pascal's Triangle
The figure below, extended infinitely. A particular entry is found by adding the two numbers that
are above and on either side of the element. Note: The numbers which make up Pascal's triangle
are called binomial coefficients.
Pascal's Triangle