Journal of Al-Nahrain University Vol.11(1), April, 2008, pp Science 3 OF THE EHRHART POLYNOMIALS OF A POLYHEDRON IN

Size: px
Start display at page:

Download "Journal of Al-Nahrain University Vol.11(1), April, 2008, pp Science 3 OF THE EHRHART POLYNOMIALS OF A POLYHEDRON IN"

Transcription

1 ournl of Al-Nhrin Univrsity Vol( April 008 pp05-9 Scinc ON FINDING TH COFFICINTS c OF TH HRHART POLYNOMIALS OF A POLYHDRON IN Shth Ass Al-Nr Mnl N Al-Hrr n Vin A Al Al-Slhy Dprtnt of Appli Scinc Univrsity of Tchnology Bgh Irq Abstrct Coputing th volu n intgrl points of polyhron in is vry iportnt subct in iffrnt rs of thtics such s: nubr thory toric Hilbrt functions Kostnt's prtition function in rprsnttion thory hrhrt polynoil in cobintorics cryptogrphy intgr progring sttisticl contingncy n ss spctroscop nlysis Thrfor tho for fining th cofficints of this polynoil r to b list A progr in visul bsic lngug is for fining th gnrl iffrntition of th function tht us for fining th cofficints of th hrhrt polynoil which illustrt by flow chrt in Fig( Introuction Th hrhrt polynoil of convx lttic polytop counts th nubr of intgrl points in n intgrl ilt of th polytop(vry boun polyhron is si to b polytop hrhrt prov tht th function which counts th nubr of lttic points tht li insi th ilt polytop tp( Lt P b n intgrl polytop for positiv intgr t lt tp={tx : XP} not th ilt polytop P is polynoil in t n it is not by L(Pt which is th crinl of (tp whr is th intgr lttic in Fro th finitions of th hrhrt polynoil th ling cofficint is th volu of th polytop n th constnt tr is on; ths r tr s th trivil cofficint of th hrhrt polynoil th othr cofficints r nontrivil [] In this wor w prsnt tho for coputing th cofficints of th hrhrt polynoil tht pns on th concpts of Din su n rsiu thor in coplx nlysis Gnrl forul tht counts th rivtivs in th introuc tho is givn To th bst of our nowlg this tho ss to b nw Forultion of this tho Bfor w iscuss th tho th following thor whr n Thor ( []: Lt b lttic -polytop with th hrhrt polynoil L(Pt = i c Thn c is it i0 th volu of P whil th constnt tr is on which is qul to th ulr chrctristic of P Th othr cofficints of L(Pt r not sily ccssibl In fct tho of coputing ths cofficints ws unnown until quit rcntly [] [] n [] Counting intgrl points using Din sus In this sction w scrib th rltion btwn th Din su n th hrhrt polynoil of polytop n iscuss thor tht counts th nubr of intgrl points in polytop Rcll tht th Din su of two rltivly pri positiv intgrs n b not by S(b is fin s whr S (b (( x b i x 0 i i (( (( b b x x is th grtst intgr st of intgr nubrs if if x x x n is th 05

2 Shth Ass Al-Nr Rr (: Th iscrt Fourir xpnsions cn b us to rwrit th Din su in trs of th Din cotngnt su tht is for two rltivly pri positiv intgrs n b: b S (b cot( cot( b b b whr S(b is th Din su of n b [5 p 7] Counting intgrl points using th rsiu thor This sction is concrn with tho givn in [] to count th intgrl points of givn polytop by ns of th rsiu thor Thor ( []: Lt P b polytop fin s P (x x : x n x 0 ( with vrtics ( 00 0 (0 0 ( 0 00(00 whr r positiv intgrs A A â (whr â ns th fctor is oitt n A nots â â f t ( n Ω r fin s ta A A A f t ( ( n L(P t ( A { C \ {}: R s(f t ( ( } thn ( R s(f t ( Th hrhrt cofficints In this sction so tils for riving forul of hrhrt cofficints r givn For ch cofficint of th hrhrt polynoil t c0 L(Pt ct c forul for fining ths cofficints cn b riv with sll oifiction of f t ( Consir th function g g ( ( ( ( 0 ( ( ta A A A 0 ( ( ta( ( ( A A A ( ( If ( 0 is insrt in th nurtor of th bov qution w gt ta( ( 0 g ( A A ( ( ( g ( 0 0 ( A ( ( A ( A 0 ta( ( ( ( A ( ft( ( Rcll tht L(P t R s(f t( 0 using this rltion w obtin R s(g ( 0 R s( ( ( 0 Rs(f 0 t( ( (L(P( t ( (L(P ( t 0 ( f t( ( 0 ( ( ( (L(P ( t ( 0 g ( Th following l is n to riv th forul of th cofficints of th hrhrt polynoil L ( [] Suppos tht L(Pt R s(g c t c ( 0! t c0 thn for S ( c t whr S ( nots th Stirling nubr (nubr 0

3 ournl of Al-Nhrin Univrsity Vol( April 008 pp05-9 Scinc of prtition of n -st into -blocs of th scon in of n n c 0 = Thor ( [] : Lt P b lttic -polytop givn by xprssion ( with th hrhrt polynoil L(P t c t c t c0 thn for S ( c t (R s(g (! R s(g ( whr { C \ {}: A } Corollry ( []: For > 0 c is th cofficint of (R s(g( R s(g(! t in Thor ( []: Lt b lttic -polytop with vrtics ( 00 0 ( 0 0(00 whr r pirwis rltivly pri intgrs Th first nontrivil hrhrt cofficints c is givn by c (C S(A S(A (! whr S ( b nots th Din su n C ( A A A A ( A Coputing c of Th hrhrt Polynoil using VBP: As sn bfor th ling cofficint of th hrhrt polynoil rprsnts th volu of th polytop th scon cofficint rprsnts hlf of th surfc r of th polytop n th constnt tr is on whil th othr cofficints r unnown In this sction w fin th non trivil cofficints c for th polytop with whr P is rprsnt by list of vrtics ( 00 0 ( ( (00 0 such tht r pirwis rltivly pri positiv intgrs Thor (5: Lt P not th polytop in ( with vrtics ( 000( 00(00 whr r pirwis rltivly pri positiv intgrs Thn c is givn by c D (! S(A S(A C Whr S(b is th Din su of n b D (B B B B! (A C (A (A ( (A (A!! ( (0! (tb (tb!! (A (A!! A A â th fctor!! ( â ns is oitt B n B â Proof: By corollry ( if w fin g ( g ( ( ( ( ta s A A A ( ( WhrA A â n â ns tht th fctor is oitt thn th pols of th function g ( r t = 0 n th roots of unity W fin th rsius of th function g ( t ths pols Sinc r pirwis rltivly pri thrfor g ( hs sipl pols t -th roots of unity Lt 07

4 Shth Ass Al-Nr n sinc A A A thrfor g ( ( Now t 0 ( ( t( n 0 Thrfor A chng of vribls ( ( xp log is whr suitbl brnch of logrith such tht thus xp log( Rs(g( A ( ( Whrn ( Rs ( tb B ( B B B â Sinc Rs(f ( Rs( f ( 0 thn ( Rs ( tb ( Rs B ( Lt = tb thn ( Rs( B ( B B ( tb ( B tb ( B 0 0 ( = Rs( 0 B B ( ( By writing th Mclurin sris for xponntil function on cn gt ( ( (!! Rs (B (B B B!! 0 Aftr sipl coputtions th bov rsiu cn b writtn s ( ( (!! R s ( B ( B (B (B (B (B!!!! 0 Lt I!!! A A A!!! B B B!!! B B B!!! Thn B B B!!! ( Rs 0 B ( B ( ( R s (I 0 ( B ( B ( ( B ( B For th function (I w hv pol of orr two t ro n Lt ( I ( ( B ( B Aftr sipl coputtions on w gt t By th forul for fining th B rsius if w consir ( f ( thn Rs(f ( (0 0 whr! ( ( I I Lt K I K I 08

5 ournl of Al-Nhrin Univrsity Vol( April 008 pp05-9 Scinc K I thrfor ( ( K K K t = 0 w coput (0 ftr sipl coputtions w gt ( ( 0 (B B B!! thrfor (B B B t! R s(f ( 0 B (! Lt D (B B B B! Thrfor D R s(g ( t A ( ( ll th -th root of unity r up to gt Dt Rs(g( A ( ( Lt b priitiv thrfor thn Dt Dt A ( ( ( ( A A th roots of unity A ( ( ( ( A A A A A A A A A A ( A A A A A A Now sinc thn by using th forul for fining th roots in th coplx pln n r i = 0 W obtin = ( ( A A i i A A A ( i A ( i ( i ( i i cos( But cot( i sin( i A hnc ( i ( i A ( i ( i n = cot i A ( i A ( i A cot A A 09

6 Shth Ass Al-Nr thrfor A cot cot A cot cot ( A A A A ( i A cot cot A cot cot Th iginry trs isppr n thn th bov qution cn b writtn s A cot cot S(A whr S(A is th Din su of A n Hnc R s(g( Dt ( S(A Siilr xprssions r obtin for th rsius t th othr roots of unity Now w fin th rsiu t g ( t = w hv Rs(g ( Rs( g( 0 thn Rs(g ( ta ( R s A ( A ( A ( ( 0 By writing th Mclurin sris for xponntil function w gt ( ( (!! R s (A (A A A!!! 0 whr ta thn th bov rsiu bcos ( (A (A ( (!! R s (A (A (A (A!!!! 0!! th function for which w wnt to fin th rsiu hs pol of orr four t ro Lt ( (!! ( (A (A (A (A!!!! ( n f ( AA By th forul for fining th rsiu w gt ( (0 Rs(f ( 0! Lt n I h!!!!!! A A A!!! A A A!!! A A A!!! Thn ( I h n ( I h I lt I h I h!! h 0

7 ournl of Al-Nhrin Univrsity Vol( April 008 pp05-9 Scinc K I h K I h K I h n K I h Hnc K K K n K K K Now thrfor ( K ( K ta (ta I!! I (ta! ta (ta (ta!!! ( ta (ta!! Diffrntiting I to gt I n I thn put = 0 in th obtin xprssion to gt For I(0 I (0 I (0 ta (! ( ( ( (ta! ta! (ta! ta I (0 ( ( 5(! ta (ta (! A A A!!! A A!! A A!! A! A! ( ( ta!(ta! Diffrntit to gt n thn put = 0 in th obtin xprssions to gt A (0 A (0 (0 n (0 0!! In siilr wy w gt th othr iffrntition of n h thn (ta R s (A (A Lt ( ( A t (A (A! (A C (A (A ( 0 ( (0 (0! So by corollry ( w gt for c which is th cofficint of t of (Rs(g( (! So c Rs(g ( D S(A (! S(A C Gnrl forul for th iffrntition of I h In this sction w gt gnrl for for th iffrntition of th trs I n h tht pprs throughout th procss of fining th cofficints of th hrhrt polynoil w bgin by consiring I I h whr I ns tht only I in th xprssion I h is iffrntit tis Lt thn I I I I I (I I I ( I I (I I I (I I (5 5 ( I I (I I I (I I (I I I I I I

8 Shth Ass Al-Nr I I I ( (7 (8 5 (5 I (I I I I ( I (I I I I I I (I I (I ( I I I 7 ( 5 I (5I I 0 I 0I 5 5 (5 5 I I (0I I ( (0I 0I (5I 0I ( (I (5 5I I 0 I 0 I 0 I 0 I 0 I 5 I 5 I 5 I 0 I 8 7 (7 5 I (I I 5 I 0 I 5 ( 5 I I (5I I 5 (5 ( (0I 5I (5I 0I ( (5 (I 5I (I I ( I 0 I 5 90 I 0 I 5 I 0 I 0 I 0 I 0 I 5 I ( I 5 I I 90 I 5 I 0 I 5 I 0 I 5( I In orr to iffrntit w n to fin gnrl forul for ths iffrntitions so w wor on ths lnts n fin gnrl forul To illustrt this consir for xpl w w (!! w w w w! Th w By ssuing th iplicit iffrntition for both sis of th bov qution w gt w ( ( w n th scon rivtiv of th bov qution is w ( ( 0 whn w iffrntit w -tis w gt shp li binoil forul ( b = ( b b b! = i i b i i Thrfor whr w ( ( w ( 0 is th -th rivtiv of sinc w is constnt thrfor w ns w ris to th powr For xpl w lt h thn h h w w w w ( w w w w B w w ( w w w B h ( w w w n so on Thrfor [] I whr [] I I [] [] ( [] [] [] [] w n siilrly for highst rivtiv By rrnging th togthr w obtin I [] [] [] ( [] [] ( [] ( ( []

9 ournl of Al-Nhrin Univrsity Vol( April 008 pp05-9 Scinc (5 ( (7 (8 [5] [] ( ( [] ( [] [] ( ( ( [] [5] (5 ( [] [] ( ( ( [] ( [] [] [] ( [] [] ( [] [] [] [7] [] ( [5] [] (5 0 0 [] 5 [] [5] (5 [] (0 5 (0 ( [] ( [] (5 0 ( 5 (5 [] [] [] [] [] [] 0 5 [] [] [] 5( 0 [8] [7] (7 [] [5] ( 5 0 [] 5 [] [] [] (5 ( [5] (5 [] (0 5 (5 ( ( [] ( (5 [] ( ( ( [5] [] 0 90 [] [] [] 5 0 [] [] [] 0 0 [] ( [] [] 5( [] [] 90 ( 5 ( [] [] [] [] [] 0( ( [] [] [] 05 5 ( [] ( [] (5 [] 7 [5] [] 5 ( 5 [] [] [] 05 ( 05( [] [] ( 0 05 [] ( [] [] 70( 0 [] [] [] ( 5 0 [] [] ( ( 05 0 By siilr procur w gt th rivtivs of n h tht r us in th finition of ( in th prcing sctions Whn w rrng th obtin rsults w gt tringl li Poly tringl [8 p0] whr th contnts of th tringl r th cofficints of in th xprssion ( ( (5 ( (7 (8 (9 ( ( Also th first trs of th cofficints of in th xprssion of r ( (5 (9 [9] 5 [5] (7 [7] (7 [] ( 7 5 [5] (5 ( [] ( [] 7 ( [] (5 [] [] [] [8] (8 5 [] 7 0 [5] 5 [] [] 0 [7] [] [] 7 [] 5 (7 [] [5] [] 0 0 5

10 Shth Ass Al-Nr ( (5 ( (7 (8 ( ( (5 5 ( 7 ( Th scon trs of th cofficints of in th xprssion of r ( (5 ( (7 (8 (9 ( ( ( ( Th cofficints of in th xprssion of r rrng s follows 0 0 ( (5 ( (7 (8 ( (5 (7 ( ( (8 (5 (7 ( ( (5 ( ( (5 5 Th igonl of th bov rsults is th scon colun of th prcing Poly tringl n th first colun for th bov rsults is obtin s follows: By ultiplying th igonl by 5 w gt th lin unr th igonl which r ((= ((5=0 (0(=0 (5(7=05 Th gnrl forul of th iffrntition is givn by W whr < 8 n W cn b obtin fro th givn tbls s follow whn = thn whn = thn W fro th tbls W cn b foun s follows W

11 ournl of Al-Nhrin Univrsity Vol( April 008 pp05-9 Scinc Strt ntr S=su (A (i/ (i i= to Fill A (i i= to C = (+S+ (/A+S// A=prouct of (i i= to A (i = A/ (i i= to B=prouct of (i i= to B (i = B/ (i i= to S=su (B (i D= (-05S/B M=su {cot (πia (i/ (icot (πi/ (i} i= - C - =/ ((-!( C -S (n An I n ( n ( = (n I t =0 (n h n h t =0 ( ( n I / I i i ( n (n n I / i * i Clcult cofficints of xprssion of [n] = (pp n in M th uppr tringl of ro S [i]a[i] =(im/ i= to (ii= i= p S = su (S [i]a[i] A ii+ =A/((i(i+ i= to - S=su (A ii+ i= to - (i = (i- + i = p 5

12 Shth Ass Al-Nr Nxt i= p = p If < > i (i=(i--+(i- Clcult cofficints of xprssion of (n = (pp ( ' n in th M th uppr tringl of ro (ii =(i+ i= p Nxt i (i+ i = (i+ (i+ i= p Clculbl cofficints of xprssion of (n [n] = (P P = (pp in th (i = (i i- i= p Clculbl cofficints of xprssion of (n [n] = (P P in th Clcult cofficints of xprssion of (n =5 (pp ( in th ( = M th uppr tringl of 5 ro M th uppr tringl of ro 5 (ii =(i+ i= p (i =+i i= p 5 (i+ = (+i 5 (ii i= p i= p 5 (i =5 (i i- i= p = p (i= (i- Clcult cofficints of xprssion of [n] = (pp ( in th

13 ournl of Al-Nhrin Univrsity Vol( April 008 pp05-9 Scinc 5 M th uppr tringl of ro (ii =(i+ i= p (i+ i = (i+ (ii i= p Clcult cofficints of xprssion of [n] =7 M th uppr tringl of 7 ro 7 (i=(i+ i= p 7 (i+ i = (i+5 7 (ii i= p 7 (i = 7 (i i- i= p ( in th W ( = ( [ (i ( n- + (i ( n -] i= p W ( = ( [ ( n - (i ] i= p W (5 = ( [ ( n - (i + (i ( n-] i= p W ( = ( [ ( n - (i ] i= p W (7 = [ ( n - (i ] i= P W (8 = ( [ ( n -5 (i + (i ( n-] i= p W (9 = ( ( [ ( n - (i ] i= p W=w + w (i i= (n W (0 = ( [ ( n - 5 (i ] i= p W ( = ( [(n- ( n - + (i ( n-] i= p W ( = ( [ ( n - (i ] i= p W ( = [ ( n - (i ] i= p W ( = 5 [ ( n -5 (i ] i= P 5 7

14 Shth Ass Al-Nr 7 W ( = (5 [ ( n - (i 5 + (i 5 ( n-] i= p W ( = ( ( [ ( n -5 (i ] i= p W (5 = ( [ ( n -5 (i ] i= p W ( = ( [ ( n -5 (i ] i= p W ( = ( [ ( n -7 (i + (i ( n-7] W ( = ( [ ( n - (i ] i= p W ( = (7 [ ( n -7] + R [n] = ( n I * ( i / ( * ( ( n n i= ( n ( n [( n * ( n ( n ] W W (7 = ( [ ( n - 7 (i ] i= p n ( n su( ( i n i= W (8 = ( ( [ ( n -5] Y= prouct of (A (i i= W (9 = ( ( [ ( n -5] i= P W (0 = ( ( [ ( n - 5 (i ] i= p C= A (-n (n / (Yn! C (- =-/ (-! [D (/-/ (/A-su-C] C n 7 Fig ( : Progr Flowchrt for fining th cofficint of hrhrt polynoil 8

15 ournl of Al-Nhrin Univrsity Vol( April 008 pp05-9 Scinc Rfrncs [] A Brvino n Porshi An lgorithic thory of lttic points in polyhr nw prspctivs in gotric cobintorics MSRI publictions 8 ( [] M Bc A D Lor M Dvlin Pifl n R P Stnly Cofficints n roots of hrhrt polynoils confrnc on intgr points in polyhr (-7 uly in Snowbir (00 - [] M Brion n M Vrgn Lttic points in sipl polytops Ar Mth Soc 0 ( ( [] R Di S Robins Th hrhrt polynoil of lttic polytop Annls of Mth 5 ( [5] T M Apostol Moulr functions n Dirichlt sris in nubr thory Springr Vrlg Inc 97 [] M Bc Counting lttic points by ns of th rsiu thor Rnun ( ( [7] R P Stnly nurtiv cobintorics Wsworth & Broos / Col Avnc Boos & softwr Cliforni 98 [8] G Poly n R Trn n DR Woos Nots on introuctory cobintorics Birhüsr Bostn Inc 98 الخالصة حساب حجم متعدد األضالع وكذلك حساب عدد النقاط التي احداثياتها أعداد صحيحة في المجال R هو موضوع مهم جدا في فروع الرياضيات المختمفة مثل نظرية االعداد نظرية التمثيل متعدد حدود ايرهارت في التوافيقية التجفير و النظام االحصائي تم حساب متعدد حدود ايرهارت باستخدام بعض الطرق ا حدى هذه الطرق طورت واستنتجنا مبرهنة لحساب معامالت متعددة الحدود ايرهارت كذلك كتب برنامج بمغة فيجوال بيسك لحساب المشتقات لمدالة التي أستخدمت لحساب معامالت متعددة الحدود ايرهارت 9

TOPIC 5: INTEGRATION

TOPIC 5: INTEGRATION TOPIC 5: INTEGRATION. Th indfinit intgrl In mny rspcts, th oprtion of intgrtion tht w r studying hr is th invrs oprtion of drivtion. Dfinition.. Th function F is n ntidrivtiv (or primitiv) of th function

More information

Section 3: Antiderivatives of Formulas

Section 3: Antiderivatives of Formulas Chptr Th Intgrl Appli Clculus 96 Sction : Antirivtivs of Formuls Now w cn put th is of rs n ntirivtivs togthr to gt wy of vluting finit intgrls tht is ct n oftn sy. To vlut finit intgrl f(t) t, w cn fin

More information

INTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x)

INTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x) Chptr 7 INTEGRALS 7. Ovrviw 7.. Lt d d F () f (). Thn, w writ f ( ) d F () + C. Ths intgrls r clld indfinit intgrls or gnrl intgrls, C is clld constnt of intgrtion. All ths intgrls diffr y constnt. 7..

More information

Lecture 11 Waves in Periodic Potentials Today: Questions you should be able to address after today s lecture:

Lecture 11 Waves in Periodic Potentials Today: Questions you should be able to address after today s lecture: Lctur 11 Wvs in Priodic Potntils Tody: 1. Invrs lttic dfinition in 1D.. rphicl rprsnttion of priodic nd -priodic functions using th -xis nd invrs lttic vctors. 3. Sris solutions to th priodic potntil Hmiltonin

More information

ME 522 PRINCIPLES OF ROBOTICS. FIRST MIDTERM EXAMINATION April 19, M. Kemal Özgören

ME 522 PRINCIPLES OF ROBOTICS. FIRST MIDTERM EXAMINATION April 19, M. Kemal Özgören ME 522 PINCIPLES OF OBOTICS FIST MIDTEM EXAMINATION April 9, 202 Nm Lst Nm M. Kml Özgörn 2 4 60 40 40 0 80 250 USEFUL FOMULAS cos( ) cos cos sin sin sin( ) sin cos cos sin sin y/ r, cos x/ r, r 0 tn 2(

More information

The Z transform techniques

The Z transform techniques h Z trnfor tchniqu h Z trnfor h th rol in dicrt yt tht th Lplc trnfor h in nlyi of continuou yt. h Z trnfor i th principl nlyticl tool for ingl-loop dicrt-ti yt. h Z trnfor h Z trnfor i to dicrt-ti yt

More information

DEVELOPING COMPUTER PROGRAM FOR COMPUTING EIGENPAIRS OF 2 2 MATRICES AND 3 3 UPPER TRIANGULAR MATRICES USING THE SIMPLE ALGORITHM

DEVELOPING COMPUTER PROGRAM FOR COMPUTING EIGENPAIRS OF 2 2 MATRICES AND 3 3 UPPER TRIANGULAR MATRICES USING THE SIMPLE ALGORITHM Fr Est Journl o Mthtil Sins (FJMS) Volu 6 Nur Pgs 8- Pulish Onlin: Sptr This ppr is vill onlin t http://pphjo/journls/jsht Pushp Pulishing Hous DEVELOPING COMPUTER PROGRAM FOR COMPUTING EIGENPAIRS OF MATRICES

More information

Ch 1.2: Solutions of Some Differential Equations

Ch 1.2: Solutions of Some Differential Equations Ch 1.2: Solutions of Som Diffrntil Equtions Rcll th fr fll nd owl/mic diffrntil qutions: v 9.8.2v, p.5 p 45 Ths qutions hv th gnrl form y' = y - b W cn us mthods of clculus to solv diffrntil qutions of

More information

PH427/PH527: Periodic systems Spring Overview of the PH427 website (syllabus, assignments etc.) 2. Coupled oscillations.

PH427/PH527: Periodic systems Spring Overview of the PH427 website (syllabus, assignments etc.) 2. Coupled oscillations. Dy : Mondy 5 inuts. Ovrviw of th PH47 wsit (syllus, ssignnts tc.). Coupld oscilltions W gin with sss coupld y Hook's Lw springs nd find th possil longitudinl) otion of such syst. W ll xtnd this to finit

More information

Walk Like a Mathematician Learning Task:

Walk Like a Mathematician Learning Task: Gori Dprtmnt of Euction Wlk Lik Mthmticin Lrnin Tsk: Mtrics llow us to prform mny usful mthmticl tsks which orinrily rquir lr numbr of computtions. Som typs of problms which cn b on fficintly with mtrics

More information

The Derivative of the Natural Logarithmic Function. Derivative of the Natural Exponential Function. Let u be a differentiable function of x.

The Derivative of the Natural Logarithmic Function. Derivative of the Natural Exponential Function. Let u be a differentiable function of x. Th Ntrl Logrithmic n Eponntil Fnctions: : Diffrntition n Intgrtion Objctiv: Fin rivtivs of fnctions involving th ntrl logrithmic fnction. Th Drivtiv of th Ntrl Logrithmic Fnction Lt b iffrntibl fnction

More information

Instructions for Section 1

Instructions for Section 1 Instructions for Sction 1 Choos th rspons tht is corrct for th qustion. A corrct nswr scors 1, n incorrct nswr scors 0. Mrks will not b dductd for incorrct nswrs. You should ttmpt vry qustion. No mrks

More information

SOLVED EXAMPLES. be the foci of an ellipse with eccentricity e. For any point P on the ellipse, prove that. tan

SOLVED EXAMPLES. be the foci of an ellipse with eccentricity e. For any point P on the ellipse, prove that. tan LOCUS 58 SOLVED EXAMPLES Empl Lt F n F th foci of n llips with ccntricit. For n point P on th llips, prov tht tn PF F tn PF F Assum th llips to, n lt P th point (, sin ). P(, sin ) F F F = (-, 0) F = (,

More information

CONIC SECTIONS. MODULE-IV Co-ordinate Geometry OBJECTIVES. Conic Sections

CONIC SECTIONS. MODULE-IV Co-ordinate Geometry OBJECTIVES. Conic Sections Conic Sctions 16 MODULE-IV Co-ordint CONIC SECTIONS Whil cutting crrot ou might hv noticd diffrnt shps shown th dgs of th cut. Anlticll ou m cut it in thr diffrnt ws, nml (i) (ii) (iii) Cut is prlll to

More information

Derangements and Applications

Derangements and Applications 2 3 47 6 23 Journal of Intgr Squncs, Vol. 6 (2003), Articl 03..2 Drangmnts and Applications Mhdi Hassani Dpartmnt of Mathmatics Institut for Advancd Studis in Basic Scincs Zanjan, Iran mhassani@iasbs.ac.ir

More information

Garnir Polynomial and their Properties

Garnir Polynomial and their Properties Univrsity of Cliforni, Dvis Dprtmnt of Mthmtis Grnir Polynomil n thir Proprtis Author: Yu Wng Suprvisor: Prof. Gorsky Eugny My 8, 07 Grnir Polynomil n thir Proprtis Yu Wng mil: uywng@uvis.u. In this ppr,

More information

CONTINUITY AND DIFFERENTIABILITY

CONTINUITY AND DIFFERENTIABILITY MCD CONTINUITY AND DIFFERENTIABILITY NCERT Solvd mpls upto th sction 5 (Introduction) nd 5 (Continuity) : Empl : Chck th continuity of th function f givn by f() = + t = Empl : Emin whthr th function f

More information

Examples and applications on SSSP and MST

Examples and applications on SSSP and MST Exampls an applications on SSSP an MST Dan (Doris) H & Junhao Gan ITEE Univrsity of Qunslan COMP3506/7505, Uni of Qunslan Exampls an applications on SSSP an MST Dijkstra s Algorithm Th algorithm solvs

More information

CS 491 G Combinatorial Optimization

CS 491 G Combinatorial Optimization CS 49 G Cobinatorial Optiization Lctur Nots Junhui Jia. Maiu Flow Probls Now lt us iscuss or tails on aiu low probls. Thor. A asibl low is aiu i an only i thr is no -augnting path. Proo: Lt P = A asibl

More information

Some Inequalities for General Sum Connectivity Index

Some Inequalities for General Sum Connectivity Index MATCH Counications in Mathatical and in Coputr Chistry MATCH Coun. Math. Coput. Ch. 79 (2018) 477-489 ISSN 0340-6253 So Inqualitis for Gnral Su Connctivity Indx I. Ž. Milovanović, E. I. Milovanović, M.

More information

cycle that does not cross any edges (including its own), then it has at least

cycle that does not cross any edges (including its own), then it has at least W prov th following thorm: Thorm If a K n is drawn in th plan in such a way that it has a hamiltonian cycl that dos not cross any dgs (including its own, thn it has at last n ( 4 48 π + O(n crossings Th

More information

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely . DETERMINANT.. Dtrminnt. Introution:I you think row vtor o mtrix s oorint o vtors in sp, thn th gomtri mning o th rnk o th mtrix is th imnsion o th prlllppi spnn y thm. But w r not only r out th imnsion,

More information

Chemistry 342 Spring, The Hydrogen Atom.

Chemistry 342 Spring, The Hydrogen Atom. Th Hyrogn Ato. Th quation. Th first quation w want to sov is φ This quation is of faiiar for; rca that for th fr partic, w ha ψ x for which th soution is Sinc k ψ ψ(x) a cos kx a / k sin kx ± ix cos x

More information

The Transfer Function. The Transfer Function. The Transfer Function. The Transfer Function. The Transfer Function. The Transfer Function

The Transfer Function. The Transfer Function. The Transfer Function. The Transfer Function. The Transfer Function. The Transfer Function A gnraliation of th frquncy rsons function Th convolution sum scrition of an LTI iscrt-tim systm with an imuls rsons h[n] is givn by h y [ n] [ ] x[ n ] Taing th -transforms of both sis w gt n n h n n

More information

Theoretical Study on the While Drilling Electromagnetic Signal Transmission of Horizontal Well

Theoretical Study on the While Drilling Electromagnetic Signal Transmission of Horizontal Well 7 nd ntrntionl Confrnc on Softwr, Multimdi nd Communiction Enginring (SMCE 7) SBN: 978--6595-458-5 Thorticl Study on th Whil Drilling Elctromgntic Signl Trnsmission of Horizontl Wll Y-huo FAN,,*, Zi-ping

More information

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s? MATH 3012 Finl Exm, My 4, 2006, WTT Stunt Nm n ID Numr 1. All our prts o this prolm r onrn with trnry strings o lngth n, i.., wors o lngth n with lttrs rom th lpht {0, 1, 2}.. How mny trnry wors o lngth

More information

CSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata

CSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata CSE303 - Introduction to th Thory of Computing Smpl Solutions for Exrciss on Finit Automt Exrcis 2.1.1 A dtrministic finit utomton M ccpts th mpty string (i.., L(M)) if nd only if its initil stt is finl

More information

BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES. 1. Statement of results

BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES. 1. Statement of results BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES DONALD M. DAVIS Abstract. If p is a prim and n a positiv intgr, lt ν p (n dnot th xponnt of p in n, and u p (n n/p νp(n th unit part of n. If α

More information

The Equitable Dominating Graph

The Equitable Dominating Graph Intrnational Journal of Enginring Rsarch and Tchnology. ISSN 0974-3154 Volum 8, Numbr 1 (015), pp. 35-4 Intrnational Rsarch Publication Hous http://www.irphous.com Th Equitabl Dominating Graph P.N. Vinay

More information

, between the vertical lines x a and x b. Given a demand curve, having price as a function of quantity, p f (x) at height k is the curve f ( x,

, between the vertical lines x a and x b. Given a demand curve, having price as a function of quantity, p f (x) at height k is the curve f ( x, Clculus for Businss nd Socil Scincs - Prof D Yun Finl Em Rviw vrsion 5/9/7 Chck wbsit for ny postd typos nd updts Pls rport ny typos This rviw sht contins summris of nw topics only (This rviw sht dos hv

More information

1 Introduction to Modulo 7 Arithmetic

1 Introduction to Modulo 7 Arithmetic 1 Introution to Moulo 7 Arithmti Bor w try our hn t solvin som hr Moulr KnKns, lt s tk los look t on moulr rithmti, mo 7 rithmti. You ll s in this sminr tht rithmti moulo prim is quit irnt rom th ons w

More information

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes. Nm: UCA ID Numr: Stion lttr: th 61 : Disrt Struturs Finl Exm Instrutor: Ciprin nolsu You hv 180 minuts. No ooks, nots or lultors r llow. Do not us your own srth ppr. 1. (2 points h) Tru/Fls: Cirl th right

More information

HIGHER ORDER DIFFERENTIAL EQUATIONS

HIGHER ORDER DIFFERENTIAL EQUATIONS Prof Enriqu Mtus Nivs PhD in Mthmtis Edution IGER ORDER DIFFERENTIAL EQUATIONS omognous linr qutions with onstnt offiints of ordr two highr Appl rdution mthod to dtrmin solution of th nonhomognous qution

More information

Additional Math (4047) Paper 2 (100 marks) y x. 2 d. d d

Additional Math (4047) Paper 2 (100 marks) y x. 2 d. d d Aitional Math (07) Prpar b Mr Ang, Nov 07 Fin th valu of th constant k for which is a solution of th quation k. [7] Givn that, Givn that k, Thrfor, k Topic : Papr (00 marks) Tim : hours 0 mins Nam : Aitional

More information

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim's Alorithm Introution Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #33 3 Alorithm Gnrl Constrution Mik Joson (Univrsity o Clry)

More information

SOLAR SYSTEM STABILITY EXPLAINED UNDER THE N-BODY PROBLEM SOLUTION

SOLAR SYSTEM STABILITY EXPLAINED UNDER THE N-BODY PROBLEM SOLUTION SOLAR SYSTEM STABILITY EXPLAINED UNDER THE N-BODY PROBLEM SOLUTION Jorg A Franco R E-ail: gorgafr@gailco Abstract: Th priction of th ovnt of a group of N gravitationally attracting bois aroun its cntr

More information

Chapter 10. The singular integral Introducing S(n) and J(n)

Chapter 10. The singular integral Introducing S(n) and J(n) Chaptr Th singular intgral Our aim in this chaptr is to rplac th functions S (n) and J (n) by mor convnint xprssions; ths will b calld th singular sris S(n) and th singular intgral J(n). This will b don

More information

Floating Point Number System -(1.3)

Floating Point Number System -(1.3) Floting Point Numbr Sstm -(.3). Floting Point Numbr Sstm: Comutrs rrsnt rl numbrs in loting oint numbr sstm: F,k,m,M 0. 3... k ;0, 0 i, i,...,k, m M. Nottions: th bs 0, k th numbr o igts in th bs xnsion

More information

BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES

BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES BINOMIAL COEFFICIENTS INVOLVING INFINITE POWERS OF PRIMES DONALD M. DAVIS Abstract. If p is a prim (implicit in notation and n a positiv intgr, lt ν(n dnot th xponnt of p in n, and U(n n/p ν(n, th unit

More information

Floating Point Number System -(1.3)

Floating Point Number System -(1.3) Floting Point Numbr Sstm -(.3). Floting Point Numbr Sstm: Comutrs rrsnt rl numbrs in loting oint numbr sstm: F,k,m,M 0. 3... k ;0, 0 i, i,...,k, m M. Nottions: th bs 0, k th numbr o igits in th bs xnsion

More information

4. (5a + b) 7 & x 1 = (3x 1)log 10 4 = log (M1) [4] d = 3 [4] T 2 = 5 + = 16 or or 16.

4. (5a + b) 7 & x 1 = (3x 1)log 10 4 = log (M1) [4] d = 3 [4] T 2 = 5 + = 16 or or 16. . 7 7 7... 7 7 (n )0 7 (M) 0(n ) 00 n (A) S ((7) 0(0)) (M) (7 00) 8897 (A). (5a b) 7 7... (5a)... (M) 7 5 5 (a b ) 5 5 a b (M)(A) So th cofficint is 75 (A) (C) [] S (7 7) (M) () 8897 (A) (C) [] 5. x.55

More information

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1. Why th Juntion Tr lgorithm? Th Juntion Tr lgorithm hris Willims 1 Shool of Informtis, Univrsity of Einurgh Otor 2009 Th JT is gnrl-purpos lgorithm for omputing (onitionl) mrginls on grphs. It os this y

More information

INF5820/INF9820 LANGUAGE TECHNOLOGICAL APPLICATIONS. Jan Tore Lønning, Lecture 4, 14 Sep

INF5820/INF9820 LANGUAGE TECHNOLOGICAL APPLICATIONS. Jan Tore Lønning, Lecture 4, 14 Sep INF5820/INF9820 LANGUAGE TECHNOLOGICAL ALICATIONS Jn Tor Lønning Lctur 4 4 Sp. 206 tl@ii.uio.no Tody 2 Sttisticl chin trnsltion: Th noisy chnnl odl Word-bsd Trining IBM odl 3 SMT xpl 4 En kokk lgd n rtt

More information

Chapter 16. 1) is a particular point on the graph of the function. 1. y, where x y 1

Chapter 16. 1) is a particular point on the graph of the function. 1. y, where x y 1 Prctic qustions W now tht th prmtr p is dirctl rltd to th mplitud; thrfor, w cn find tht p. cos d [ sin ] sin sin Not: Evn though ou might not now how to find th prmtr in prt, it is lws dvisl to procd

More information

First order differential equation Linear equation; Method of integrating factors

First order differential equation Linear equation; Method of integrating factors First orr iffrntial quation Linar quation; Mtho of intgrating factors Exampl 1: Rwrit th lft han si as th rivativ of th prouct of y an som function by prouct rul irctly. Solving th first orr iffrntial

More information

The second condition says that a node α of the tree has exactly n children if the arity of its label is n.

The second condition says that a node α of the tree has exactly n children if the arity of its label is n. CS 6110 S14 Hanout 2 Proof of Conflunc 27 January 2014 In this supplmntary lctur w prov that th λ-calculus is conflunt. This is rsult is u to lonzo Church (1903 1995) an J. arkly Rossr (1907 1989) an is

More information

Lecture contents. Bloch theorem k-vector Brillouin zone Almost free-electron model Bands Effective mass Holes. NNSE 508 EM Lecture #9

Lecture contents. Bloch theorem k-vector Brillouin zone Almost free-electron model Bands Effective mass Holes. NNSE 508 EM Lecture #9 Lctur contnts Bloch thorm -vctor Brillouin zon Almost fr-lctron modl Bnds ffctiv mss Hols Trnsltionl symmtry: Bloch thorm On-lctron Schrödingr qution ch stt cn ccommo up to lctrons: If Vr is priodic function:

More information

SECTION where P (cos θ, sin θ) and Q(cos θ, sin θ) are polynomials in cos θ and sin θ, provided Q is never equal to zero.

SECTION where P (cos θ, sin θ) and Q(cos θ, sin θ) are polynomials in cos θ and sin θ, provided Q is never equal to zero. SETION 6. 57 6. Evaluation of Dfinit Intgrals Exampl 6.6 W hav usd dfinit intgrals to valuat contour intgrals. It may com as a surpris to larn that contour intgrals and rsidus can b usd to valuat crtain

More information

UNIT # 08 (PART - I)

UNIT # 08 (PART - I) . r. d[h d[h.5 7.5 mol L S d[o d[so UNIT # 8 (PRT - I CHEMICL INETICS EXERCISE # 6. d[ x [ x [ x. r [X[C ' [X [[B r '[ [B [C. r [NO [Cl. d[so d[h.5 5 mol L S d[nh d[nh. 5. 6. r [ [B r [x [y r' [x [y r'

More information

Calculus Revision A2 Level

Calculus Revision A2 Level alculus Rvision A Lvl Tabl of drivativs a n sin cos tan d an sc n cos sin Fro AS * NB sc cos sc cos hain rul othrwis known as th function of a function or coposit rul. d d Eapl (i) (ii) Obtain th drivativ

More information

a b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued...

a b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued... Progrssiv Printing T.M. CPITLS g 4½+ Th sy, fun (n FR!) wy to tch cpitl lttrs. ook : C o - For Kinrgrtn or First Gr (not for pr-school). - Tchs tht cpitl lttrs mk th sm souns s th littl lttrs. - Tchs th

More information

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari Grphs CSC 1300 Disrt Struturs Villnov Univrsity Grphs Grphs r isrt struturs onsis?ng of vr?s n gs tht onnt ths vr?s. Grphs n us to mol: omputr systms/ntworks mthm?l rl?ons logi iruit lyout jos/prosss f

More information

Designing A Concrete Arch Bridge

Designing A Concrete Arch Bridge This is th mous Shwnh ri in Switzrln, sin y Rort Millrt in 1933. It spns 37.4 mtrs (122 t) n ws sin usin th sm rphil mths tht will monstrt in this lsson. To pro with this lsson, lik on th Nxt utton hr

More information

Similarity Search. The Binary Branch Distance. Nikolaus Augsten.

Similarity Search. The Binary Branch Distance. Nikolaus Augsten. Similrity Srh Th Binry Brnh Distn Nikolus Augstn nikolus.ugstn@sg..t Dpt. of Computr Sins Univrsity of Slzurg http://rsrh.uni-slzurg.t Vrsion Jnury 11, 2017 Wintrsmstr 2016/2017 Augstn (Univ. Slzurg) Similrity

More information

CBSE 2015 FOREIGN EXAMINATION

CBSE 2015 FOREIGN EXAMINATION CBSE 05 FOREIGN EXAMINATION (Sris SSO Cod No 65//F, 65//F, 65//F : Forign Rgion) Not tht ll th sts hv sm qustions Onl thir squnc of pprnc is diffrnt M Mrks : 00 Tim Allowd : Hours SECTION A Q0 Find th

More information

Combinatorial Networks Week 1, March 11-12

Combinatorial Networks Week 1, March 11-12 1 Nots on March 11 Combinatorial Ntwors W 1, March 11-1 11 Th Pigonhol Principl Th Pigonhol Principl If n objcts ar placd in hols, whr n >, thr xists a box with mor than on objcts 11 Thorm Givn a simpl

More information

QUESTIONS BEGIN HERE!

QUESTIONS BEGIN HERE! Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt of Computr n Informtion Sins CSCI 710 (Trnoff) Disrt Struturs TEST for Fll Smstr, 00 R this for strtin! This tst is los ook

More information

9 Kinetic Theory of Gases

9 Kinetic Theory of Gases Contnt 9 Kintic hory of Gass By Liw Sau oh 9. Ial gas quation 9. rssur of a gas 9. Molcular kintic nrgy 9.4 h r..s. sp of olculs 9.5 Dgrs of fro an law of quipartition of nrgy 9.6 Intrnal nrgy of an ial

More information

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review rmup CSE 7: AVL trs rmup: ht is n invrint? Mihl L Friy, Jn 9, 0 ht r th AVL tr invrints, xtly? Disuss with your nighor. AVL Trs: Invrints Intrlu: Exploring th ln invrint Cor i: xtr invrint to BSTs tht

More information

a 1and x is any real number.

a 1and x is any real number. Calcls Nots Eponnts an Logarithms Eponntial Fnction: Has th form y a, whr a 0, a an is any ral nmbr. Graph y, Graph y ln y y Th Natral Bas (Elr s nmbr): An irrational nmbr, symboliz by th lttr, appars

More information

FSA. CmSc 365 Theory of Computation. Finite State Automata and Regular Expressions (Chapter 2, Section 2.3) ALPHABET operations: U, concatenation, *

FSA. CmSc 365 Theory of Computation. Finite State Automata and Regular Expressions (Chapter 2, Section 2.3) ALPHABET operations: U, concatenation, * CmSc 365 Thory of Computtion Finit Stt Automt nd Rgulr Exprssions (Chptr 2, Sction 2.3) ALPHABET oprtions: U, conctntion, * otin otin Strings Form Rgulr xprssions dscri Closd undr U, conctntion nd * (if

More information

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals Intgrtion Continud Intgrtion y Prts Solving Dinit Intgrls: Ar Undr Curv Impropr Intgrls Intgrtion y Prts Prticulrly usul whn you r trying to tk th intgrl o som unction tht is th product o n lgric prssion

More information

Andre Schneider P621

Andre Schneider P621 ndr Schnidr P61 Probl St #03 Novbr 6, 009 1 Srdnicki 10.3 Vrtx for L 1 = gχϕ ϕ. Th vrtx factor is ig. ϕ ig χ ϕ igur 1: ynan diagra for L 1 = gχϕ ϕ. Srdnicki 11.1 a) Dcay rat for th raction ig igur : ynan

More information

CIVL 8/ D Boundary Value Problems - Rectangular Elements 1/7

CIVL 8/ D Boundary Value Problems - Rectangular Elements 1/7 CIVL / -D Boundr Vlu Prolms - Rctngulr Elmnts / RECANGULAR ELEMENS - In som pplictions, it m mor dsirl to us n lmntl rprsnttion of th domin tht hs four sids, ithr rctngulr or qudriltrl in shp. Considr

More information

Case Study VI Answers PHA 5127 Fall 2006

Case Study VI Answers PHA 5127 Fall 2006 Qustion. A ptint is givn 250 mg immit-rls thophyllin tblt (Tblt A). A wk ltr, th sm ptint is givn 250 mg sustin-rls thophyllin tblt (Tblt B). Th tblts follow on-comprtmntl mol n hv first-orr bsorption

More information

The Theory of Small Reflections

The Theory of Small Reflections Jim Stils Th Univ. of Knss Dt. of EECS 4//9 Th Thory of Smll Rflctions /9 Th Thory of Smll Rflctions Rcll tht w nlyzd qurtr-wv trnsformr usg th multil rflction viw ot. V ( z) = + β ( z + ) V ( z) = = R

More information

PROOF OF FIRST STANDARD FORM OF NONELEMENTARY FUNCTIONS

PROOF OF FIRST STANDARD FORM OF NONELEMENTARY FUNCTIONS Intrnational Journal Of Advanc Rsarch In Scinc And Enginring http://www.ijars.com IJARSE, Vol. No., Issu No., Fbruary, 013 ISSN-319-8354(E) PROOF OF FIRST STANDARD FORM OF NONELEMENTARY FUNCTIONS 1 Dharmndra

More information

MASSACHUSETTS INSTITUTE OF TECHNOLOGY HAYSTACK OBSERVATORY WESTFORD, MASSACHUSETTS

MASSACHUSETTS INSTITUTE OF TECHNOLOGY HAYSTACK OBSERVATORY WESTFORD, MASSACHUSETTS VSRT MEMO #05 MASSACHUSETTS INSTITUTE OF TECHNOLOGY HAYSTACK OBSERVATORY WESTFORD, MASSACHUSETTS 01886 Fbrury 3, 009 Tlphon: 781-981-507 Fx: 781-981-0590 To: VSRT Group From: Aln E.E. Rogrs Subjct: Simplifid

More information

Higher order derivatives

Higher order derivatives Robrto s Nots on Diffrntial Calculus Chaptr 4: Basic diffrntiation ruls Sction 7 Highr ordr drivativs What you nd to know alrady: Basic diffrntiation ruls. What you can larn hr: How to rpat th procss of

More information

10. The Discrete-Time Fourier Transform (DTFT)

10. The Discrete-Time Fourier Transform (DTFT) Th Discrt-Tim Fourir Transform (DTFT Dfinition of th discrt-tim Fourir transform Th Fourir rprsntation of signals plays an important rol in both continuous and discrt signal procssing In this sction w

More information

Mathematics. Mathematics 3. hsn.uk.net. Higher HSN23000

Mathematics. Mathematics 3. hsn.uk.net. Higher HSN23000 Highr Mthmtics UNIT Mthmtics HSN000 This documnt ws producd spcilly for th HSN.uk.nt wbsit, nd w rquir tht ny copis or drivtiv works ttribut th work to Highr Still Nots. For mor dtils bout th copyright

More information

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths. How os it work? Pl vlu o imls rprsnt prts o whol numr or ojt # 0 000 Tns o thousns # 000 # 00 Thousns Hunrs Tns Ons # 0 Diml point st iml pl: ' 0 # 0 on tnth n iml pl: ' 0 # 00 on hunrth r iml pl: ' 0

More information

SAFE HANDS & IIT-ian's PACE EDT-15 (JEE) SOLUTIONS

SAFE HANDS & IIT-ian's PACE EDT-15 (JEE) SOLUTIONS It is not possibl to find flu through biggr loop dirctly So w will find cofficint of mutual inductanc btwn two loops and thn find th flu through biggr loop Also rmmbr M = M ( ) ( ) EDT- (JEE) SOLUTIONS

More information

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018 CSE 373: Mor on grphs; DFS n BFS Mihl L Wnsy, F 14, 2018 1 Wrmup Wrmup: Disuss with your nighor: Rmin your nighor: wht is simpl grph? Suppos w hv simpl, irt grph with x nos. Wht is th mximum numr of gs

More information

Linear-Phase FIR Transfer Functions. Functions. Functions. Functions. Functions. Functions. Let

Linear-Phase FIR Transfer Functions. Functions. Functions. Functions. Functions. Functions. Let It is impossibl to dsign an IIR transfr function with an xact linar-phas It is always possibl to dsign an FIR transfr function with an xact linar-phas rspons W now dvlop th forms of th linarphas FIR transfr

More information

MA1506 Tutorial 2 Solutions. Question 1. (1a) 1 ) y x. e x. 1 exp (in general, Integrating factor is. ye dx. So ) (1b) e e. e c.

MA1506 Tutorial 2 Solutions. Question 1. (1a) 1 ) y x. e x. 1 exp (in general, Integrating factor is. ye dx. So ) (1b) e e. e c. MA56 utorial Solutions Qustion a Intgrating fator is ln p p in gnral, multipl b p So b ln p p sin his kin is all a Brnoulli quation -- st Sin w fin Y, Y Y, Y Y p Qustion Dfin v / hn our quation is v μ

More information

Basic Polyhedral theory

Basic Polyhedral theory Basic Polyhdral thory Th st P = { A b} is calld a polyhdron. Lmma 1. Eithr th systm A = b, b 0, 0 has a solution or thr is a vctorπ such that π A 0, πb < 0 Thr cass, if solution in top row dos not ist

More information

EE1000 Project 4 Digital Volt Meter

EE1000 Project 4 Digital Volt Meter Ovrviw EE1000 Projt 4 Diitl Volt Mtr In this projt, w mk vi tht n msur volts in th rn o 0 to 4 Volts with on iit o ury. Th input is n nlo volt n th output is sinl 7-smnt iit tht tlls us wht tht input s

More information

Square of Hamilton cycle in a random graph

Square of Hamilton cycle in a random graph Squar of Hamilton cycl in a random graph Andrzj Dudk Alan Friz Jun 28, 2016 Abstract W show that p = n is a sharp thrshold for th random graph G n,p to contain th squar of a Hamilton cycl. This improvs

More information

Multi-Section Coupled Line Couplers

Multi-Section Coupled Line Couplers /0/009 MultiSction Coupld Lin Couplrs /8 Multi-Sction Coupld Lin Couplrs W cn dd multipl coupld lins in sris to incrs couplr ndwidth. Figur 7.5 (p. 6) An N-sction coupld lin l W typiclly dsign th couplr

More information

Recall that by Theorems 10.3 and 10.4 together provide us the estimate o(n2 ), S(q) q 9, q=1

Recall that by Theorems 10.3 and 10.4 together provide us the estimate o(n2 ), S(q) q 9, q=1 Chaptr 11 Th singular sris Rcall that by Thorms 10 and 104 togthr provid us th stimat 9 4 n 2 111 Rn = SnΓ 2 + on2, whr th singular sris Sn was dfind in Chaptr 10 as Sn = q=1 Sq q 9, with Sq = 1 a q gcda,q=1

More information

CSC Design and Analysis of Algorithms. Example: Change-Making Problem

CSC Design and Analysis of Algorithms. Example: Change-Making Problem CSC 801- Dsign n Anlysis of Algorithms Ltur 11 Gry Thniqu Exmpl: Chng-Mking Prolm Givn unlimit mounts of oins of nomintions 1 > > m, giv hng for mount n with th lst numr of oins Exmpl: 1 = 25, 2 =10, =

More information

13. Binary tree, height 4, eight terminal vertices 14. Full binary tree, seven vertices v 7 v13. v 19

13. Binary tree, height 4, eight terminal vertices 14. Full binary tree, seven vertices v 7 v13. v 19 0. Spnning Trs n Shortst Pths 0. Consir th tr shown blow with root v 0.. Wht is th lvl of v 8? b. Wht is th lvl of v 0? c. Wht is th hight of this root tr?. Wht r th chilrn of v 0?. Wht is th prnt of v

More information

Construction 11: Book I, Proposition 42

Construction 11: Book I, Proposition 42 Th Visul Construtions of Euli Constrution #11 73 Constrution 11: Book I, Proposition 42 To onstrut, in givn rtilinl ngl, prlllogrm qul to givn tringl. Not: Equl hr mns qul in r. 74 Constrution # 11 Th

More information

MASTER CLASS PROGRAM UNIT 4 SPECIALIST MATHEMATICS SEMESTER TWO 2014 WEEK 11 WRITTEN EXAMINATION 1 SOLUTIONS

MASTER CLASS PROGRAM UNIT 4 SPECIALIST MATHEMATICS SEMESTER TWO 2014 WEEK 11 WRITTEN EXAMINATION 1 SOLUTIONS MASTER CLASS PROGRAM UNIT SPECIALIST MATHEMATICS SEMESTER TWO WEEK WRITTEN EXAMINATION SOLUTIONS FOR ERRORS AND UPDATES, PLEASE VISIT WWW.TSFX.COM.AU/MC-UPDATES QUESTION () Lt p ( z) z z z If z i z ( is

More information

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1 CSC 00 Disrt Struturs : Introuon to Grph Thory Grphs Grphs CSC 00 Disrt Struturs Villnov Univrsity Grphs r isrt struturs onsisng o vrs n gs tht onnt ths vrs. Grphs n us to mol: omputr systms/ntworks mthml

More information

Numbering Boundary Nodes

Numbering Boundary Nodes Numring Bounry Nos Lh MBri Empori Stt Univrsity August 10, 2001 1 Introution Th purpos of this ppr is to xplor how numring ltril rsistor ntworks ffts thir rspons mtrix, Λ. Morovr, wht n lrn from Λ out

More information

LINEAR DELAY DIFFERENTIAL EQUATION WITH A POSITIVE AND A NEGATIVE TERM

LINEAR DELAY DIFFERENTIAL EQUATION WITH A POSITIVE AND A NEGATIVE TERM Elctronic Journal of Diffrntial Equations, Vol. 2003(2003), No. 92, pp. 1 6. ISSN: 1072-6691. URL: http://jd.math.swt.du or http://jd.math.unt.du ftp jd.math.swt.du (login: ftp) LINEAR DELAY DIFFERENTIAL

More information

Minimum Spanning Trees

Minimum Spanning Trees Yufi Tao ITEE Univrsity of Qunslan In tis lctur, w will stuy anotr classic prolm: finin a minimum spannin tr of an unirct wit rap. Intrstinly, vn tou t prolm appars ratr iffrnt from SSSP (sinl sourc sortst

More information

Elliptical motion, gravity, etc

Elliptical motion, gravity, etc FW Physics 130 G:\130 lctur\ch 13 Elliticl motion.docx g 1 of 7 11/3/010; 6:40 PM; Lst rintd 11/3/010 6:40:00 PM Fig. 1 Elliticl motion, grvity, tc minor xis mjor xis F 1 =A F =B C - D, mjor nd minor xs

More information

Limits Indeterminate Forms and L Hospital s Rule

Limits Indeterminate Forms and L Hospital s Rule Limits Indtrmint Forms nd L Hospitl s Rul I Indtrmint Form o th Tp W hv prviousl studid its with th indtrmint orm s shown in th ollowin mpls: Empl : Empl : tn [Not: W us th ivn it ] Empl : 8 h 8 [Not:

More information

Einstein Equations for Tetrad Fields

Einstein Equations for Tetrad Fields Apiron, Vol 13, No, Octobr 006 6 Einstin Equations for Ttrad Filds Ali Rıza ŞAHİN, R T L Istanbul (Turky) Evry mtric tnsor can b xprssd by th innr product of ttrad filds W prov that Einstin quations for

More information

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)} Introution Computr Sin & Enginring 423/823 Dsign n Anlysis of Algorithms Ltur 03 Elmntry Grph Algorithms (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) I Grphs r strt t typs tht r pplil to numrous

More information

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph Intrntionl J.Mth. Comin. Vol.1(2014), 80-86 Algorithmi n NP-Compltnss Aspts of Totl Lit Domintion Numr of Grph Girish.V.R. (PES Institut of Thnology(South Cmpus), Bnglor, Krntk Stt, Ini) P.Ush (Dprtmnt

More information

Equidistribution and Weyl s criterion

Equidistribution and Weyl s criterion Euidistribution and Wyl s critrion by Brad Hannigan-Daly W introduc th ida of a sunc of numbrs bing uidistributd (mod ), and w stat and prov a thorm of Hrmann Wyl which charactrizs such suncs. W also discuss

More information

If we integrate the given modulating signal, m(t), we arrive at the following FM signal:

If we integrate the given modulating signal, m(t), we arrive at the following FM signal: Part b If w intgrat th givn odulating signal, (, w arriv at th following signal: ( Acos( πf t + β sin( πf W can us anothr trigonotric idntity hr. ( Acos( β sin( πf cos( πf Asin( β sin( πf sin( πf Now,

More information

An Introduction to Trigonometry

An Introduction to Trigonometry n Introduction to Trigonoetry First of ll, let s check out the right ngled tringle below. The LETTERS, B & C indicte the ngles nd the letters, b & c indicte the sides. c b It is iportnt to note tht side

More information

ECE 407 Computer Aided Design for Electronic Systems. Instructor: Maria K. Michael. Overview. CAD tools for multi-level logic synthesis:

ECE 407 Computer Aided Design for Electronic Systems. Instructor: Maria K. Michael. Overview. CAD tools for multi-level logic synthesis: 407 Computr Aidd Dsign for Elctronic Systms Multi-lvl Logic Synthsis Instructor: Maria K. Michal 1 Ovrviw Major Synthsis Phass Logic Synthsis: 2-lvl Multi-lvl FSM CAD tools for multi-lvl logic synthsis:

More information

Legendre Wavelets for Systems of Fredholm Integral Equations of the Second Kind

Legendre Wavelets for Systems of Fredholm Integral Equations of the Second Kind World Applid Scincs Journal 9 (9): 8-, ISSN 88-495 IDOSI Publications, Lgndr Wavlts for Systs of Frdhol Intgral Equations of th Scond Kind a,b tb (t)= a, a,b a R, a. J. Biazar and H. Ebrahii Dpartnt of

More information

MATHEMATICS PAPER IB COORDINATE GEOMETRY(2D &3D) AND CALCULUS. Note: This question paper consists of three sections A,B and C.

MATHEMATICS PAPER IB COORDINATE GEOMETRY(2D &3D) AND CALCULUS. Note: This question paper consists of three sections A,B and C. MATHEMATICS PAPER IB COORDINATE GEOMETRY(D &D) AND CALCULUS. TIME : hrs Ma. Marks.75 Not: This qustion papr consists of thr sctions A,B and C. SECTION A VERY SHORT ANSWER TYPE QUESTIONS. 0X =0.If th portion

More information