BINOMNA FORMULA Upoznajmo se najpre sa nekim oznakama: n ! - čita se “en faktorijel” a označava sledeći proizvod: n!=n  (n-1)  (n-2)  …  3  2  1 Primer: 5!=5  4  3  2  1= 120

ili

7! = 7  6  5  4  3  2  1 = 5040

Po definiciji je 0!=1 U zadacima često koristimo trik da faktorijel rastavimo kao proizvod nekoliko članova i novog faktorijela. Tako je recimo:

(n+2)! = (n+2)(n+1)n(n-1)  …  2  1 (n+2)! = (n+2)(n+1)n ! ili (n+2)! = (n+2)(n+1)n (n-1)! itd.

Primer 1. Skrati razlomak: Rešenje:

(n − 1)! (n − 3)!

(n − 1)! (n − 1)(n − 2)(n − 3)! (n − 1)(n − 2) (n − 3)! = =(n-1)(n-2) = (n − 3)! (n − 3)! ( n − 3)!

Primer 2. Reši jednačinu :

(2 x)! 20 x! = (2 x − 3)! ( x − 2)! (2 x)! 20 x! = (2 x − 3)! ( x − 2)!

Rešenje:

(2 x)(2 x − 1)(2 x − 2)(2 x − 3)! 20 x( x − 1)( x − 2)! = (2 x − 3)! ( x − 2)! (2 x)(2 x − 1)(2 x − 2) (2 x − 3)! (2 x − 3)!

=

20 x( x − 1) ( x − 2)! ( x − 2)!

(2x)(2x-1)(2x-2)= 20x(x-1) 2x (2x-1)2(x-1)= 20 x(x-1) [skratimo sa 2x-1 = 5 a odavde je x=3

4x(x-1)]

1

n Ako su n i k prirodni brojevi, onda možemo definisati simbol: ( ) k On se čita “ en nad ka”, a izračunava se : n n(n − 1)(n − 2)...(n − k + 1) ( )= k k!

Primeri: (

10 2

)=

10  9 = 45 2 1

ili

(

15 3

)=

15  14  13 = 455 3  2 1

Da bi imali brzinu u radu moramo zapamtiti da je : n ( ) =1 0 n ( ) =1 n

5 na primer: ( ) = 1 0 7 na primer: ( ) = 1 7

n n ( )=( )=n 1 n −1

12 ( ) = 1 itd. 0 100 ( ) = 1 itd. 100

4 4 na primer: ( ) = ( ) = 4 1 3

50 50 ( ) = ( ) = 50 1 49

n n I najvažnije : ( ) = ( ) k n−k

Na primer dobijemo da rešimo

20 ( ) . Koristeći ovo pravilo mi rešavamo : 18

20 20 20  19 = 190. Mnogo je lakše ovako! ( )=( )= 18 2 2 1 Sada možemo videti kako izgleda binomni obrazac:

n n n n n (a+b)n = ( ) anb0 + ( ) an-1b1 + ( ) an-2b2+ …+ ( ) a1bn-1 + ( ) a0bn 0 1 2 n −1 n

Ova formula se lako dokazuje primenom matematičke indukcije.

2

Šta je važno uočiti? -

U razvoju uvek ima n+1 članova

-

a počinje sa n-tim stepenom, pa u svakom sledećem članu opada dok ne doñe do nule, dok b počinje sa nulom pa u svakom sledećem članu raste dok ne doñe do ntog stepena

-

n n n n n Izrazi ( ) , ( ) , ( ) ,…, ( ) i ( ) su binomni koeficijenti , i za njih važi 0 1 2 n −1 n jedna zanimljiva stvar:

Ako poñemo od nekoliko prvih razvoja dobićemo takozvani Paskalov trougao.

(a+b)0 = 1

1

koeficijent je 1

(a+b)1 = a+b

koeficijenti

(a+b)2 = a2+2ab+b2

koeficijenti

(a+b)3 = a3+3a2b+3ab2+b3

1

su 1 i 1 1

su 1, 2, 1

koeficijenti

(a+b)4 = a4+4a3b+6a2b2+4ab3+b4 koeficijenti

su 1, 4, 6, 4, 1

1

su 1, 3, 3, 1 1

1 2

3 4

1 3

6

1 4

1

itd.

Vidimo da su simetrični koeficijenti u razvijenom obliku binoma jednaki. Oni prave Paskalov trougao, gde su na kracima sve jedinice , a unutrašnji član se dobija sabiranjem gornja dva! 1 1 1 1 1 1

1

2

4

6 10

1

3

3 4

5

1

10

1 5

1

itd.

3

Opšti (bilo koji) član u razvijenom obliku binoma se traži po formuli:

n Tk+1 = ( ) an-k bk k

1) (3 + 2 x) 5 =? Rešenje: (3 + 2 x) 5 = [Ovde je a = 3 , b = 2 x i n = 5 ] 5 5  5 5  5 5  5  3 (2 x) o +  34 (2 x)1 +  33 (2 x) 2 +  32 (2 x)3 +  31 (2 x) 4 +  3o (2 x)5 0 1   2  3  4  5 Ako vam je lakše izdvojite binomne koeficijente ''na stranu'', pa ih rešite:

 5   5   =   = 1  0   5  5  5    =   = 5 1   4  5 5⋅ 4  5   = = 10 =    2  2 ⋅1  3 Sad ovo vratimo u razvoj: = 1 ⋅ 32 ⋅1 + 5 ⋅ 34 ⋅ 2 ⋅ x + 10 ⋅ 33 ⋅ 2 2 x 2 + 10 ⋅ 32 ⋅ 23 ⋅ x 3 + 5 ⋅ 3 ⋅ 2 4 ⋅ x 4 + 1 ⋅1 ⋅ 25 ⋅ x 5 = = 243 + 810 x + 1080 x 2 + 720 x 3 + 240 x 4 + 32 x 5

4

2) (1 + i ) 6 =? Rešenje: (1 + i ) 6 = [Ovde je a = 1 , b = i

i

n = 6]

 6  6 6 6 6  6 6 =  16 ⋅ i o +  15 ⋅ i 1 +  14 ⋅ i 2 +  13 ⋅ i 3 +  12 ⋅ i 4 +  11 ⋅ i 5 +  1o ⋅ i 6  4 5  6 0 1   2 3 6 6   =   = 1 0 6 6 6   =   = 6 1   5  6 6⋅5 6   = = 15 =    2  2 ⋅1  4 6 6 ⋅5 ⋅ 4   = = 20  3  3 ⋅ 2 ⋅1 Da vas podsetimo:

i1 = i   i 2 = −1 i5 = i 4 ⋅ i = i pa je  i 3 = −i  i 6 = i 4 ⋅ i 2 = −1 i 4 = 1  Vratimo se u zadatak: = 1 ⋅1 ⋅ 1 + 6 ⋅ 1 ⋅ i + 15 ⋅ 1 ⋅ (−1) + 20 ⋅ 1 ⋅ (−i ) + 15 ⋅ 1 ⋅ 1 + 6 ⋅ i + 1 ⋅ 1(−1) = 1 + 6i − 15 − 20i + 15 + 6i − 1 = −8i

5

12

2  12   3) Odrediti peti član u razvijenom obliku binoma  x + x 3    Rešenje: 2

1

Odavde je a = x 2 , b = x 3 , n = 12 Iskoristićemo formulu: n Tk +1 =   a n − k b k k  Pošto traže peti član, to je T5 = T4+1 12 − 4

12   1  =   x2   4   8  12  =   x4 ⋅ x 3 4 

T5 = T4 +1

=

 23  x   

Pazi ovde je k = 4 4

12 ⋅11 ⋅10 ⋅ 9 4 + 83 x 4 ⋅ 3 ⋅ 2 ⋅1 20

= 495 ⋅ x 3

(

4) Odrediti član koji ne sadrži x u razvijenom obliku binoma x + x − 2 Rešenje:

)

12

Odavde je a = x, b = x −2 , n = 12 Upotrebićemo formulu TK +1 i naći k: n Tk +1 =   a n − k ⋅ b k k k 12  =   x12 − k ( x −2 ) k  12  =   x12 − k ⋅ x −2 k k  12  =   x12 −3k k  Pošto nam treba član koji ne sadrži x, izvršićemo uporedjivanje:

x12−3 k = x 0 12 − 3k = 0 3k = 12 k =4  12   12  Znači, u pitanju je (T4+1 = T5 ) peti član. Tk +1 =   x12−3 k → T5 =   k  4 

6

n

1  5) Zbir koeficijenta prvog, drugog i trećeg člana u razvoju binoma  x 2 +  jednak x  je 46. Naći koji član ne sadrži x .

Rešenje: Zbir koeficijenta prva tri člana je: n n n   +   +   = 46  0  1   2  n(n − 1) = 46 2 2 + 2n + n 2 − n = 92

1+ n +

n 2 + n − 90 = 0 n1, 2 =

− 1 ± 19 ⇒ n1 = 9; n 2 = −10 2

n=9 Kako je a = x 2 i b =

1 , n=9 x

n Tk +1 =   a n − k ⋅ b k k  9  1 =   ( x 2 )9 − k   x k  9  =   x18− 2 k ⋅ x k k 

k

9  =   x18−3k k  Sada mora biti: x18−3k = x o 18 − 3k = 0 3k = 18 k =6

Znači da je u pitanju sedmi član.  9   9 9 ⋅8⋅ 7 Ako profesor insistira, nadjite baš i rešenje: T7 =   =   = = 84  6   3  3 ⋅ 2 ⋅1

7

 1  6) Odrediti koeficijente uz x 3 u razvoju binoma  − 2x 2   4x 

12

Rešenje:  1  − 2x 2    4x 

12

odavde je a =

1 , b = −2 x 2 , n = 12 4x

n TK +1 =  a n − K ⋅ b K k  12 − k

12  1  =     k  4 x 

12 − k

12  1  =     k  4 

)

k

x k −12 ⋅ (− 2 ) ⋅ x 2 k k

12 − k

12  1  =     k  4 

(

⋅ − 2x2

k −12 ⋅ (− 2 ) ⋅  x 3  k

Ovo je x 3

Dakle: x 3k −12 = x 3 3k − 12 = 3 3k = 15 k =5 Pa će koeficijent uz x 3 biti 12 − k

12  1      k  4 

(− 2)k =

7

12  1  12 ⋅11 ⋅10 ⋅ 9 ⋅ 8 1 5    ⋅ (− 2 ) = ⋅ ⋅ (−32) 5 ⋅ 4 ⋅ 3 ⋅ 2 ⋅1 4 7  5  4  99 =− = −1,546875 64

8

n

 x y  odnosi se prema 7) Koeficijenat drugog člana u razvoju binoma  +  4  x   koeficijentu trećeg člana kao 2:11. Odrediti peti član.

Rešenje:

n n   :   = 2 : 11 1   2  n(n − 1) n: = 2 : 11 2 11n = n(n − 1) 11n = n 2 − n n 2 − 12n = 0 n(n − 12) = 0 ⇒ n = 0 Pošto je a =



n = 12 , pazi: n=0 nije rešenje!

y x ,b = , n = 12 a traži se peti član, to je: x 4

n TK +1 =  a n− K ⋅ b K k  n TK +1 =  a n− K ⋅ b K k 

12  x  T5 = T4+1 =    4  y  12  x 8 y 2 =   4 ⋅ 4 4  y x 12 ⋅11 ⋅10 ⋅ 9 x 4 = ⋅ 4 ⋅ 3 ⋅ 2 ⋅1 y 2

8

 y  ⋅  x   

4

= 495 x 4 y − 2

9

8) Na železničku stanicu treba da stigne iz istog pravca n ljudi. Na koliko mogućih načina, s obzirom na vreme dolaska, mogu da stignu na stanicu? Rešenje:

Razmišljamo: -

mogu da stignu svi u različiti vreme mogu da stignu dva zajedno, ostali u različito vreme mogu da stignu tri zajedno, ostali u različito vreme itd mogu da stignu u grupama po 2 mogu da stignu u grupama po 3 itd

Broj svih mogućnosti je:

C1n + C2n + C3n + ... + Cnn = n n n n   +   +   + ... +   = 1   2   3  n Da bi smo ovo izračunali podjimo od binomne formule: n n n (a + b) n =  a nb o +  a n−1b1 + ... +  a ob n o 1  n Ako umesto a i b stavimo jedinice, dobićemo: n n n (1 + 1) n =   ⋅ 1 ⋅ 1 +   ⋅ 1 ⋅ 1 + ... +   ⋅ 1 ⋅ 1 o 1  n n n n n 2 n =   +   +   + ... +    o  1   2  n n n n n   +   + ... +   = 2 n −   1   2  n o n n n   +   + ... +   = 2 n − 1 1   2  n

Dakle broj svih mogućnosti je: 2 n − 1

10

1.BINOMNA FORMULA-zadaci i malo teorije.pdf

There was a problem previewing this document. Retrying... Download. Connect more apps... Try one of the apps below to open or edit this item. 1.BINOMNA FORMULA-zadaci i malo teorije.pdf. 1.BINOMNA FORMULA-zadaci i malo teorije.pdf. Open. Extract. Open with. Sign In. Main menu.

131KB Sizes 4 Downloads 214 Views

Recommend Documents

1.BINOMNA FORMULA-zadaci i malo teorije.pdf
( 1)( 2)...( )1. k. n n − n − n − k +. Primeri: (. 2. 10. ) = 2 1. 10 9. = 45 ili (. 3. 15. ) = 3 2 1. 15 14 13. = 455. Da bi imali brzinu u radu moramo zapamtiti da je : ) 1. 0. ( =.

4.ASIMPTOTE FUNKCIJA-zadaci i malo teorije.pdf
Pazite: Za svaki prekid mora da se traže oba limesa, osim možda ako funkcija nije negde definisana. - horizontalna. Ovde tražimo dva limesa: lim f (x). x→+∞.

El chico Malo - Abbi Glines.pdf
Page 3 of 351. Abbi Glines. El chico malo. Serie Chicos Vincent 01. Page 3 of 351. El chico Malo - Abbi Glines.pdf. El chico Malo - Abbi Glines.pdf. Open. Extract.

El chico Malo - Abbi Glines.pdf
Loading… Page 1. Whoops! There was a problem loading more pages. Retrying... El chico Malo - Abbi Glines.pdf. El chico Malo - Abbi Glines.pdf. Open. Extract. Open with. Sign In. Main menu. Displaying El chico Malo - Abbi Glines.pdf.

El chico Malo - Abbi Glines.pdf
Ashton, que tiene en Sawyer al. novio perfecto, no puede evitar. sentirse irresistiblemente atraída. por él? Page 2 of 3. Page 3 of 3. Page 3 Mark Scheme Syllabus Paper. Cambridge IGCSE – October/November 2014 0606 23 ... El chico Malo - Abbi Gli

Michael Laitman - Purim El Bueno, El Malo y La Bella.pdf
Había una vez un rey persa, cuyo nombre era demasiado difícil de pronunciar, pero así es como se. escribe: Asuero. Un día, su esposa la reina Vasti, ...

i think i think, therefore i think i am - UFRGS
Page 1 ... Merely thinking you think isn't good enough to generate knowledge you exist ... your own thoughts that give you a reason to believe you have them?

llllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllll|I|I|l|||
A graphics data processing apparatus having graphic image operations on two images. Two graphic images. [21] APPI- Nod 541,879 are formed into a single ...

I mcs-041 I
MCS-041 : OPERATING SYSTEMS. Time : 3 hours ... (a) Discuss the linked and index file allocation schemes. Which allocation scheme is used in UNIX OS? 10.

I mcs-041 I
MCS-041 : OPERATING SYSTEMS. Time : 3 hours ... following types of operating systems : (i). Batch. (ii) ... ordering in a distributed system with an example. 6.

I MGY-001 I
applications. (b) On what basis are maps classified ? Explain your • answer with suitable examples. (c) Applications of Geoinformatics technologies for monitoring and damage assessment of floods. (d) Data considerations for urban and rural environm

N - Arkivoc
A facile, phosgene-free approach with high atom economy has been ..... anilines bearing electron-withdrawing groups were applied (Table 2, Entries 2-4, 13), ...

Saint-Malo-Et-Le-Pays-D-emeraude-French-Edition.pdf
Try one of the apps below to open or edit this item. Saint-Malo-Et-Le-Pays-D-emeraude-French-Edition.pdf. Saint-Malo-Et-Le-Pays-D-emeraude-French-Edition.

llllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllll|I|I|l|||
A graphics data processing apparatus having graphic ... color code. This enables the same graphics data pro. 345/201 .... memory. These bit-map controllers with hard wired functions .... of long term storage device such as a disk drive. The.

,' ,]i,,'
2. f-pcgrln fXoArrcuv f uypori).r.:v 5ag. Fpag riu Yn ru g0 v ur v.!1p r:l6qp [.n 1rru fl ol6ayr..ryrrr,i9 xo r E:,tr or n p ov irn

,' ,]i,,'
v 62,\ll-lv ruu16rqraq oHoyrJVtitv 6E\f ultoxpEouvfst Vd rrpoOrcllf(octv d.V,11 llc(tci$3r f rr trr{rn o r rlrr x6 yrcr r rr1y. uri6 6 er{q 1 olv a rolJIK6v Too 6 fi o tyr,lt::v'.

I I 1.. 1.. -1.
Write true or false : 5x1=5. (a) The study of how to best implement and integrate cryptography in software applications is itself a distinct field. (b) Authentication is the process of verifying the identity of a person. MSEI-022. 1. P.T.O.. Page 2.

I came, I installed… I left -
Miller, who took the time to enlighten pv magazine .... install the system on his house rooftop. After three to ... oped by Miller after he left Shell Solar just before it ...

102\134\\E / / I i : : 7/\i 106
Nov 5, 1999 - loW-press'ure/high-volume pulsed air ?oW. Rotation of one. 8947890. 8/1908 Keys _ p1pe relative to another p1pe about a shared longitudinal ...

at first i thought i was fighting to save rubber trees. then i thought i was ...
Jul 4, 2016 - The state of Acre, in the Brazilian Amazon, retains 87% of its forest cover – and is .... artisan 'Doutor da Borracha' - Master of the Rubber.

at first i thought i was fighting to save rubber trees. then i thought i was ...
Jul 4, 2016 - companies keen to sell shoes, accessories and other products made from ... programmes, equipment and training to support sustainable land use and ... During this first NGP study tour to Acre, we'll be looking at how the NGP ...

Did-I-Mention-I-Need-You-Did-I-Mention-I-Love-You-DIMILY.pdf
Page 1 of 3. Download ]]]]]>>>>>(-PDF-) Did I Mention I Need You? (Did I Mention I Love You (DIMILY)). (eBooks) Did I Mention I Need You? (Did I Mention I ...

I Do, I Don t
Book Synopsis. The Bachelor meets The Runaway Bride in this addictive romance novel about a reality TV producer falling for her would-be star: a Montana.

Zostera marina - Wiley Online Library
P.O. Box 11103, Groningen 9700 CC, The Netherlands, ††GEOMAR Helmholtz-Centre for Ocean Research Kiel, Evolutionary. Ecology of Marine Fishes, D€usternbrooker Weg 20, Kiel 24105, Germany. Abstract. Populations distributed across a broad thermal