# A linear recurrence sequence of composite numbers

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 LMS J Comput Math 15 (2012) C 2012 Author do:101112/s A lnear recurrence sequence of composte numbers Jonas Šurys Abstract We prove that for each postve nteger k n the range 2 k 10 and for each postve nteger k 79 (mod 120) there s a k-step Fbonacc-lke sequence of composte numbers and gve some examples of such sequences Ths s a natural extenson of a result of Graham for the Fbonacc-lke sequence 1 Introducton For each nteger k 2 one can defne a k-step Fbonacc-lke sequence, that s, the sequence of ntegers (x n ) n=0 satsfyng the followng relaton x n = k =1 for n = k, k + 1, k + 2, Snce the values of x 0, x 1,, x determne the k-step Fbonacc-lke sequence we denote t by S k (x 0, x 1,, x ) The terms of the sequence S k (0, 0,, 0, 1) are well-known Fbonacc k-step numbers Flores [4] developed the calculaton of Fbonacc k-step numbers wthout recurson Noe and Post [9] showed that Fbonacc k-step numbers are nearly devod of prmes n the frst terms for k 100 The am of ths paper s to prove the followng theorem Theorem 11 For each postve nteger k n the range 2 k 10 and for each postve nteger k 79 (mod 120) there are postve ntegers a 0, a 1,, a such that gcd(a 0, a 1,, a ) = 1 and the sequence S k (a 0, a 1,, a ) conssts of composte numbers only x n Graham [5] proved Theorem 11 for k = 2 n 1964 He showed that the sequence S 2 ( , ) contans no prme numbers Several authors (see [7, 8, 15]) made progress n fndng smaller ntal values Currently, the smallest known sequence (n the sense that the maxmum of the frst two elements s the smallest postve nteger) s due to Vsemrnov [14]: S 2 ( , ) The complete analyss of a bnary lnear recurrence sequence of composte numbers s gven n [12] and ndependently n [3] If (c 1, c 2 ) Z 2, where c 2 0 and (c 1, c 2 ) (±2, 1), then there exst two postve relatvely prme composte ntegers a 0, a 1 such that the sequence gven by a n+1 = c 1 a n + c 2 a n 1, n = 1, 2,, conssts of composte numbers only Alternatvely, t s easly seen that for (c 1, c 2 ) = (±2, 1) every non-perodc sequence a n+1 = c 1 a n + c 2 a n 1, n = 1, 2,, wth gcd(a 0, a 1 ) = 1 contans nfntely many prme numbers Somer [12] was usng deep results of Blu et al [1], Cho [2], and also the theorem of Parnam and Shorey [11] Receved 24 February 2012; revsed 27 July Mathematcs Subject Classfcaton 11B37 (prmary), 11B39, 11B50, 11Y55 (secondary)

2 A LINEAR RECURRENCE SEQUENCE OF COMPOSITE NUMBERS 361 n hs proof, whle [3] contans some explct calculatons, and examples of sequences for fxed c 1, c 2 and the proof do not use external results All proofs of Theorem 11 for k = 2 are based on the fact that the Fbonacc sequence s a regular dvsblty sequence, that s, F 0 = 0 and F n F m f n m However, by a result of Hall [6], there are no regular dvsblty sequences n the case S(0, a 1, a 2 ) for any a 1, a 2 Z These dffcultes have recently been overcome, and Theorem 11 was proved for k = 3 n [13], where we constructed the sequence S 3 ( , , ) of composte numbers Secton 3 of ths paper s devoted to the generalsaton of the proof developed n [13] We wll descrbe the set of postve nteger trples and show how to prove Theorem 11 f ths set s gven In 4 we wll prove Theorem 11 for all k 79 (mod 120) and construct correspondng sequences for these cases Fnally, we wll gve an algorthm for the constructon of the set of postve nteger trples, and lst examples of k-step Fbonacc-lke sequences for k n the range 4 k 10 2 Auxlary lemmas We start wth the followng elementary property of the k-step Fbonacc-lke sequence Let a = (a 0, a 1,, a ) Z k Defne S k (a) = S k (a 0, a 1,, a ) We wll denote by F k the set of all k-step Fbonacc-lke sequences Lemma 21 We have that F k s a free abelan group of rank k, and the map s an somorphsm of abelan groups Z k F k, The proof of ths fact s straghtforward Defne a S k (a) (s () n ) n=0 = S k (δ 0, δ 1,, δ ) for = 1, 2,, k 1, where δj s Kronecker s delta symbol Let p be a prme number and let (y n ) n=0 S k (0, a 1, a 2,, a ) (mod p) for a 1, a 2,, a Z Lemma 21 mples y n a s n () (mod p) (21) =1 Lemma 22 Fx k 3 Let p be a prme number and let (y n ) n=0 S k (0, a 1, a 2,, a ) (mod p) wth some a Z for n the range 1 k 1 Suppose that m 2 s an nteger If y m 0 (mod p) for satsfyng 1 k 1, then y lm 0 (mod p) for l = 0, 1, 2, Proof Let A =

3 362 J ŠIURYS be a k k matrx and Y n = (y n+, y n+k 2,, y n+1, y n ) Then the recurrence relaton y n+k = y n+ + y n+k y n+1 + y n can be rewrtten n the matrx form Y n+1 = Y n A, for n = 0, 1, 2 In partcular, Y n = Y 0 A n and Y lm = (y lm+, y lm+k 2,, y lm+1, y lm ) = (y, y k 2,, y 1, y 0 )(A m ) l (22) Let B = A m Ths s a k k matrx wth nteger coeffcents By the Cayley Hamlton theorem, B k = b 0 I + b 1 B + b 2 B b B, for some ntegers b 0, b 1,, b Snce Y lm = Y 0 B l we fnd that Y lm = b 0 Y (l k)m + b 1 Y (l k+1)m + + b Y (l 1)m for l k Consderng the last entres for these vectors, we have that The lemma follows by nducton Defne the matrx y lm = b 0 y (l k)m + b 1 y (l k+1)m + + b y (l 1)m B k,m = s (1) m s (1) 2m s (1) ()m s (2) m s (2) 2m s (2) ()m s () m s () 2m s () ()m for each postve nteger m Let B k,m be the determnant of the matrx (23) (23) Lemma 23 Let m 2 be an nteger If p s prme number and B k,m 0 (mod p) then there exst a 1, a 2,, a Z such that a s not dvsble by p for at least one = 1, 2, k 1, and a s () lm 0 (mod p) for l = 0, 1, 2, =1 Proof Set y n = =1 a s () n Snce y 0 = =1 a s () 0 = 0, by Lemma 22, t suffces to show that there exst sutable a 1, a 2,, a Z such that y lm 0 (mod p) for l = 1, 2,, k 1 Our am s to solve the followng system of lnear equatons: (a 1, a 2,, a )B k,m (0, 0,, 0) (mod p) (24) Let us consder system (24) as a homogeneous lnear system over the fnte feld Z/pZ The assumpton B k,m 0 (mod p) mples that the rank of the system (24) s at most k 2 Therefore, the system has a non-trval soluton n Z/pZ In other words, there exst a 1, a 2,, a Z such that a s not dvsble by p for at least one = 1, 2, k 1 3 General case Let I be a postve nteger (to be defned later) Our goal s to fnd a fnte set S k (N) of postve nteger trples (p, m, r ) ( = 1, 2,, I) wth the followng propertes

4 A LINEAR RECURRENCE SEQUENCE OF COMPOSITE NUMBERS 363 (1) Each p s a prme number and p p j f j (2) The postve nteger p dvdes the determnant B k,m, where B k,m s the matrx (23) (3) The congruences x r (mod m ) (31) cover the ntegers; that s, for any nteger x there s some ndex, 1 I, such that x r (mod m ) Now, suppose that we already found the set S k (N) and that I s a fxed postve nteger Choose, where 1 I Snce B k,m 0 (mod p ), by Lemma 23, there exst a,1, a,2,, a, Z such that a,j s not dvsble by p for at least one j = 1, 2, k 1, and j=1 a,j s (j) lm 0 (mod p ) (32) for l = 0, 1, 2, We shall construct the sequence (x n ) n=0 = S k (x 0, x 1,, x ) satsfyng for n = 0, 1, 2, Set x n s (j) m r +n a,j (mod p ) = 1, 2, I (33) j=1 A,0 = s (j) m r a,j, j=1 A,1 = s (j) m a r +1,j, j=1 (34) A, = s (j) m a r +,j j=1 for = 1, 2,, I Snce the sequence (x n ) n=0 s defned by ts frst k terms, t suffces to solve the followng equatons: x 0 A,0 (mod p ), x 1 A,1 (mod p ), x A, (mod p ) for = 1, 2,, I By the Chnese remander theorem, the system of congruences (35) has the postve nteger soluton x 0 = X 0, x 1 = X 1,, x = X It s assumed that gcd(x 0, X 1,, X ) = 1 By (32) and (33), p dvdes x n f n r (mod m ), where {1, 2,, I} Snce congruences (31) cover the ntegers, we see that for every non-negatve nteger n there s some, 1 I, such that p dvdes x n The sequence (x n ) n=i s strctly ncreasng, so x n must be composte for n I In ths way, we can construct the k-step Fbonacc-lke sequence of composte numbers (x n ) n=i f the set S k(n) s gven Note that the assumpton gcd(x 0, X 1,, X ) = 1 s unnecessarly restrctve We can always construct the soluton of (35) wth ths property Indeed, let gcd(x 1,, X ) = d 1, gcd(x 0, d 1 ) = d 0 > 1, and P = I =1 p Suppose that p s a prme number and p d 0 If p P, (35)

5 364 J ŠIURYS then, by (35), Let C = A,0 0 A,1 0 A, 0 (mod p), (mod p), (mod p) s (1) m r s (1) m r +1 s (1) m r + s (2) m r s (2) m r +1 s (2) m r + s () m r s () m r +1 s () m r + be a (k 1) k matrx over the fnte feld Z/pZ By (34) and (36), we get (36) (a,1, a,2,, a, )C (0, 0,, 0) (mod p) (37) The system of equatons (37) has a non-trval soluton f rank(c) k 2 But s (1) m r 1 s (1) m r s (1) m r +k 2 s (2) m rank(c) = rank r 1 s (2) m r s (2) m r +k 2 s () m r 1 s () m r s () m r +k 2 s (1) 0 s (1) 1 s (1) s (2) = rank 0 s (2) 1 s (2) s () 0 s () 1 s () = rank whch s a contradcton From ths f follows that = k 1, gcd(x 0, d 1, P ) = 1 (38) It s easy to check that f (X 0, X 1,, X ) s a soluton of (35), then (X 0 + lp, X 1,, X ) s also a soluton for all ntegers l Let gcd(x 0, P ) = d; then, by Drchlet s theorem on prme numbers n arthmetc progresson, we conclude that X 0 /d + lp/d s a prme number for nfntely many ntegers l So, gcd(x 0 /d + lp/d, d 1 ) = 1 for some l It follows from (38) that gcd(x 0 + lp, d 1 ) = 1 for some l, whch s the desred concluson 4 Proof of Theorem 11 for k 79 (mod 120) In ths secton we wll show that f k 79 (mod 120), then there exst a k-step Fbonacc-lke sequence of composte numbers We wll need the followng lemma

6 A LINEAR RECURRENCE SEQUENCE OF COMPOSITE NUMBERS 365 Lemma 41 Suppose that the numbers k, p and the sequence (y n ) n=0 are defned as n Lemma 22 If there s a postve nteger l such that and l 1 n=0 y n 0 (mod p) (41) y n y n l (mod p) for n = l, l + 1, l + 2,, (42) then for every non-negatve nteger t the sequence (y (t) n ) n=0 S tl+k (y 0, y 1,, y tl+ ) (mod p) has the followng property: for n = 0, 1, 2, y (t) n y n (mod p) (43) Proof If t = 0, then the statement of the lemma s trval Let t 1 By the defnton of the sequence y n (t), n = 0, 1, 2,, (43) s true for n = 0, 1,, tl + k 1 Let r k be an nteger and suppose (43) s true for n = 0, 1, tl + r 1 By (41) and (42), r+l 1 n=r y n 0 (mod p) for any postve nteger r Thus we have tl+r 1 y (t) tl+r =r k y r 1 =r k By nducton, (43) s true for n = 0, 1, 2, y y r y tl+r (mod p) Assume that k = 4 and B 4,3 s the matrx defned n (23) It s easy to check that B 4,3 = = 11, and (1, 2, 0)B 4,3 = (0, 0, 0) (mod 11) By Lemma 23, the sequence (y n ) n=0 S 4 (0, 1, 2, 0) (mod 11) has the followng property: 11 y 3n (44) for n = 0, 1, 2, We calculate the frst elements of sequence (y n ) n=0 (mod 11): 0, 1, 2, 0, 3, 6, 0, 9, 7, 0, 5, 10, 0, 4, 8, 0, 1, 2, 0, By a smple nducton, one can prove that the sequence (y n ) n=0 (mod 11) s perodc The length of the perod s 15 and 14 =0 y 0 (mod 11) By Lemma 41 appled to k = 4, l = 15, p = 11 and to the sequence (y n ) n=0, we conclude that the sequence (y (t) n ) n=0 S 15t+4 (y 0, y 1,, y 15t+3 ) (mod 11) satsfes the property (43) for t = 0, 1, 2, It follows that (y (t) n ) n=0 satsfes the property (44) for t = 0, 1, 2,

7 366 J ŠIURYS Now, let k = 7 It s easy to check that B 7,3 = = and (1, 2, 0, 2, 4, 0)B 7,3 = (0, 0, 0, 0, 0, 0) (mod 5), (1, 2, 0, 9, 1, 0)B 7,3 = (0, 0, 0, 0, 0, 0) (mod 17) Lemma 23 mples that the sequence (u n ) n=0 S 7 (0, 1, 2, 0, 2, 4, 0) (mod 5) has the property 5 u 3n (45) for n = 0, 1, 2, and the sequence (v n ) n=0 S 7 (0, 1, 2, 0, 9, 1, 0) (mod 17) has the property 17 v 3n (46) for n = 0, 1, 2, The frst members of the sequence (u n ) n=0 (mod 5) are 0, 1, 2, 0, 2, 4, 0, 4, 3, 0, 3, 1, 0, 1, 2, 0, 2, 4, 0,, and those of the sequence (v n ) n=0 (mod 17) are 0, 1, 2, 0, 9, 1, 0, 13, 9, 0, 15, 13, 0, 16, 15, 0, 8, 16, 0, 4, 8, 0, 2, 4, 0, 1, 2, 0, 9, 1, 0 By nducton, one can prove that the sequences (u n ) n=0 and (v n ) n=0 are perodc wth the length of the perod 12 and 24, respectvely Snce 11 =0 u 0 (mod 5) and 23 =0 v 0 (mod 17), by Lemma 41 appled to (u n ) n=0 and (v n ) n=0, we derve that the sequences and (u (t) n ) n=0 S 12t+7 (u 0, u 1,, u 12t+6 ) (v (t) n ) n=0 S 24t+7 (v 0, v 1,, v 24t+6 ) satsfy the property (43) for t = 0, 1, 2, Hence, the sequence u (t) n for n = 0, 1, 2, satsfes the property (45), and the sequence v n (t) for n = 0, 1, 2, satsfes the property (46) for t = 0, 1, 2, Set t 1 = 8t + 5, t 2 = 10t + 6, t 3 = 5t + 3 for some postve nteger t Our goal s to fnd a sequence x (t) n for n = 0, 1, 2, satsfyng the followng condtons for every postve nteger n: x (t) n x (t) n x (t) n y (t1) n (mod 11), u (t2) n+1 (mod 5), v (t3) n+2 (mod 17) (47)

8 A LINEAR RECURRENCE SEQUENCE OF COMPOSITE NUMBERS 367 Usng the defnton of the sequences y (t) n, u (t) n, and v (t) n for n = 0, 1, 2, we can rewrte (47) as (x (t) n ) n=0 S 120t+79 (y 0, y 1,, y 120t+78 ) (mod 11), (x (t) n ) n=0 S 120t+79 (u 1, u 2,, u 120t+78, u 7 ) (mod 5), (x (t) n ) n=0 S 120t+79 (v 2, v 3,, v 120t+78, v 7, v 8 ) (mod 17) By the Chnese remander theorem, the system of equatons (47) has a soluton for every non-negatve nteger t For t = 0 we fnd that (x (0) n ) n=0 = S 79 (121, 782, 145, 902, 289, 710, 264, 493, 865, 693, 731, 560, 66, 697, 195, 407, 34, 310, 484, 663, 325, 803, 306, 205, 121, 357, 230, 902, 884, 30, 264, and for t > 0 we defne 408, 695, 693, 476, 50, 66, 867, 535, 407, 544, 395, 484, 323, 580, 803, 221, 35, 121, 102, 655, 902, 119, 370, 264, 918, 780, 693, 136, 305, 66, 782, 365, 407, 289, 820, 484, 493, 920, 803, 731, 120, 121, 697, 910, 902, 34, 200, 264), (x (t) n ) n=0 = S 120t+79 (x (0) 0, x(0) 1,, x(0) 120t+78 ) By (43), (47) and by the propertes (44) (46), t follows mmedately that the followng hold If n 0 (mod 3), then x (t) n 0 (mod 11) If n 1 (mod 3) then x (t) n 0 (mod 17) If n 2 (mod 3) then x (t) n 0 (mod 5) Snce x (0) n > 17 for n = 0, 1, 2,, we conclude that x (t) n for n = 0, 1, 2, s a k-step Fbonacc-lke sequence of composte numbers for k = 120t + 79 and t = 0, 1, 2, 5 An algorthm for the constructon of the set S k (N) The constructon of the set S k (N) splts nto two parts We frst generate the fnte set s k (N) = {(p 1, m 1 ), (p 2, m 2 ),, (p I, m I ), }, where p s a prme number and m s a postve nteger (Algorthm 1) Then we try to construct the coverng system {r 1 (mod m 1 ), r 2 (mod m 2 ),, r I (mod m I )} for I I Algorthm 2 gves the answer I can t construct a coverng system or returns a coverng system In the second case, we construct the set S k (N) = {(p, m, r )} These algorthms were mplemented usng a computer algebra system PARI/GP [10] The only thng we can control n the constructon of the set S k (N) s the nteger N If Algorthm 2 gves an answer I can t construct a coverng system, then we can try to choose a dfferent N and try agan We can have dfferent sets S k (N) for dfferent values of N The mplementaton of these algorthms takes less than one mnute to gve an answer on a modestly powered computer (Athlon XP 2100+) for 3 k 10 and for good choce of N Defne A N = {1, 2,, N} for some postve nteger N and let A N (m, r) = {a a A N, a r (mod m)} Emprcal results suggest that we can choose sutable a N for any postve nteger k 2, so we state a followng conjecture Conjecture 1 Let k 2 be some fxed postve nteger Then there exst postve ntegers a 0, a 1,, a such that gcd(a 0, a 1,, a ) = 1 and the sequence S k (a 0, a 1,, a ) contans no prme numbers

9 368 J ŠIURYS Algorthm 1 Construct the set s k (N) Requre: k 2, N 2 Ensure: The set s k (N) 1: prmes lst {} 2: s k (N) {} 3: dvsors lst lst of N dvsors 4: for d dvsors lst do 5: Construct the matrx B k,d {see 2} 6: determnant B k,d 7: factors lst prme factors of determnant 8: for factor factors lst do 9: f factor prmes lst then 10: Put factor n prmes lst 11: Put (factor, dvsor) n s k (N) 12: end f 13: end for 14: end for 15: return s k (N) Algorthm 2 Construct a coverng system Requre: A fnte set of postve ntegers {m 1, m 2,, m I } Ensure: The coverng system {r 1 (mod m 1 ), r 2 (mod m 2 ),, r I (mod m I )} 1: N lcm(m 1, m 2,, m I ) 2: Coverng set {} 3: B A N 4: for from 1 to I do 5: MAX 0 6: for r from 0 to m 1 do 7: f MAX < A N (m, r) B then 8: r r 9: end f 10: Put r (mod m ) n Coverng set 11: B B\A N (m, r ) 12: f B = {} then 13: return Coverng set 14: end f 15: end for 16: end for 17: prnt I can t construct a coverng system 6 Examples of sequences for k = 4, 5,, 10 Snce the case k = 2 s proved n [5] and the case k = 3 n [13], n ths secton we wll prove Theorem 11 for k = 4, 5,, 10 As was notced n 3, we only need to construct the

10 A LINEAR RECURRENCE SEQUENCE OF COMPOSITE NUMBERS 369 set S k (N) Below we lst some examples of sequences (x n ) n=0 for each k n the range 4 k 10 (x n ) n=0 = S 4 ( , , , ) (x n ) n=0 = S 5 ( , , , , ) (x n ) n=0 = S 6 ( , , , , , ) (x n ) n=0 = S 7 (49 540, , , , 9962, , ) (x n ) n=0 = S 8 ( , , , , , , , ) (x n ) n=0 = S 9 ( , , , , , , , , ) (x n ) n=0 = S 10 ( , , , , , , , , , ) Snce the set S k (N) s essental n the constructon of a k-step Fbonacc-lke sequence S k (x 0, x 1,, x ), we gve ths set for each k n the range 4 k 10 (see Tables 1 7) Table 1 The set S 4(360) p m r B 4,m

11 370 J ŠIURYS Table 2 The set S 5(16) p m r B 5,m Table 3 The set S 6(32) p m r B 6,m Table 4 The set S 7(6) p m r B 7,m Table 5 The set S 8(30) p m r B 8,m Table 6 The set S 9(12) p m r B 9,m Table 7 The set S 10(8) p m r B 10,m

12 A LINEAR RECURRENCE SEQUENCE OF COMPOSITE NUMBERS 371 Fnally, we gve the coeffcents of the system of equatons (35) (see Tables 8 15) It s necessary because n Lemma 23 we prove only the exstence of these coeffcents; that s, wth the same set S k (N) we can fnd the dfferent k-step Fbonacc-lke sequence S k (x 0, x 1,, x ) Table 8 Coeffcents of (35) for k = A, A, A, A, Table 9 Coeffcents of (35) for k = A, A, A, A, Table 10 Coeffcents of (35) for k = A, A, A, A, A, Table 11 Coeffcents of (35) for k = A, A, A, A, A, A, Table 12 Coeffcents of (35) for k = A, A, A, A, A, A, A,

13 372 J ŠIURYS Table 13 Coeffcents of (35) for k = A, A, A, A, A, A, A, A, Table 14 Coeffcents of (35) for k = A, A, A, A, A, A, A, A, A, Table 15 Coeffcents of (35) for k = A, A, A, A, A, A, A, A, A, A, References 1 Y Blu, G Hanrot, P M Vouter and M Mgnotte, Exstence of prmtve dvsors of Lucas and Lehmer numbers, J rene angew Math 539 (2001) S L G Cho, Coverng the set of ntegers by congruence classes of dstnct modul, Math Comp 25 (1971) A Dubckas, A Novkas and J Šurys, A bnary lnear recurrence sequence of composte numbers, J Number Theory 130 (2010) I Flores, Drect calculaton of k-generalzed Fbonacc numbers, Fbonacc Quart 5 (1967) R L Graham, A Fbonacc-lke sequence of composte numbers, Math Mag 37 (1964) M Hall, Dvsblty sequences of thrd order, Amer J Math 58 (1936) D E Knuth, A Fbonacc-lke sequence of composte numbers, Math Mag 63 (1990) J W Ncol, A Fbonacc-lke sequence of composte numbers, Electron J Combn 6 (1999) research paper R44

14 A LINEAR RECURRENCE SEQUENCE OF COMPOSITE NUMBERS T D Noe and J V Post, Prmes n Fbonacc n-step and Lucas n-step sequences, J Integer Seq 8 (2005) artcle The PARI Group, Bordeaux PARI/GP, verson, 235, 2006, 11 J C Parnam and T N Shorey, Subsequences of bnary recursve sequences, Acta Arth 40 (1982) L Somer, Second-order lnear recurrences of composte numbers, Fbonacc Quart 44 (2006) J Šurys, A trbonacc-lke sequence of composte numbers, Fbonacc Quart 49 (2011) M Vsemrnov, A new Fbonacc-lke sequence of composte numbers, J Integer Seq 7 (2004) artcle H S Wlf, Letters to the edtor, Math Mag 63 (1990) 284 Jonas Šurys Department of Mathematcs and Informatcs Vlnus Unversty Naugarduko 24, Vlnus LT Lthuana

### We are now ready to answer the question: What are the possible cardinalities for finite fields?

Chapter 3 Fnte felds We have seen, n the prevous chapters, some examples of fnte felds. For example, the resdue class rng Z/pZ (when p s a prme) forms a feld wth p elements whch may be dentfed wth the

### greatest common divisor

4. GCD 1 The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no

### n + d + q = 24 and.05n +.1d +.25q = 2 { n + d + q = 24 (3) n + 2d + 5q = 40 (2)

MATH 16T Exam 1 : Part I (In-Class) Solutons 1. (0 pts) A pggy bank contans 4 cons, all of whch are nckels (5 ), dmes (10 ) or quarters (5 ). The pggy bank also contans a con of each denomnaton. The total

### 8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by

6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng

### Recurrence. 1 Definitions and main statements

Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.

### v a 1 b 1 i, a 2 b 2 i,..., a n b n i.

SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 455 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces we have studed thus far n the text are real vector spaces snce the scalars are

### 6. EIGENVALUES AND EIGENVECTORS 3 = 3 2

EIGENVALUES AND EIGENVECTORS The Characterstc Polynomal If A s a square matrx and v s a non-zero vector such that Av v we say that v s an egenvector of A and s the correspondng egenvalue Av v Example :

### 1 Example 1: Axis-aligned rectangles

COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 6 Scrbe: Aaron Schld February 21, 2013 Last class, we dscussed an analogue for Occam s Razor for nfnte hypothess spaces that, n conjuncton

### New bounds in Balog-Szemerédi-Gowers theorem

New bounds n Balog-Szemeréd-Gowers theorem By Tomasz Schoen Abstract We prove, n partcular, that every fnte subset A of an abelan group wth the addtve energy κ A 3 contans a set A such that A κ A and A

### Luby s Alg. for Maximal Independent Sets using Pairwise Independence

Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent

### BERNSTEIN POLYNOMIALS

On-Lne Geometrc Modelng Notes BERNSTEIN POLYNOMIALS Kenneth I. Joy Vsualzaton and Graphcs Research Group Department of Computer Scence Unversty of Calforna, Davs Overvew Polynomals are ncredbly useful

### Ring structure of splines on triangulations

www.oeaw.ac.at Rng structure of splnes on trangulatons N. Vllamzar RICAM-Report 2014-48 www.rcam.oeaw.ac.at RING STRUCTURE OF SPLINES ON TRIANGULATIONS NELLY VILLAMIZAR Introducton For a trangulated regon

### Embedding lattices in the Kleene degrees

F U N D A M E N T A MATHEMATICAE 62 (999) Embeddng lattces n the Kleene degrees by Hsato M u r a k (Nagoya) Abstract. Under ZFC+CH, we prove that some lattces whose cardnaltes do not exceed ℵ can be embedded

### Generalizing the degree sequence problem

Mddlebury College March 2009 Arzona State Unversty Dscrete Mathematcs Semnar The degree sequence problem Problem: Gven an nteger sequence d = (d 1,...,d n ) determne f there exsts a graph G wth d as ts

### Non-degenerate Hilbert Cubes in Random Sets

Journal de Théore des Nombres de Bordeaux 00 (XXXX), 000 000 Non-degenerate Hlbert Cubes n Random Sets par Csaba Sándor Résumé. Une légère modfcaton de la démonstraton du lemme des cubes de Szemeréd donne

### Production. 2. Y is closed A set is closed if it contains its boundary. We need this for the solution existence in the profit maximization problem.

Producer Theory Producton ASSUMPTION 2.1 Propertes of the Producton Set The producton set Y satsfes the followng propertes 1. Y s non-empty If Y s empty, we have nothng to talk about 2. Y s closed A set

### Support Vector Machines

Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada wellng@cs.toronto.edu Abstract Ths s a note to explan support vector machnes.

### On Lockett pairs and Lockett conjecture for π-soluble Fitting classes

On Lockett pars and Lockett conjecture for π-soluble Fttng classes Lujn Zhu Department of Mathematcs, Yangzhou Unversty, Yangzhou 225002, P.R. Chna E-mal: ljzhu@yzu.edu.cn Nanyng Yang School of Mathematcs

### PERRON FROBENIUS THEOREM

PERRON FROBENIUS THEOREM R. CLARK ROBINSON Defnton. A n n matrx M wth real entres m, s called a stochastc matrx provded () all the entres m satsfy 0 m, () each of the columns sum to one, m = for all, ()

### 1 Approximation Algorithms

CME 305: Dscrete Mathematcs and Algorthms 1 Approxmaton Algorthms In lght of the apparent ntractablty of the problems we beleve not to le n P, t makes sense to pursue deas other than complete solutons

### INTERPRETING TRUE ARITHMETIC IN THE LOCAL STRUCTURE OF THE ENUMERATION DEGREES.

INTERPRETING TRUE ARITHMETIC IN THE LOCAL STRUCTURE OF THE ENUMERATION DEGREES. HRISTO GANCHEV AND MARIYA SOSKOVA 1. Introducton Degree theory studes mathematcal structures, whch arse from a formal noton

### Solutions to the exam in SF2862, June 2009

Solutons to the exam n SF86, June 009 Exercse 1. Ths s a determnstc perodc-revew nventory model. Let n = the number of consdered wees,.e. n = 4 n ths exercse, and r = the demand at wee,.e. r 1 = r = r

### x f(x) 1 0.25 1 0.75 x 1 0 1 1 0.04 0.01 0.20 1 0.12 0.03 0.60

BIVARIATE DISTRIBUTIONS Let be a varable that assumes the values { 1,,..., n }. Then, a functon that epresses the relatve frequenc of these values s called a unvarate frequenc functon. It must be true

### where the coordinates are related to those in the old frame as follows.

Chapter 2 - Cartesan Vectors and Tensors: Ther Algebra Defnton of a vector Examples of vectors Scalar multplcaton Addton of vectors coplanar vectors Unt vectors A bass of non-coplanar vectors Scalar product

### NON-CONSTANT SUM RED-AND-BLACK GAMES WITH BET-DEPENDENT WIN PROBABILITY FUNCTION LAURA PONTIGGIA, University of the Sciences in Philadelphia

To appear n Journal o Appled Probablty June 2007 O-COSTAT SUM RED-AD-BLACK GAMES WITH BET-DEPEDET WI PROBABILITY FUCTIO LAURA POTIGGIA, Unversty o the Scences n Phladelpha Abstract In ths paper we nvestgate

### 8 Algorithm for Binary Searching in Trees

8 Algorthm for Bnary Searchng n Trees In ths secton we present our algorthm for bnary searchng n trees. A crucal observaton employed by the algorthm s that ths problem can be effcently solved when the

### Product-Form Stationary Distributions for Deficiency Zero Chemical Reaction Networks

Bulletn of Mathematcal Bology (21 DOI 1.17/s11538-1-9517-4 ORIGINAL ARTICLE Product-Form Statonary Dstrbutons for Defcency Zero Chemcal Reacton Networks Davd F. Anderson, Gheorghe Cracun, Thomas G. Kurtz

### Fisher Markets and Convex Programs

Fsher Markets and Convex Programs Nkhl R. Devanur 1 Introducton Convex programmng dualty s usually stated n ts most general form, wth convex objectve functons and convex constrants. (The book by Boyd and

### Communication Networks II Contents

8 / 1 -- Communcaton Networs II (Görg) -- www.comnets.un-bremen.de Communcaton Networs II Contents 1 Fundamentals of probablty theory 2 Traffc n communcaton networs 3 Stochastc & Marovan Processes (SP

### The descriptive complexity of the family of Banach spaces with the π-property

Arab. J. Math. (2015) 4:35 39 DOI 10.1007/s40065-014-0116-3 Araban Journal of Mathematcs Ghadeer Ghawadrah The descrptve complexty of the famly of Banach spaces wth the π-property Receved: 25 March 2014

### Inequality and The Accounting Period. Quentin Wodon and Shlomo Yitzhaki. World Bank and Hebrew University. September 2001.

Inequalty and The Accountng Perod Quentn Wodon and Shlomo Ytzha World Ban and Hebrew Unversty September Abstract Income nequalty typcally declnes wth the length of tme taen nto account for measurement.

### THE HIT PROBLEM FOR THE DICKSON ALGEBRA

TRNSCTIONS OF THE MERICN MTHEMTICL SOCIETY Volume 353 Number 12 Pages 5029 5040 S 0002-9947(01)02705-2 rtcle electroncally publshed on May 22 2001 THE HIT PROBLEM FOR THE DICKSON LGEBR NGUY ÊN H. V. HUNG

### QUANTUM MECHANICS, BRAS AND KETS

PH575 SPRING QUANTUM MECHANICS, BRAS AND KETS The followng summares the man relatons and defntons from quantum mechancs that we wll be usng. State of a phscal sstem: The state of a phscal sstem s represented

### + + + - - This circuit than can be reduced to a planar circuit

MeshCurrent Method The meshcurrent s analog of the nodeoltage method. We sole for a new set of arables, mesh currents, that automatcally satsfy KCLs. As such, meshcurrent method reduces crcut soluton to

### 2.4 Bivariate distributions

page 28 2.4 Bvarate dstrbutons 2.4.1 Defntons Let X and Y be dscrete r.v.s defned on the same probablty space (S, F, P). Instead of treatng them separately, t s often necessary to thnk of them actng together

### PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12

14 The Ch-squared dstrbuton PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 1 If a normal varable X, havng mean µ and varance σ, s standardsed, the new varable Z has a mean 0 and varance 1. When ths standardsed

### Series Solutions of ODEs 2 the Frobenius method. The basic idea of the Frobenius method is to look for solutions of the form 3

Royal Holloway Unversty of London Department of Physs Seres Solutons of ODEs the Frobenus method Introduton to the Methodology The smple seres expanson method works for dfferental equatons whose solutons

### Contents. 1 Introduction 2

Contents 1 Introducton 2 2 The Dvsor Functon And The Euler Condton For Odd Perfect Numbers. 3 2.1 The mossblty of equalty 2. Pror lemmas........ 3 3 Conclusons. 7 1 Why there are no odd erfect numbers

### Lecture 3: Force of Interest, Real Interest Rate, Annuity

Lecture 3: Force of Interest, Real Interest Rate, Annuty Goals: Study contnuous compoundng and force of nterest Dscuss real nterest rate Learn annuty-mmedate, and ts present value Study annuty-due, and

### Can Auto Liability Insurance Purchases Signal Risk Attitude?

Internatonal Journal of Busness and Economcs, 2011, Vol. 10, No. 2, 159-164 Can Auto Lablty Insurance Purchases Sgnal Rsk Atttude? Chu-Shu L Department of Internatonal Busness, Asa Unversty, Tawan Sheng-Chang

### The Greedy Method. Introduction. 0/1 Knapsack Problem

The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton

### Nonbinary Quantum Error-Correcting Codes from Algebraic Curves

Nonbnary Quantum Error-Correctng Codes from Algebrac Curves Jon-Lark Km and Judy Walker Department of Mathematcs Unversty of Nebraska-Lncoln, Lncoln, NE 68588-0130 USA e-mal: {jlkm, jwalker}@math.unl.edu

### Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..

### 1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP)

6.3 / -- Communcaton Networks II (Görg) SS20 -- www.comnets.un-bremen.de Communcaton Networks II Contents. Fundamentals of probablty theory 2. Emergence of communcaton traffc 3. Stochastc & Markovan Processes

### F-Rational Rings and the Integral Closures of Ideals

Mchgan Math. J. 49 (2001) F-Ratonal Rngs and the Integral Closures of Ideals Ian M. Aberbach & Crag Huneke 1. Introducton The hstory of the Brançon Skoda theorem and ts ensung avatars n commutatve algebra

### The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis

The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.

### On Competitive Nonlinear Pricing

On Compettve Nonlnear Prcng Andrea Attar Thomas Marott Franços Salané February 27, 2013 Abstract A buyer of a dvsble good faces several dentcal sellers. The buyer s preferences are her prvate nformaton,

### THE METHOD OF LEAST SQUARES THE METHOD OF LEAST SQUARES

The goal: to measure (determne) an unknown quantty x (the value of a RV X) Realsaton: n results: y 1, y 2,..., y j,..., y n, (the measured values of Y 1, Y 2,..., Y j,..., Y n ) every result s encumbered

### NMT EE 589 & UNM ME 482/582 ROBOT ENGINEERING. Dr. Stephen Bruder NMT EE 589 & UNM ME 482/582

NMT EE 589 & UNM ME 482/582 ROBOT ENGINEERING Dr. Stephen Bruder NMT EE 589 & UNM ME 482/582 7. Root Dynamcs 7.2 Intro to Root Dynamcs We now look at the forces requred to cause moton of the root.e. dynamcs!!

### Finite Math Chapter 10: Study Guide and Solution to Problems

Fnte Math Chapter 10: Study Gude and Soluton to Problems Basc Formulas and Concepts 10.1 Interest Basc Concepts Interest A fee a bank pays you for money you depost nto a savngs account. Prncpal P The amount

### The k-binomial Transforms and the Hankel Transform

1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 9 (2006, Artcle 06.1.1 The k-bnomal Transforms and the Hankel Transform Mchael Z. Spvey Department of Mathematcs and Computer Scence Unversty of Puget

### Formula of Total Probability, Bayes Rule, and Applications

1 Formula of Total Probablty, Bayes Rule, and Applcatons Recall that for any event A, the par of events A and A has an ntersecton that s empty, whereas the unon A A represents the total populaton of nterest.

### CHAPTER 7 VECTOR BUNDLES

CHAPTER 7 VECTOR BUNDLES We next begn addressng the queston: how do we assemble the tangent spaces at varous ponts of a manfold nto a coherent whole? In order to gude the decson, consder the case of U

### OPTIMAL INVESTMENT POLICIES FOR THE HORSE RACE MODEL. Thomas S. Ferguson and C. Zachary Gilstein UCLA and Bell Communications May 1985, revised 2004

OPTIMAL INVESTMENT POLICIES FOR THE HORSE RACE MODEL Thomas S. Ferguson and C. Zachary Glsten UCLA and Bell Communcatons May 985, revsed 2004 Abstract. Optmal nvestment polces for maxmzng the expected

### Extending Probabilistic Dynamic Epistemic Logic

Extendng Probablstc Dynamc Epstemc Logc Joshua Sack May 29, 2008 Probablty Space Defnton A probablty space s a tuple (S, A, µ), where 1 S s a set called the sample space. 2 A P(S) s a σ-algebra: a set

### Calculation of Sampling Weights

Perre Foy Statstcs Canada 4 Calculaton of Samplng Weghts 4.1 OVERVIEW The basc sample desgn used n TIMSS Populatons 1 and 2 was a two-stage stratfed cluster desgn. 1 The frst stage conssted of a sample

### Lecture 3: Annuity. Study annuities whose payments form a geometric progression or a arithmetic progression.

Lecture 3: Annuty Goals: Learn contnuous annuty and perpetuty. Study annutes whose payments form a geometrc progresson or a arthmetc progresson. Dscuss yeld rates. Introduce Amortzaton Suggested Textbook

### Rate Monotonic (RM) Disadvantages of cyclic. TDDB47 Real Time Systems. Lecture 2: RM & EDF. Priority-based scheduling. States of a process

Dsadvantages of cyclc TDDB47 Real Tme Systems Manual scheduler constructon Cannot deal wth any runtme changes What happens f we add a task to the set? Real-Tme Systems Laboratory Department of Computer

### benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).

REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or

### General Auction Mechanism for Search Advertising

General Aucton Mechansm for Search Advertsng Gagan Aggarwal S. Muthukrshnan Dávd Pál Martn Pál Keywords game theory, onlne auctons, stable matchngs ABSTRACT Internet search advertsng s often sold by an

### ON CYCLOTOMIC POLYNOMIALS WITH ±1 COEFFICIENTS

ON CYCLOTOMIC POLYNOMIALS WITH ±1 COEFFICIENTS PETER BORWEIN AND KWOK-KWONG STEPHEN CHOI Abstract. We characterze all cyclotomc polynomals of even egree wth coeffcents restrcte to the set {+1, 1}. In ths

### Project Networks With Mixed-Time Constraints

Project Networs Wth Mxed-Tme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa

### REGULAR MULTILINEAR OPERATORS ON C(K) SPACES

REGULAR MULTILINEAR OPERATORS ON C(K) SPACES FERNANDO BOMBAL AND IGNACIO VILLANUEVA Abstract. The purpose of ths paper s to characterze the class of regular contnuous multlnear operators on a product of

### The covariance is the two variable analog to the variance. The formula for the covariance between two variables is

Regresson Lectures So far we have talked only about statstcs that descrbe one varable. What we are gong to be dscussng for much of the remander of the course s relatonshps between two or more varables.

### A hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm

Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(7):1884-1889 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 A hybrd global optmzaton algorthm based on parallel

### Section 5.4 Annuities, Present Value, and Amortization

Secton 5.4 Annutes, Present Value, and Amortzaton Present Value In Secton 5.2, we saw that the present value of A dollars at nterest rate per perod for n perods s the amount that must be deposted today

### A) 3.1 B) 3.3 C) 3.5 D) 3.7 E) 3.9 Solution.

ACTS 408 Instructor: Natala A. Humphreys SOLUTION TO HOMEWOR 4 Secton 7: Annutes whose payments follow a geometrc progresson. Secton 8: Annutes whose payments follow an arthmetc progresson. Problem Suppose

### Using Series to Analyze Financial Situations: Present Value

2.8 Usng Seres to Analyze Fnancal Stuatons: Present Value In the prevous secton, you learned how to calculate the amount, or future value, of an ordnary smple annuty. The amount s the sum of the accumulated

### Stability, observer design and control of networks using Lyapunov methods

Stablty, observer desgn and control of networks usng Lyapunov methods von Lars Naujok Dssertaton zur Erlangung des Grades enes Doktors der Naturwssenschaften - Dr. rer. nat. - Vorgelegt m Fachberech 3

### A Bonus-Malus System as a Markov Set-Chain

A Bonus-alus System as a arov Set-Chan Famly and frst name: emec algorzata Organsaton: Warsaw School of Economcs Insttute of Econometrcs Al. epodleglosc 64 2-554 Warszawa Poland Telephone number: +48 6

### Section 5.3 Annuities, Future Value, and Sinking Funds

Secton 5.3 Annutes, Future Value, and Snkng Funds Ordnary Annutes A sequence of equal payments made at equal perods of tme s called an annuty. The tme between payments s the payment perod, and the tme

### CLUSTER SAMPLING DR. SHALABH DEPARTMENT OF MATHEMATICS AND STATISTICS INDIAN INSTITUTE OF TECHNOLOGY KANPUR 1

amplng Theory MODULE IX LECTURE - 30 CLUTER AMPLIG DR HALABH DEPARTMET OF MATHEMATIC AD TATITIC IDIA ITITUTE OF TECHOLOGY KAPUR It s one of the asc assumptons n any samplng procedure that the populaton

### Linear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits

Lnear Crcuts Analyss. Superposton, Theenn /Norton Equalent crcuts So far we hae explored tmendependent (resste) elements that are also lnear. A tmendependent elements s one for whch we can plot an / cure.

### IDENTIFICATION AND CORRECTION OF A COMMON ERROR IN GENERAL ANNUITY CALCULATIONS

IDENTIFICATION AND CORRECTION OF A COMMON ERROR IN GENERAL ANNUITY CALCULATIONS Chrs Deeley* Last revsed: September 22, 200 * Chrs Deeley s a Senor Lecturer n the School of Accountng, Charles Sturt Unversty,

### Period and Deadline Selection for Schedulability in Real-Time Systems

Perod and Deadlne Selecton for Schedulablty n Real-Tme Systems Thdapat Chantem, Xaofeng Wang, M.D. Lemmon, and X. Sharon Hu Department of Computer Scence and Engneerng, Department of Electrcal Engneerng

### On the Optimal Control of a Cascade of Hydro-Electric Power Stations

On the Optmal Control of a Cascade of Hydro-Electrc Power Statons M.C.M. Guedes a, A.F. Rbero a, G.V. Smrnov b and S. Vlela c a Department of Mathematcs, School of Scences, Unversty of Porto, Portugal;

### FINITE HILBERT STABILITY OF (BI)CANONICAL CURVES

FINITE HILBERT STABILITY OF (BICANONICAL CURVES JAROD ALPER, MAKSYM FEDORCHUK, AND DAVID ISHII SMYTH* To Joe Harrs on hs sxteth brthday Abstract. We prove that a generc canoncally or bcanoncally embedded

### NPAR TESTS. One-Sample Chi-Square Test. Cell Specification. Observed Frequencies 1O i 6. Expected Frequencies 1EXP i 6

PAR TESTS If a WEIGHT varable s specfed, t s used to replcate a case as many tmes as ndcated by the weght value rounded to the nearest nteger. If the workspace requrements are exceeded and samplng has

### Problem Set 3. a) We are asked how people will react, if the interest rate i on bonds is negative.

Queston roblem Set 3 a) We are asked how people wll react, f the nterest rate on bonds s negatve. When

### The Magnetic Field. Concepts and Principles. Moving Charges. Permanent Magnets

. The Magnetc Feld Concepts and Prncples Movng Charges All charged partcles create electrc felds, and these felds can be detected by other charged partcles resultng n electrc force. However, a completely

### Minimal Coding Network With Combinatorial Structure For Instantaneous Recovery From Edge Failures

Mnmal Codng Network Wth Combnatoral Structure For Instantaneous Recovery From Edge Falures Ashly Joseph 1, Mr.M.Sadsh Sendl 2, Dr.S.Karthk 3 1 Fnal Year ME CSE Student Department of Computer Scence Engneerng

### THE DISTRIBUTION OF LOAN PORTFOLIO VALUE * Oldrich Alfons Vasicek

HE DISRIBUION OF LOAN PORFOLIO VALUE * Oldrch Alfons Vascek he amount of captal necessary to support a portfolo of debt securtes depends on the probablty dstrbuton of the portfolo loss. Consder a portfolo

### Chapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT

Chapter 4 ECOOMIC DISATCH AD UIT COMMITMET ITRODUCTIO A power system has several power plants. Each power plant has several generatng unts. At any pont of tme, the total load n the system s met by the

### 1. Measuring association using correlation and regression

How to measure assocaton I: Correlaton. 1. Measurng assocaton usng correlaton and regresson We often would lke to know how one varable, such as a mother's weght, s related to another varable, such as a

### A Performance Analysis of View Maintenance Techniques for Data Warehouses

A Performance Analyss of Vew Mantenance Technques for Data Warehouses Xng Wang Dell Computer Corporaton Round Roc, Texas Le Gruenwald The nversty of Olahoma School of Computer Scence orman, OK 739 Guangtao

### Fast degree elevation and knot insertion for B-spline curves

Computer Aded Geometrc Desgn 22 (2005) 183 197 www.elsever.com/locate/cagd Fast degree elevaton and knot nserton for B-splne curves Q-Xng Huang a,sh-mnhu a,, Ralph R. Martn b a Department of Computer Scence

### FINANCIAL MATHEMATICS. A Practical Guide for Actuaries. and other Business Professionals

FINANCIAL MATHEMATICS A Practcal Gude for Actuares and other Busness Professonals Second Edton CHRIS RUCKMAN, FSA, MAAA JOE FRANCIS, FSA, MAAA, CFA Study Notes Prepared by Kevn Shand, FSA, FCIA Assstant

### Risk-based Fatigue Estimate of Deep Water Risers -- Course Project for EM388F: Fracture Mechanics, Spring 2008

Rsk-based Fatgue Estmate of Deep Water Rsers -- Course Project for EM388F: Fracture Mechancs, Sprng 2008 Chen Sh Department of Cvl, Archtectural, and Envronmental Engneerng The Unversty of Texas at Austn

### A Prefix Code Matching Parallel Load-Balancing Method for Solution-Adaptive Unstructured Finite Element Graphs on Distributed Memory Multicomputers

Ž. The Journal of Supercomputng, 15, 25 49 2000 2000 Kluwer Academc Publshers. Manufactured n The Netherlands. A Prefx Code Matchng Parallel Load-Balancng Method for Soluton-Adaptve Unstructured Fnte Element

### Usage of LCG/CLCG numbers for electronic gambling applications

Usage of LCG/CLCG numbers for electronc gamblng applcatons Anders Knutsson Smovts Consultng, Wenner-Gren Center, Sveavägen 166, 113 46 Stockholm, Sweden anders.knutsson@smovts.com Abstract. Several attacks

### Solution: Let i = 10% and d = 5%. By definition, the respective forces of interest on funds A and B are. i 1 + it. S A (t) = d (1 dt) 2 1. = d 1 dt.

Chapter 9 Revew problems 9.1 Interest rate measurement Example 9.1. Fund A accumulates at a smple nterest rate of 10%. Fund B accumulates at a smple dscount rate of 5%. Fnd the pont n tme at whch the forces

### Addendum to: Importing Skill-Biased Technology

Addendum to: Importng Skll-Based Technology Arel Bursten UCLA and NBER Javer Cravno UCLA August 202 Jonathan Vogel Columba and NBER Abstract Ths Addendum derves the results dscussed n secton 3.3 of our

### Simple Interest Loans (Section 5.1) :

Chapter 5 Fnance The frst part of ths revew wll explan the dfferent nterest and nvestment equatons you learned n secton 5.1 through 5.4 of your textbook and go through several examples. The second part

### LECTURE 2: CRYSTAL BASES

LECTURE 2: CRYSTAL BASES STEVEN SAM AND PETER TINGLEY Today I ll defne crystal bases, and dscuss ther basc propertes. Ths wll nclude the tensor product rule and the relatonshp between the crystals B(λ)

### z(t) = z 1 (t) + t(z 2 z 1 ) z(t) = 1 + i + t( 2 3i (1 + i)) z(t) = 1 + i + t( 3 4i); 0 t 1

(4.): ontours. Fnd an admssble parametrzaton. (a). the lne segment from z + to z 3. z(t) z (t) + t(z z ) z(t) + + t( 3 ( + )) z(t) + + t( 3 4); t (b). the crcle jz j 4 traversed once clockwse startng at

### 7.5. Present Value of an Annuity. Investigate

7.5 Present Value of an Annuty Owen and Anna are approachng retrement and are puttng ther fnances n order. They have worked hard and nvested ther earnngs so that they now have a large amount of money on

### Week 6 Market Failure due to Externalities

Week 6 Market Falure due to Externaltes 1. Externaltes n externalty exsts when the acton of one agent unavodably affects the welfare of another agent. The affected agent may be a consumer, gvng rse to