You are on page 1of 16
10 Beta and Gamma Functions 10.0 Introduction er we study some simple properties of the beta function nese functions are defined in the form of ay a properties of these functions are dering In this chapt and the gamma function: integral and all the addition from the integral representation. 10.1 Beta and Gamma Functions Definition. ‘The Beta function is defined by 1 [rec (m,n > 0). 0 Alm) ‘The Gamma function is defined by 8 T(n) = i get de (n> 0). 0 Note. The Beta function defined above converges if m,n > 0 and the Gamma function defined above converges if n > 0. Properties and results of Beta and Gamma functions o< | pian Proof. (m,n) 2™"1(1 — 2)" de. 0 Put o= phy. Hence 1-a=1-y¥o=yhy v a When « = en = = 0, y= 0. When # +1, y—+ 00. Also dz = tH. a+) ie ee lar tao aro © scanned with OKEN Scanner Bete ‘2 and Gamma Functions 547 ut a {wipe eye _ — aml Cape +2)mrr 0 a fim) =2 | tina onaig | . 1 Proof. A(m,n { 211 a1 ge, 0 Put ¢=sin?t. Hence dz = 2sint cost dt, When 2 =0,¢=0 and when 2 =1, ¢= 5. #2 ©. B(m,n) = f sin? 1)"~"(cos? t)""2sint cost dt 0 72 =2 | (sin 2)?" (cos.2)?°-? de. 0 3. B(m,n) = B(n,m). 1 Proof. (m,n) { 2™1(1— 2)" de. 0 1—y. Hence 1-2 = y, Also dz = —dy. Put x ¢ When = 0, y= 1 and when # = 1, y=0. ¢ | + A(mn) = A(nm). 4. (m,n) = A(m-+1,n) +A(mn +). © scanned with OKEN Scanner 548 Engineering Mathematics er(1— a) ett ade 1 o™(1- a) de + frre —2)"de 0 | / Blm + i,n) + B(msn + 1)- Roe maar} 8 © scanned with OKEN Scanner Be ela and Garima Functions 549 Pepe oo =[0-(-1)=1. 1. T(n-+1) =nl where n is a positive integer. | proof. We have I'(n-+1) = n(n) (by 5) n(n —1)P(n—1) =n(n—1)---2-1-7(1) (cent, (using’6). 8. T(n)=2 { et ys dy. 0 Proof. We havé'T(si)'= f erat 7 Put x =y". Hence dx = 2y dy. Tin) = [eM WA taydy=2 | ey hdy s 9. Almn o dyad wow geet gant} dn dy y=reind, Hence ler hia dieaneed © scanned with OKEN Scanner 550 Engineering Mathematios tegral the region of integration is the entire fost inter ae 0 to co and @ varies from 0 to 7, 2, jm quadrant, In this are varies fro} a rm+2e-2(co0 0) y=" (in 0)?" [J] wer romr(n) =4 f i: 0 7 aman (eos 0) 1 (sin 0)" 40 dr 0 s oo Si 1/2 et pamt3nct dr [ (cos8)?"~*(sin 8)?" do a/2 aymenadate) i cos 0)*"- (sin 4)?"1 gg” " ~ a ots Ss Ss 8, wie [acm] ‘using ein _ T(m+n)A(m,n). + Bm) yet : ot i 10. r(3)'"- ag Abmay 0) © scanned with OKEN Scanner Betaand Gamma Functions 551 Prooks, We Have T(r) = f es Fath dass, ain ° Put 2 = log (})- Hened der; When x = 0, y= 1 and when 2 = 00, y =0, 2n0)= fofen(Q)™ 12. PrP (n+ 3) =T(2n)y/7. (Thisjis known-as duplication formula). 2 Proof. “Lét TL f in?™'e de‘ We claim tliat ° 2 * { setr2ede= 3 [sa va (putting 26 =) 0 o . a/2 ioe iyay (ine y) =n y) fa. Nes ( () a/2 ve Taking r= fain? de) ' ) 8 4 © scanned with OKEN Scanner 552. Engineering Mathemalics -” i (cinaz)20°4+1/2)-1 (cos 2) 70/9" de CEs 0 x2 Now taking J = f sin? 22 de ° 2 . i 2"(sin 2)*"(cosa)?* de ° a2" [(2) a(t aera) cv Osu at 4! x osdW eget (AF) Ey 7 TQn+1 From (i) and (ii) welget (n+ VF al nth)r (nod — (n+ T a TQn+T, : sPQn+ Ia =2T(n +0 (n+9). . ( 2nb(nyE (m+ 3), (using). (nF (n+ 2) =T(2n)/z. . 13. r(4)r(%) Vin “i \ bs Proof,,, Put,n.= Zin the duplication formula. (rg) “vir orev © scanned with OKEN Scanner Bota did Gamma ‘Funetiéne 553 Solved Problems 2 Problem 1. Evaluate f te" do, 0 S Solution. / ate de = 116) 0 y2/ oo Problem 2. Evaluate f 2 Fe¥ de, ° Solution. Put y= 32. se. Hence dy 3dz, Problem 3. Prove that [ Solution. Put st = se Hence s dt = a a Gehl owe ap ‘ \ ai 0, yok and whan 2 =v = Purther de =~" dy © scanned with OKEN Scanner 554 Engineering Mathematics ° ae log «)® dea ferme’) 3 r / otis? dy. Now, put 4y = t. Hence 4dy = dt. 1 1 -t(t a 1 : Hence, fevra= fe (3) (2) dt °. \ stplavel | nf). 0 641) Je @ fs 0 BD) reo) = abs a2 0 Problem 11. , Prove that T (n+ 3) = Onli (n = 0,1,2,-..) Hence find (5/2). , a : Solution. M(m4a) = [loeb =) (v9 2) 8. g]n() = (9-2) (m-$) $b ve © scanned with OKEN Scanner Bota and Gamma Functions 559 a using Gamma function. Solution. Let J = sin fe rhe isis #0 ir(}) = onl Problem 13,, If I = f iz ana, show that rie + T(n)P(1—n) = gptag where O

You might also like