A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "A Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length"

Transcription

1 Joural o Satisfiability, Boolea Modelig ad Computatio ) A Faster Clause-Shorteig Algorithm for SAT with No Restrictio o Clause Legth Evgey Datsi Alexader Wolpert Departmet of Computer Sciece Roosevelt Uiversity 430 S. Michiga Av. Chicago, IL 60605, USA Abstract We give a radomized algorithm for testig satisfiability of Boolea formulas i cojuctive ormal form with o restrictio o clause legth. This algorithm uses the clauseshorteig approach proposed by Schuler [14]. The ruig time of the algorithm is O 2 1 1/α)) where α = lm/) + Ol l m) ad, m are respectively the umber of variables ad the umber of clauses i the iput formula. This boud is asymptotically better tha the previously best kow 2 1 1/ log2m)) boud for SAT. 1. Keywords: SAT with o restrictio o clause legth, upper boud, clause shorteig Submitted July 2005; revised Novber 2005; published Novber Itroductio Durig the past few years there has bee cosiderable progress i obtaiig upper bouds o the complexity of solvig the Boolea satisfiability probl. This lie of research has produced ew algorithms for k-sat. They were further used to prove otrivial upper bouds for SAT o restrictio o clause legth). Upper bouds for k-sat. The best kow upper bouds for k-sat are based o two approaches: the satisfiability codig lma [9, 8] ad multistart radom walk [12, 13]; both give close upper bouds o the time of solvig k-sat. Schöig s radomized algorithm i [12] has the 2 2/k) boud where is the umber of variables i the iput formula. The radomized algorithm i [8] has a slightly better boud this algorithm is ofte referred to as the PPSZ algorithm). The multistart-radom-walk approach is deradomized usig coverig codes i [3], which gives the best kow 2 2/k + 1)) boud for determiistic k-sat algorithms. The PPSZ algorithm is deradomized with the same boud for Uiquek-SAT [11]. For small values of k, these bouds are improved: for example, 3-SAT ca be solved by a radomized algorithm with the boud [7] ad by a determiistic algorithm with the boud [2]. 1. The results of this paper without proofs) appeared i the proceedigs of SAT 2005 [6] c 2005 Delft Uiversity of Techology ad the authors.

2 E. Datsi ad A. Wolpert Upper bouds for SAT o restrictio o clause legth). The first otrivial upper boud for SAT is give i [10]: the 2 1 1/2 ) boud for a radomized algorithm that uses the PPSZ algorithm as a subroutie. A close boud for a determiistic algorithm is proved i [4]. A much better boud for SAT is the 2 1 1/ log2m)) boud, where m is the umber of clauses i the iput formula. This boud is due to Schuler [14]. His radomized algorithm is based o a approach that ca be called clause shorteig: the algorithm repeatedly applies a k-sat subroutie to formulas obtaied by shorteig iput clauses to legth k. Schuler s algorithm is deradomized i [5]; the deradomizatio gives a determiistic algorithm that solves SAT with the same boud. I this paper we improve the 2 1 1/ log2m)) boud: we give a radomized algorithm that solves SAT with the followig upper boud o the ruig time: «2 1 1 l m )+Ol l m) Idea of the algorithm. Our algorithm for SAT is a repetitio of a polyomial-time procedure P that tests satisfiability of a iput formula F. If F is satisfied by a truth assigmet A, the procedure P fids A with probability at least p. As usual, repeatig P o the iput formula O1/p) times, we ca fid A with a costat probability. Whe describig P, we view clauses as sequeces rather tha sets) of literals. Each clause l 1, l 2,..., l s such that s > k is divided ito two segmets as follows: First segmet: l 1,..., l k, Secod segmet: l k+1,..., l s We say that the first segmet is true uder a assigmet A if at least oe of its literals is true uder A; otherwise we say that the first segmet is false uder A. If A is clear from the cotext, we omit the words uder A. Let F cosist of clauses C 1,..., C m ad let A be a fixed satisfyig assigmet to F. The procedure P is based o the followig dichotomy: Case 1. The iput formula F has may clauses i which the first segmet is false. We call such clauses bad. Suppose that the umber of bad clauses is greater tha or equal to some d. The if we choose a clause C i from C 1,..., C m at radom, the first segmet i C i is false with probability at least d/m. Assumig that C i is bad, we ca simplify F by assigig false to all literals occurrig i the first segmet of C i. Case 2. The iput formula F has few less tha d) bad clauses. If we cosider a formula made up of the first segmets of all iput clauses, we get a k-cnf formula i which almost all clauses cotai true literals. Oly the first segmets of bad clauses prevet us from fidig A by applyig a k-sat algorithm to this formula. To fix it, we guess all bad clauses ad replace their first segmets by clauses of legth k that cotai true literals. More exactly, for each bad clause, we replace its first segmet by k literals chose at radom from this clause. The probability that the resultig k-cnf formula is satisfied by A is easily estimated. The procedure P first assumes that Case 2 holds. To process this case, P ivokes a subroutie deoted S) that trasforms F ito a k-cnf formula ad applies a k-sat 1) 50

3 A Faster Clause-Shorteig Algorithm algorithm. If o satisfyig assigmet is foud, Case 1 is cosidered to hold. The P simplifies the iput formula ad recursively ivokes itself o the simplified formula. The procedure P ad the subroutie S) uses k ad d as parameters. Clearly, the success probability of P depeds o values of the parameters. What values of k ad d maximize the success probability? I Sect. 4 we fid values of the parameters k logm/) + Olog logm)) ad d / log 3 m) that give the followig lower boud o the success probability: «2 1 1 l m )+Ol l m) Sect.2 cotais basic defiitios ad otatio. I Sect. 3 we describe the procedure P ad the subroutie S. I Sect. 4 we prove a lower boud o the success probability of P. I Sect. 5 we defie our algorithm for SAT ad prove the claimed upper boud o its ruig time. 2. Defiitios ad Notatio We deal with Boolea formulas i cojuctive ormal form CNF). By a variable we mea a Boolea variable that takes truth values t true) or f false). A literal is a variable x or its egatio x. If l is a literal the l deotes its complet, i.e. if l is x the l deotes x, ad if l is x the l deotes x. Similarly, if v deotes oe of the truth values t or f, we write v to deote its complet. A clause C is a set of literals such that C cotais o completary literals. A formula F is a set of clauses; ad m deote, respectively, the umber of variables ad the umber of clauses i F. If each clause i F cotais at most k literals, we say that F is a k-cnf formula. A assigmet to variables x 1,..., x is a mappig from {x 1,..., x } to {t, f}. This mappig is exteded to literals: each literal x i is mapped to the complet of the truth value assiged to x i. We say that a clause C is satisfied by a assigmet A or, C is true uder A) if A assigs t to at least oe literal i C. Otherwise, we say that C is falsified by A or, C is false uder A). The formula F is satisfied by A if every clause i F is satisfied by A. I this case, A is called a satisfyig assigmet for F. Let F be a formula ad l 1,..., l s be literals. We write F [l 1 =f,..., l s =f] to deote the formula obtaied from F by assigig the value f to all of l 1,..., l s. This formula is obtaied from F as follows: the clauses that cotai ay literal from l 1,..., l s are deleted from F, ad the literals l 1,..., l s are deleted from the other clauses. Note that F [l 1 = f,..., l s = f] may cotai the pty clause or may be the pty formula. Let A ad A be two assigmets that differ oly i the values assiged to a literal l. The we say that A is obtaied from A by flippig the value of l. By SAT we mea the followig computatioal probl: Give a formula F i CNF, decide whether F is satisfiable. The k-sat probl is the restricted versio of SAT that allows oly clauses cosistig of at most k literals. We write log x to deote log 2 x. 51

4 E. Datsi ad A. Wolpert 3. Procedure P ad Subroutie S Both procedures S ad P use the parameters k ad d; their values are determied i the ext sectio. 3.1 Descriptio of S Suppose that a iput formula F has a satisfyig assigmet A such that F has oly few < d) clauses i which the first segmet is false uder A, i.e. Case 2 of the dichotomy holds. The the subroutie S fids such a assigmet with the probability estimated i Sect. 4). The subroutie takes two steps: 1. Reductio of F to a k-cnf formula F such that ay satisfyig assigmet to F satisfies F. 2. Use of a k-sat algorithm to fid a satisfyig assigmet to F. First, S guesses all bad clauses, i.e. clauses i which the first segmet is false uder A. More exactly, the subroutie guesses a set {B 1,..., B d 1 } of clauses such that all bad clauses are cotaied i this set. For each clause B i, the subroutie guesses k literals i B i such that this guessed set cotais a true literal. The the subroutie replaces each clause i F by a set of k literals chose from this clause either the guessed set for B 1,..., B d 1 or the first segmets for the other clauses i F. The resultig formula is deoted by F. It is obvious that if we guessed right the A satisfies F. To test satisfiability of k-cnf formulas at the secod step, S uses a polyomial-time radomized algorithm that fids a satisfyig assigmet with a expoetially small probability. We choose Schöig s algorithm [12] to perform this testig we could use ay algorithm that has at least the same success probability, for example the PPSZ algorithm [8]). More exactly, we use oe radom walk of Schöig s algorithm, which has the success probability at least 2 2/k) up to a costat [13]. If S fids a satisfyig assigmet the the procedure returs it ad halts. Otherwise, S should retur o but for techical reasos, istead of o, we require S retur F which is used i the exteral procedure P. Note that if d = 1, i.e. there is o bad clause, the S simply fids a satisfyig assigmet to the k-cnf formula made up of the m first segmets. Also ote that the smaller d, the higher the probability of guessig F. Subroutie S Iput: Formula F with m clauses over variables, itegers k ad d. Output: Satisfyig assigmet or k-cnf formula. 1. Reduce F to a k-cnf formula F as follows: a) Choose d 1 clauses B 1,..., B d 1 i F at radom. b) Replace each clause that does ot belog to {B 1,..., B d 1 } by its first segmet. c) For each B i, choose k literals i B i at radom ad replace B i by the chose set. 52

5 A Faster Clause-Shorteig Algorithm 2. Test satisfiability of F usig oe radom walk of legth 3 see [12] for details): a) Choose a iitial assigmet a uiformly at radom; b) Repeat 3 times: i. If F is satisfied by the assigmet a the retur a ad halt; ii. Pick ay clause C i F such that C is falsified by a. Choose a literal l i C uiformly at radom. Modify a by flippig the value of l. c) Retur F. 3.2 Descriptio of P Suppose that a iput formula F has a satisfyimg assigmet A. The procedure first calls Subroutie S. The result of S depeds o which case of the dichotomy holds. 1. The iput formula F has may d) bad clauses. The S ever fids A. 2. The iput formula F has few < d) bad clauses. The S returs A with some probability). If S does ot retur a satisfyig assigmet, the procedure P simplifies F ad recursively ivokes itself o the simplified formula, i.e. P processes Case 1 of the dichotomy. To simplify the formula, P uses the fact that A falsifies at least oe clause i F. Note that such a clause has bee obtaied from a log clause loger tha k) i F because each short clause must cotai a true literal. Therefore, P chooses a clause at radom from those clauses i F that are obtaied from log clauses i F. Let l 1,..., l k be all literals of the chose clause. The P assigs f to these literals ad reduces F to F [l 1 =f,..., l k =f]. Procedure P Iput: Formula F with m clauses over variables, itegers k ad d. Output: Satisfyig assigmet or o. 1. Ivoke S o F, k, ad d. 2. Choose a clause at radom from those clauses i F that are obtaied from log loger tha k) clauses of F. Let the chose clause cosist of literals l 1,..., l k. 3. Simplify F by assigig f to all l 1,..., l k, i.e. reduce F to F [l 1 =f,..., l k =f]. 4. Recursively ivoke P o F [l 1 =f,..., l k =f]. 5. Retur o. Note that Schuler s algorithm [14] is a special case of P: take d = 1, k = log2m), ad use the PPSZ algorithm istead of Schöig s algorithm at step 2 i S. 53

6 E. Datsi ad A. Wolpert 4. Success Probability of Procedure P Give a iput formula F ad some values of the parameters k ad d, Procedure P fids a fixed satisfyig assigmet A or returs o. What is the probability of fidig A? I this sectio, we give a lower boud o the success probability of P ad choose values of k ad d that maximize this boud. We defie the miimum success probabilities for S ad P as follows: s, m, k, d) is the miimum success probability of S where the miimum is take over all pairs F, A such that i) A satisfies F ; ii) F has variables ad m clauses; iii) F has less tha d bad clauses. p, m, k, d) is the miimum success probability of P where the miimum is take over all pairs F, A such that i) A satisfies F ; ii) F has variables ad m clauses. I all ext lmas we assume that m > d 2. Lma 1. Subroutie S has the followig lower boud o the success probability: s, m, k, d) > ) d 1) log e 1 2 k ) Proof. Let A be a fixed satisfyig assigmet to F. The probability of fidig A is the product of three probabilities s 1, s 2, ad s 3. The probability s 1 is the probability that the set {B 1,..., B d 1 } of chose clauses cotais all bad clauses step 1a i S). The probability s 2 is the probability of guessig sets with true literals for all B 1,..., B d 1 step 1b i S). The probability s 3 is the probability of fidig A by oe radom walk step 2 i S). Sice B 1,..., B d 1 are chose at radom from m iput clauses, we have usig Stirlig s approximatio as i [1, page 4]): s 1 1 m d 1) 2πm d 1 m ) ) 1 d 1 m 2 H d 1 m ) m > 3 2 For further estimatio we use the iequality log1 + x) < x log e: s 1 > 3 2 d 1 2 H m ) m = 3 m 2 log 2 d 1) d 1) m d+1) log1+ m d+1) d 1 > 3 2 = d 1) log m d 1) m d+1) d 1 m d+1) log e d 1 ) d 1) d 1 2 H m ) m To estimate s 2, we estimate the probability of guessig a set with a true literal for each B i. Obviously, B i has at most k) subsets of literals of size k. For a fixed true literal i Bi, there are at most 1 k 1) of such subsets that cotai this literal. Hece s 2 ) 1 d 1 k 1) = ) k d 1 k) 54

7 A Faster Clause-Shorteig Algorithm A lower boud o s 3 is proved i [13]: 2 ) k Usig the iequality 1 x 2 x log e, we have s 3 2 ) k = ) k log e k = 2 log e k ) The product of the above bouds for s 1, s 2, ad s 3 gives the followig boud: s 1 s 2 s 3 > 3 2 = kd 1) d 1) d 1) k ) d 1) 2 1 log e k ) Fially, we relax the above boud to ) d 1) log e 1 2 k ). ) d 1) 2/3) 2 1 log e k ) Our goal is to choose values of the parameters k ad d viewed as fuctios of ad m) so as to maximize the success probability of Procedure P. We choose the fuctios =, m) ad d 0 = d 0, m) i two steps. First, we fid a lower boud o the success probability of P. The maximum of this boud is attaied whe k is a certai fuctio of, m, ad d. The, substitutig this fuctio i the boud, we fid d 0, m) that maximizes the boud. Lma 2. For all k such that k 1 + log ) d d 1) log e Procedure P has the followig lower boud o the success probability: p, m, k, d) > ) d 1) log e 1 2 k ) Proof. Let A be a fixed satisfyig assigmet to F. Suppose that Procedure P fids A with t recursive calls, where t is some iteger i the iterval 0 t /k. The P simplifies formulas t times. For each simplificatio, the probability of guessig a clause i F that cosists of false literals is at least d/m. Therefore, with probability at least d/m) t, we get a formula G such that G is still satisfied by A; G has less tha d bad clauses; G has at most kt variables. Usig Lma 1, we get the followig lower boud o the probability of fidig A with t recursive calls: p, m, k, d) > ) d t m kt)) d 1) log e kt)1 2 k ) = ) d t m ) d 1) 1 kt ) d 1) 2 1 log e k )+kt1 log e k ) = β, m, k, d) d m ) t 1 kt = β, m, k, d) 2 t log m d ) d 1) 2 kt1 log e k ) ) d 1) log1 kt ) + kt1 log e k ) 2) 55

8 E. Datsi ad A. Wolpert where β deotes the lower boud i the claim: β, m, k, d) = ) d 1) log e 1 2 k ) Note that the β boud is the same as the boud give by Lma 1. Sice log1 x) < x log e for all 0 x < 1, we have p, m, k, d) > β, m, k, d) 2 t log m kd 1) )+ log e+k log e d = β, m, k, d) 2 t k 1+ mi t [β, m, k, d) 2 t k d 1) log e 1+ log d ) d 1) log e log d ) ] where the miimum is take over all t such that 0 t /k. The secod iequality i 2) is equivalet to ) d 1) log e k 1 + log ) d 0. Therefore, the miimum is attaied whe t = 0, which proves the claim. It follows from Lma 2 that Procedure P has the followig lower boud o the success probability: p, m, k, d) > mi [β, m, k, d) 2 t d 1) log e k 1+ log d ) ] 3) t What value of k maximizes this boud for give, m, ad d? A more thorough aalysis shows that this boud is maximum whe the iequality o k is replaced by the equality: k = 1 + log ) d d 1) log e Cosider the boud obtaied from 3) by substitutig this value for k. Differetiatio by d shows that this boud is maximum whe d is close to / log 3 ). However, k ad d must be itegers, so we take the ceiligs of those values of k ad d. Lma 3. For all ad m such that 10 < 2 3 /2, take the followig values of k ad d: = log ) + 3 log log) 1 + log e d 0 = log 3 ) log 3 4) ) The p, m,, d 0 ) > 2 1 log

9 A Faster Clause-Shorteig Algorithm Proof. First, we show that Lma 2 ca be applied for ad d 0, i.e. we show that 2) holds. It is straightforward to check the first iequality i 2). For the secod iequality we have ) ) 1 + d 0 1) log e log d 0 = ) 1 + d 0 1) log e log) + log d 0 log ) ) + 3 log log) log) + log = 0. log 3 ) Next, we substitute ad d 0 i the boud give by Lma 2. Note that d 0 = / log 3 )+ δ where 0 δ < 1. The we have usig < ) p, m,, d 0 ) > ) d0 1) 2 1 log e = ) δ+1 ) log 3 ) 2 1 log e > ) log 3 ) 2 1 log e = 2 log 2 ) > 2 = 2 log 2 ) log) 1 log e log) log ) 1 log e log) 2 log 2 1 log e ) It rais to prove that 2 log 2 ) + log e 1 log e ) + 2 This iequality is equivalet to log e log e log 2 ) which, i tur, is equivalet to ) 2 ) k k0 log) log e 5) Our assumptio 2 3 /2 implies < log). Ideed, ) < log + 3 log log) + 1 [ ) ] = log) log loglog 3 )) 2 log) Therefore, the first factor i 5) is less tha 1 uder the assumptio. To make sure that the secod factor is less tha log e 1.44, we otice that 5. Ideed, if 10 the > 3 log log) > 3 log log10) > 5. 57

10 E. Datsi ad A. Wolpert 5. Mai Result The mai algorithm Algorithm A) is a repetitio of Procedure P. Lma 3 shows that if we substitute ad d 0 defied i 4) for the parameters of P the the success probability of P is at least 2 1 log 2 +2 The umber r of repetitios is take to be the iverse to this probability: r = 2 1 log e +2 which gives a costat success probability of Algorithm A. Algorithm A Iput: Formula F i CNF with m clauses over variables. Output: Satisfyig assigmet or o. 1. Compute ad d 0 as i 4) ad r as i 6). 2. Repeat the followig r times: a) Ru PF,, d 0 ); b) If a satisfyig assigmet is foud, retur it ad halt. 3. Retur o. Theor 1. Algorithm A rus i time O 2 m) 2 1 log e +2 For ay satisfiable iput formula such that 10 < 2 3 /2, Algorithm A fids a satisfyig assigmet with probability greater tha 1/2. Proof. To prove the first claim, we eed to estimate the ruig time of Procedure P. The procedure recursively ivokes itself at most / times. Each call scas the iput formula ad elimiates at most variables. Therefore, the procedure performs less tha scas. Algorithm A repeats the procedure at most r times, which gives the boud i the claim. Let p A, m) be the success probability of Algorithm A. The p A, m) 1 1 p, m,, d 0 )) r Usig Lma 3 ad the iequality 1 x) r e xr, we have p A, m) 1 e 1. 6) Rark 1. Note that we ca write the boud i Theor 1 as O 2 m) 2 «1 1 l m )+Ol l m). 58

11 A Faster Clause-Shorteig Algorithm Rark 2. For formulas with a costat clause desity, i.e. if m is liear i, our boud is better tha i the geeral case: Ol l m) Rark 3. Our algorithm is based o the clause-shorteig approach proposed by Schuler [14]. His algorithm is deradomized with the same upper boud o the ruig time [5]. It would be atural to try to apply the same method of deradomizatio to our algorithm. However, the direct applicatio gives a determiistic algorithm with a much worse upper boud. Is it possible to deradomize Algorithm A with the same or a slightly worse upper boud? Ackowledgmets We thak Edward A. Hirsch ad Daiel Rolf for helpful discussios. We also thak the aoymous reviewers for their help i improvig the paper. Refereces [1] B. Bollobás. Radom Graphs. Cambridge Uiversity Press, 2d editio, [2] T. Bruegga ad W. Ker. A improved local search algorithm for 3-SAT. Theoretical Computer Sciece, ): , Decber [3] E. Datsi, A. Goerdt, E. A. Hirsch, R. Kaa, J. Kleiberg, C. Papadimitriou, P. Raghava, ad U. Schöig. A determiistic 2 2/k + 1)) algorithm for k-sat based o local search. Theoretical Computer Sciece, 289 1):69 83, [4] E. Datsi, E. A. Hirsch, ad A. Wolpert. Algorithms for SAT based o search i Hammig balls. I Proceedigs of the 21st Aual Symposium o Theoretical Aspects of Computer Sciece, STACS 2004, volume 2996 of Lecture Notes i Computer Sciece, pages Spriger, March [5] E. Datsi ad A. Wolpert. Deradomizatio of Schuler s algorithm for SAT. I Proceedigs of the 7th Iteratioal Coferece o Theory ad Applicatios of Satisfiability Testig, SAT 2004, pages 69 75, May [6] E. Datsi ad A. Wolpert. A improved upper boud for SAT. I Proceedigs of the 8th Iteratioal Coferece o Theory ad Applicatios o Satisfiability Testig, SAT 2005, volume 3569 of Lecture Notes i Computer Sciece, pages Spriger, Jue [7] K. Iwama ad S. Tamaki. Improved upper bouds for 3-SAT. I Proceedigs of the 15th Aual ACM-SIAM Symposium o Discrete Algorithms, SODA 2004, page 328, Jauary A prelimiary versio appeared i Electroic Colloquium o Computatioal Complexity, Report No. 53, July

12 E. Datsi ad A. Wolpert [8] R. Paturi, P. Pudlák, M. E. Saks, ad F. Zae. A improved expoetial-time algorithm for k-sat. I Proceedigs of the 39th Aual IEEE Symposium o Foudatios of Computer Sciece, FOCS 98, pages , [9] R. Paturi, P. Pudlák, ad F. Zae. Satisfiability codig lma. I Proceedigs of the 38th Aual IEEE Symposium o Foudatios of Computer Sciece, FOCS 97, pages , [10] P. Pudlák. Satisfiability algorithms ad logic. I Proceedigs of the 23rd Iteratioal Symposium o Mathatical Foudatios of Computer Sciece MFCS 98), volume 1450 of Lecture Notes i Computer Sciece, pages Spriger-Verlag, [11] D. Rolf. Deradomizatio of PPSZ for Uique-k-SAT. I Proceedigs of the 8th Iteratioal Coferece o Theory ad Applicatios o Satisfiability Testig, SAT 2005, volume 3569 of Lecture Notes i Computer Sciece, pages Spriger, Jue [12] U. Schöig. A probabilistic algorithm for k-sat ad costrait satisfactio probls. I Proceedigs of the 40th Aual IEEE Symposium o Foudatios of Computer Sciece, FOCS 99, pages , [13] U. Schöig. A probabilistic algorithm for k-sat based o limited local search ad restart. Algorithmica, 32 4): , [14] R. Schuler. A algorithm for the satisfiability probl of formulas i cojuctive ormal form. Joural of Algorithms, 54 1):40 44, Jauary A prelimiary versio appeared as a techical report i

Asymptotic Growth of Functions

Asymptotic Growth of Functions CMPS Itroductio to Aalysis of Algorithms Fall 3 Asymptotic Growth of Fuctios We itroduce several types of asymptotic otatio which are used to compare the performace ad efficiecy of algorithms As we ll

More information

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008

In nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008 I ite Sequeces Dr. Philippe B. Laval Keesaw State Uiversity October 9, 2008 Abstract This had out is a itroductio to i ite sequeces. mai de itios ad presets some elemetary results. It gives the I ite Sequeces

More information

Soving Recurrence Relations

Soving Recurrence Relations Sovig Recurrece Relatios Part 1. Homogeeous liear 2d degree relatios with costat coefficiets. Cosider the recurrece relatio ( ) T () + at ( 1) + bt ( 2) = 0 This is called a homogeeous liear 2d degree

More information

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies ( 3.1.1) Limitations of Experiments. Pseudocode ( 3.1.2) Theoretical Analysis

Running Time ( 3.1) Analysis of Algorithms. Experimental Studies ( 3.1.1) Limitations of Experiments. Pseudocode ( 3.1.2) Theoretical Analysis Ruig Time ( 3.) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.

More information

I. Chi-squared Distributions

I. Chi-squared Distributions 1 M 358K Supplemet to Chapter 23: CHI-SQUARED DISTRIBUTIONS, T-DISTRIBUTIONS, AND DEGREES OF FREEDOM To uderstad t-distributios, we first eed to look at aother family of distributios, the chi-squared distributios.

More information

Incremental calculation of weighted mean and variance

Incremental calculation of weighted mean and variance Icremetal calculatio of weighted mea ad variace Toy Fich faf@cam.ac.uk dot@dotat.at Uiversity of Cambridge Computig Service February 009 Abstract I these otes I eplai how to derive formulae for umerically

More information

5 Boolean Decision Trees (February 11)

5 Boolean Decision Trees (February 11) 5 Boolea Decisio Trees (February 11) 5.1 Graph Coectivity Suppose we are give a udirected graph G, represeted as a boolea adjacecy matrix = (a ij ), where a ij = 1 if ad oly if vertices i ad j are coected

More information

Module 4: Mathematical Induction

Module 4: Mathematical Induction Module 4: Mathematical Iductio Theme 1: Priciple of Mathematical Iductio Mathematical iductio is used to prove statemets about atural umbers. As studets may remember, we ca write such a statemet as a predicate

More information

Sequences II. Chapter 3. 3.1 Convergent Sequences

Sequences II. Chapter 3. 3.1 Convergent Sequences Chapter 3 Sequeces II 3. Coverget Sequeces Plot a graph of the sequece a ) = 2, 3 2, 4 3, 5 + 4,...,,... To what limit do you thik this sequece teds? What ca you say about the sequece a )? For ǫ = 0.,

More information

0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5

0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5 Sectio 13 Kolmogorov-Smirov test. Suppose that we have a i.i.d. sample X 1,..., X with some ukow distributio P ad we would like to test the hypothesis that P is equal to a particular distributio P 0, i.e.

More information

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES

SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,

More information

Learning outcomes. Algorithms and Data Structures. Time Complexity Analysis. Time Complexity Analysis How fast is the algorithm? Prof. Dr.

Learning outcomes. Algorithms and Data Structures. Time Complexity Analysis. Time Complexity Analysis How fast is the algorithm? Prof. Dr. Algorithms ad Data Structures Algorithm efficiecy Learig outcomes Able to carry out simple asymptotic aalysisof algorithms Prof. Dr. Qi Xi 2 Time Complexity Aalysis How fast is the algorithm? Code the

More information

4.1 Sigma Notation and Riemann Sums

4.1 Sigma Notation and Riemann Sums 0 the itegral. Sigma Notatio ad Riema Sums Oe strategy for calculatig the area of a regio is to cut the regio ito simple shapes, calculate the area of each simple shape, ad the add these smaller areas

More information

Chapter 6: Variance, the law of large numbers and the Monte-Carlo method

Chapter 6: Variance, the law of large numbers and the Monte-Carlo method Chapter 6: Variace, the law of large umbers ad the Mote-Carlo method Expected value, variace, ad Chebyshev iequality. If X is a radom variable recall that the expected value of X, E[X] is the average value

More information

A probabilistic proof of a binomial identity

A probabilistic proof of a binomial identity A probabilistic proof of a biomial idetity Joatho Peterso Abstract We give a elemetary probabilistic proof of a biomial idetity. The proof is obtaied by computig the probability of a certai evet i two

More information

Department of Computer Science, University of Otago

Department of Computer Science, University of Otago Departmet of Computer Sciece, Uiversity of Otago Techical Report OUCS-2006-09 Permutatios Cotaiig May Patters Authors: M.H. Albert Departmet of Computer Sciece, Uiversity of Otago Micah Colema, Rya Fly

More information

Properties of MLE: consistency, asymptotic normality. Fisher information.

Properties of MLE: consistency, asymptotic normality. Fisher information. Lecture 3 Properties of MLE: cosistecy, asymptotic ormality. Fisher iformatio. I this sectio we will try to uderstad why MLEs are good. Let us recall two facts from probability that we be used ofte throughout

More information

Convexity, Inequalities, and Norms

Convexity, Inequalities, and Norms Covexity, Iequalities, ad Norms Covex Fuctios You are probably familiar with the otio of cocavity of fuctios. Give a twicedifferetiable fuctio ϕ: R R, We say that ϕ is covex (or cocave up) if ϕ (x) 0 for

More information

x(x 1)(x 2)... (x k + 1) = [x] k n+m 1

x(x 1)(x 2)... (x k + 1) = [x] k n+m 1 1 Coutig mappigs For every real x ad positive iteger k, let [x] k deote the fallig factorial ad x(x 1)(x 2)... (x k + 1) ( ) x = [x] k k k!, ( ) k = 1. 0 I the sequel, X = {x 1,..., x m }, Y = {y 1,...,

More information

Lecture 4: Cauchy sequences, Bolzano-Weierstrass, and the Squeeze theorem

Lecture 4: Cauchy sequences, Bolzano-Weierstrass, and the Squeeze theorem Lecture 4: Cauchy sequeces, Bolzao-Weierstrass, ad the Squeeze theorem The purpose of this lecture is more modest tha the previous oes. It is to state certai coditios uder which we are guarateed that limits

More information

Infinite Sequences and Series

Infinite Sequences and Series CHAPTER 4 Ifiite Sequeces ad Series 4.1. Sequeces A sequece is a ifiite ordered list of umbers, for example the sequece of odd positive itegers: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29...

More information

The second difference is the sequence of differences of the first difference sequence, 2

The second difference is the sequence of differences of the first difference sequence, 2 Differece Equatios I differetial equatios, you look for a fuctio that satisfies ad equatio ivolvig derivatives. I differece equatios, istead of a fuctio of a cotiuous variable (such as time), we look for

More information

Irreducible polynomials with consecutive zero coefficients

Irreducible polynomials with consecutive zero coefficients Irreducible polyomials with cosecutive zero coefficiets Theodoulos Garefalakis Departmet of Mathematics, Uiversity of Crete, 71409 Heraklio, Greece Abstract Let q be a prime power. We cosider the problem

More information

Chapter 7 Methods of Finding Estimators

Chapter 7 Methods of Finding Estimators Chapter 7 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 011 Chapter 7 Methods of Fidig Estimators Sectio 7.1 Itroductio Defiitio 7.1.1 A poit estimator is ay fuctio W( X) W( X1, X,, X ) of

More information

Section 11.3: The Integral Test

Section 11.3: The Integral Test Sectio.3: The Itegral Test Most of the series we have looked at have either diverged or have coverged ad we have bee able to fid what they coverge to. I geeral however, the problem is much more difficult

More information

CS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations

CS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations CS3A Hadout 3 Witer 00 February, 00 Solvig Recurrece Relatios Itroductio A wide variety of recurrece problems occur i models. Some of these recurrece relatios ca be solved usig iteratio or some other ad

More information

Approximating Area under a curve with rectangles. To find the area under a curve we approximate the area using rectangles and then use limits to find

Approximating Area under a curve with rectangles. To find the area under a curve we approximate the area using rectangles and then use limits to find 1.8 Approximatig Area uder a curve with rectagles 1.6 To fid the area uder a curve we approximate the area usig rectagles ad the use limits to fid 1.4 the area. Example 1 Suppose we wat to estimate 1.

More information

Chair for Network Architectures and Services Institute of Informatics TU München Prof. Carle. Network Security. Chapter 2 Basics

Chair for Network Architectures and Services Institute of Informatics TU München Prof. Carle. Network Security. Chapter 2 Basics Chair for Network Architectures ad Services Istitute of Iformatics TU Müche Prof. Carle Network Security Chapter 2 Basics 2.4 Radom Number Geeratio for Cryptographic Protocols Motivatio It is crucial to

More information

Overview of some probability distributions.

Overview of some probability distributions. Lecture Overview of some probability distributios. I this lecture we will review several commo distributios that will be used ofte throughtout the class. Each distributio is usually described by its probability

More information

Lecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009)

Lecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009) 18.409 A Algorithmist s Toolkit October 27, 2009 Lecture 13 Lecturer: Joatha Keler Scribe: Joatha Pies (2009) 1 Outlie Last time, we proved the Bru-Mikowski iequality for boxes. Today we ll go over the

More information

PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY AN ALTERNATIVE MODEL FOR BONUS-MALUS SYSTEM

PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY AN ALTERNATIVE MODEL FOR BONUS-MALUS SYSTEM PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical ad Mathematical Scieces 2015, 1, p. 15 19 M a t h e m a t i c s AN ALTERNATIVE MODEL FOR BONUS-MALUS SYSTEM A. G. GULYAN Chair of Actuarial Mathematics

More information

Chapter 5 O A Cojecture Of Erdíos Proceedigs NCUR VIII è1994è, Vol II, pp 794í798 Jeærey F Gold Departmet of Mathematics, Departmet of Physics Uiversity of Utah Do H Tucker Departmet of Mathematics Uiversity

More information

Annuities Under Random Rates of Interest II By Abraham Zaks. Technion I.I.T. Haifa ISRAEL and Haifa University Haifa ISRAEL.

Annuities Under Random Rates of Interest II By Abraham Zaks. Technion I.I.T. Haifa ISRAEL and Haifa University Haifa ISRAEL. Auities Uder Radom Rates of Iterest II By Abraham Zas Techio I.I.T. Haifa ISRAEL ad Haifa Uiversity Haifa ISRAEL Departmet of Mathematics, Techio - Israel Istitute of Techology, 3000, Haifa, Israel I memory

More information

Lecture 2: Karger s Min Cut Algorithm

Lecture 2: Karger s Min Cut Algorithm priceto uiv. F 3 cos 5: Advaced Algorithm Desig Lecture : Karger s Mi Cut Algorithm Lecturer: Sajeev Arora Scribe:Sajeev Today s topic is simple but gorgeous: Karger s mi cut algorithm ad its extesio.

More information

Solving Divide-and-Conquer Recurrences

Solving Divide-and-Conquer Recurrences Solvig Divide-ad-Coquer Recurreces Victor Adamchik A divide-ad-coquer algorithm cosists of three steps: dividig a problem ito smaller subproblems solvig (recursively) each subproblem the combiig solutios

More information

Maximum Likelihood Estimators.

Maximum Likelihood Estimators. Lecture 2 Maximum Likelihood Estimators. Matlab example. As a motivatio, let us look at oe Matlab example. Let us geerate a radom sample of size 00 from beta distributio Beta(5, 2). We will lear the defiitio

More information

7. Sample Covariance and Correlation

7. Sample Covariance and Correlation 1 of 8 7/16/2009 6:06 AM Virtual Laboratories > 6. Radom Samples > 1 2 3 4 5 6 7 7. Sample Covariace ad Correlatio The Bivariate Model Suppose agai that we have a basic radom experimet, ad that X ad Y

More information

SAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx

SAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx SAMPLE QUESTIONS FOR FINAL EXAM REAL ANALYSIS I FALL 006 3 4 Fid the followig usig the defiitio of the Riema itegral: a 0 x + dx 3 Cosider the partitio P x 0 3, x 3 +, x 3 +,......, x 3 3 + 3 of the iterval

More information

ON AN INTEGRAL OPERATOR WHICH PRESERVE THE UNIVALENCE

ON AN INTEGRAL OPERATOR WHICH PRESERVE THE UNIVALENCE Proceedigs of the Iteratioal Coferece o Theory ad Applicatios of Mathematics ad Iformatics ICTAMI 3, Alba Iulia ON AN INTEGRAL OPERATOR WHICH PRESERVE THE UNIVALENCE by Maria E Gageoea ad Silvia Moldoveau

More information

Notes on Hypothesis Testing

Notes on Hypothesis Testing Probability & Statistics Grishpa Notes o Hypothesis Testig A radom sample X = X 1,..., X is observed, with joit pmf/pdf f θ x 1,..., x. The values x = x 1,..., x of X lie i some sample space X. The parameter

More information

Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing

Perfect Packing Theorems and the Average-Case Behavior of Optimal and Online Bin Packing SIAM REVIEW Vol. 44, No. 1, pp. 95 108 c 2002 Society for Idustrial ad Applied Mathematics Perfect Packig Theorems ad the Average-Case Behavior of Optimal ad Olie Bi Packig E. G. Coffma, Jr. C. Courcoubetis

More information

Modified Line Search Method for Global Optimization

Modified Line Search Method for Global Optimization Modified Lie Search Method for Global Optimizatio Cria Grosa ad Ajith Abraham Ceter of Excellece for Quatifiable Quality of Service Norwegia Uiversity of Sciece ad Techology Trodheim, Norway {cria, ajith}@q2s.tu.o

More information

arxiv:1012.1336v2 [cs.cc] 8 Dec 2010

arxiv:1012.1336v2 [cs.cc] 8 Dec 2010 Uary Subset-Sum is i Logspace arxiv:1012.1336v2 [cs.cc] 8 Dec 2010 1 Itroductio Daiel M. Kae December 9, 2010 I this paper we cosider the Uary Subset-Sum problem which is defied as follows: Give itegers

More information

{{1}, {2, 4}, {3}} {{1, 3, 4}, {2}} {{1}, {2}, {3, 4}} 5.4 Stirling Numbers

{{1}, {2, 4}, {3}} {{1, 3, 4}, {2}} {{1}, {2}, {3, 4}} 5.4 Stirling Numbers . Stirlig Numbers Whe coutig various types of fuctios from., we quicly discovered that eumeratig the umber of oto fuctios was a difficult problem. For a domai of five elemets ad a rage of four elemets,

More information

Vladimir N. Burkov, Dmitri A. Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT

Vladimir N. Burkov, Dmitri A. Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT Keywords: project maagemet, resource allocatio, etwork plaig Vladimir N Burkov, Dmitri A Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT The paper deals with the problems of resource allocatio betwee

More information

Chapter 5: Inner Product Spaces

Chapter 5: Inner Product Spaces Chapter 5: Ier Product Spaces Chapter 5: Ier Product Spaces SECION A Itroductio to Ier Product Spaces By the ed of this sectio you will be able to uderstad what is meat by a ier product space give examples

More information

where: T = number of years of cash flow in investment's life n = the year in which the cash flow X n i = IRR = the internal rate of return

where: T = number of years of cash flow in investment's life n = the year in which the cash flow X n i = IRR = the internal rate of return EVALUATING ALTERNATIVE CAPITAL INVESTMENT PROGRAMS By Ke D. Duft, Extesio Ecoomist I the March 98 issue of this publicatio we reviewed the procedure by which a capital ivestmet project was assessed. The

More information

8.1 Arithmetic Sequences

8.1 Arithmetic Sequences MCR3U Uit 8: Sequeces & Series Page 1 of 1 8.1 Arithmetic Sequeces Defiitio: A sequece is a comma separated list of ordered terms that follow a patter. Examples: 1, 2, 3, 4, 5 : a sequece of the first

More information

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 8

CME 302: NUMERICAL LINEAR ALGEBRA FALL 2005/06 LECTURE 8 CME 30: NUMERICAL LINEAR ALGEBRA FALL 005/06 LECTURE 8 GENE H GOLUB 1 Positive Defiite Matrices A matrix A is positive defiite if x Ax > 0 for all ozero x A positive defiite matrix has real ad positive

More information

University of California, Los Angeles Department of Statistics. Distributions related to the normal distribution

University of California, Los Angeles Department of Statistics. Distributions related to the normal distribution Uiversity of Califoria, Los Ageles Departmet of Statistics Statistics 100B Istructor: Nicolas Christou Three importat distributios: Distributios related to the ormal distributio Chi-square (χ ) distributio.

More information

2.7 Sequences, Sequences of Sets

2.7 Sequences, Sequences of Sets 2.7. SEQUENCES, SEQUENCES OF SETS 67 2.7 Sequeces, Sequeces of Sets 2.7.1 Sequeces Defiitio 190 (sequece Let S be some set. 1. A sequece i S is a fuctio f : K S where K = { N : 0 for some 0 N}. 2. For

More information

CS103X: Discrete Structures Homework 4 Solutions

CS103X: Discrete Structures Homework 4 Solutions CS103X: Discrete Structures Homewor 4 Solutios Due February 22, 2008 Exercise 1 10 poits. Silico Valley questios: a How may possible six-figure salaries i whole dollar amouts are there that cotai at least

More information

Divide and Conquer. Maximum/minimum. Integer Multiplication. CS125 Lecture 4 Fall 2015

Divide and Conquer. Maximum/minimum. Integer Multiplication. CS125 Lecture 4 Fall 2015 CS125 Lecture 4 Fall 2015 Divide ad Coquer We have see oe geeral paradigm for fidig algorithms: the greedy approach. We ow cosider aother geeral paradigm, kow as divide ad coquer. We have already see a

More information

Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling

Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling Taig DCOP to the Real World: Efficiet Complete Solutios for Distributed Multi-Evet Schedulig Rajiv T. Maheswara, Milid Tambe, Emma Bowrig, Joatha P. Pearce, ad Pradeep araatham Uiversity of Souther Califoria

More information

NPTEL STRUCTURAL RELIABILITY

NPTEL STRUCTURAL RELIABILITY NPTEL Course O STRUCTURAL RELIABILITY Module # 0 Lecture 1 Course Format: Web Istructor: Dr. Aruasis Chakraborty Departmet of Civil Egieerig Idia Istitute of Techology Guwahati 1. Lecture 01: Basic Statistics

More information

THE ABRACADABRA PROBLEM

THE ABRACADABRA PROBLEM THE ABRACADABRA PROBLEM FRANCESCO CARAVENNA Abstract. We preset a detailed solutio of Exercise E0.6 i [Wil9]: i a radom sequece of letters, draw idepedetly ad uiformly from the Eglish alphabet, the expected

More information

Sequences and Series

Sequences and Series CHAPTER 9 Sequeces ad Series 9.. Covergece: Defiitio ad Examples Sequeces The purpose of this chapter is to itroduce a particular way of geeratig algorithms for fidig the values of fuctios defied by their

More information

Output Analysis (2, Chapters 10 &11 Law)

Output Analysis (2, Chapters 10 &11 Law) B. Maddah ENMG 6 Simulatio 05/0/07 Output Aalysis (, Chapters 10 &11 Law) Comparig alterative system cofiguratio Sice the output of a simulatio is radom, the comparig differet systems via simulatio should

More information

Recursion and Recurrences

Recursion and Recurrences Chapter 5 Recursio ad Recurreces 5.1 Growth Rates of Solutios to Recurreces Divide ad Coquer Algorithms Oe of the most basic ad powerful algorithmic techiques is divide ad coquer. Cosider, for example,

More information

Cooley-Tukey. Tukey FFT Algorithms. FFT Algorithms. Cooley

Cooley-Tukey. Tukey FFT Algorithms. FFT Algorithms. Cooley Cooley Cooley-Tuey Tuey FFT Algorithms FFT Algorithms Cosider a legth- sequece x[ with a -poit DFT X[ where Represet the idices ad as +, +, Cooley Cooley-Tuey Tuey FFT Algorithms FFT Algorithms Usig these

More information

Lecture 4: Cheeger s Inequality

Lecture 4: Cheeger s Inequality Spectral Graph Theory ad Applicatios WS 0/0 Lecture 4: Cheeger s Iequality Lecturer: Thomas Sauerwald & He Su Statemet of Cheeger s Iequality I this lecture we assume for simplicity that G is a d-regular

More information

Your organization has a Class B IP address of 166.144.0.0 Before you implement subnetting, the Network ID and Host ID are divided as follows:

Your organization has a Class B IP address of 166.144.0.0 Before you implement subnetting, the Network ID and Host ID are divided as follows: Subettig Subettig is used to subdivide a sigle class of etwork i to multiple smaller etworks. Example: Your orgaizatio has a Class B IP address of 166.144.0.0 Before you implemet subettig, the Network

More information

Week 3 Conditional probabilities, Bayes formula, WEEK 3 page 1 Expected value of a random variable

Week 3 Conditional probabilities, Bayes formula, WEEK 3 page 1 Expected value of a random variable Week 3 Coditioal probabilities, Bayes formula, WEEK 3 page 1 Expected value of a radom variable We recall our discussio of 5 card poker hads. Example 13 : a) What is the probability of evet A that a 5

More information

Basic Elements of Arithmetic Sequences and Series

Basic Elements of Arithmetic Sequences and Series MA40S PRE-CALCULUS UNIT G GEOMETRIC SEQUENCES CLASS NOTES (COMPLETED NO NEED TO COPY NOTES FROM OVERHEAD) Basic Elemets of Arithmetic Sequeces ad Series Objective: To establish basic elemets of arithmetic

More information

Measures of Spread and Boxplots Discrete Math, Section 9.4

Measures of Spread and Boxplots Discrete Math, Section 9.4 Measures of Spread ad Boxplots Discrete Math, Sectio 9.4 We start with a example: Example 1: Comparig Mea ad Media Compute the mea ad media of each data set: S 1 = {4, 6, 8, 10, 1, 14, 16} S = {4, 7, 9,

More information

THIN SEQUENCES AND THE GRAM MATRIX PAMELA GORKIN, JOHN E. MCCARTHY, SANDRA POTT, AND BRETT D. WICK

THIN SEQUENCES AND THE GRAM MATRIX PAMELA GORKIN, JOHN E. MCCARTHY, SANDRA POTT, AND BRETT D. WICK THIN SEQUENCES AND THE GRAM MATRIX PAMELA GORKIN, JOHN E MCCARTHY, SANDRA POTT, AND BRETT D WICK Abstract We provide a ew proof of Volberg s Theorem characterizig thi iterpolatig sequeces as those for

More information

Trackless online algorithms for the server problem

Trackless online algorithms for the server problem Iformatio Processig Letters 74 (2000) 73 79 Trackless olie algorithms for the server problem Wolfgag W. Bei,LawreceL.Larmore 1 Departmet of Computer Sciece, Uiversity of Nevada, Las Vegas, NV 89154, USA

More information

The Stable Marriage Problem

The Stable Marriage Problem The Stable Marriage Problem William Hut Lae Departmet of Computer Sciece ad Electrical Egieerig, West Virgiia Uiversity, Morgatow, WV William.Hut@mail.wvu.edu 1 Itroductio Imagie you are a matchmaker,

More information

UC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Solutions 9 Spring 2006

UC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Solutions 9 Spring 2006 Exam format UC Bereley Departmet of Electrical Egieerig ad Computer Sciece EE 6: Probablity ad Radom Processes Solutios 9 Sprig 006 The secod midterm will be held o Wedesday May 7; CHECK the fial exam

More information

Our aim is to show that under reasonable assumptions a given 2π-periodic function f can be represented as convergent series

Our aim is to show that under reasonable assumptions a given 2π-periodic function f can be represented as convergent series 8 Fourier Series Our aim is to show that uder reasoable assumptios a give -periodic fuctio f ca be represeted as coverget series f(x) = a + (a cos x + b si x). (8.) By defiitio, the covergece of the series

More information

1. MATHEMATICAL INDUCTION

1. MATHEMATICAL INDUCTION 1. MATHEMATICAL INDUCTION EXAMPLE 1: Prove that for ay iteger 1. Proof: 1 + 2 + 3 +... + ( + 1 2 (1.1 STEP 1: For 1 (1.1 is true, sice 1 1(1 + 1. 2 STEP 2: Suppose (1.1 is true for some k 1, that is 1

More information

Integer Factorization Algorithms

Integer Factorization Algorithms Iteger Factorizatio Algorithms Coelly Bares Departmet of Physics, Orego State Uiversity December 7, 004 This documet has bee placed i the public domai. Cotets I. Itroductio 3 1. Termiology 3. Fudametal

More information

Chapter 14 Nonparametric Statistics

Chapter 14 Nonparametric Statistics Chapter 14 Noparametric Statistics A.K.A. distributio-free statistics! Does ot deped o the populatio fittig ay particular type of distributio (e.g, ormal). Sice these methods make fewer assumptios, they

More information

THE LEAST COMMON MULTIPLE OF A QUADRATIC SEQUENCE

THE LEAST COMMON MULTIPLE OF A QUADRATIC SEQUENCE THE LEAST COMMON MULTIPLE OF A QUADRATIC SEQUENCE JAVIER CILLERUELO Abstract. We obtai, for ay irreducible quadratic olyomial f(x = ax 2 + bx + c, the asymtotic estimate log l.c.m. {f(1,..., f(} log. Whe

More information

A Note on Sums of Greatest (Least) Prime Factors

A Note on Sums of Greatest (Least) Prime Factors It. J. Cotemp. Math. Scieces, Vol. 8, 203, o. 9, 423-432 HIKARI Ltd, www.m-hikari.com A Note o Sums of Greatest (Least Prime Factors Rafael Jakimczuk Divisio Matemática, Uiversidad Nacioal de Luá Bueos

More information

Recovery time guaranteed heuristic routing for improving computation complexity in survivable WDM networks

Recovery time guaranteed heuristic routing for improving computation complexity in survivable WDM networks Computer Commuicatios 30 (2007) 1331 1336 wwwelseviercom/locate/comcom Recovery time guarateed heuristic routig for improvig computatio complexity i survivable WDM etworks Lei Guo * College of Iformatio

More information

A Combined Continuous/Binary Genetic Algorithm for Microstrip Antenna Design

A Combined Continuous/Binary Genetic Algorithm for Microstrip Antenna Design A Combied Cotiuous/Biary Geetic Algorithm for Microstrip Atea Desig Rady L. Haupt The Pesylvaia State Uiversity Applied Research Laboratory P. O. Box 30 State College, PA 16804-0030 haupt@ieee.org Abstract:

More information

Example 2 Find the square root of 0. The only square root of 0 is 0 (since 0 is not positive or negative, so those choices don t exist here).

Example 2 Find the square root of 0. The only square root of 0 is 0 (since 0 is not positive or negative, so those choices don t exist here). BEGINNING ALGEBRA Roots ad Radicals (revised summer, 00 Olso) Packet to Supplemet the Curret Textbook - Part Review of Square Roots & Irratioals (This portio ca be ay time before Part ad should mostly

More information

The Euler Totient, the Möbius and the Divisor Functions

The Euler Totient, the Möbius and the Divisor Functions The Euler Totiet, the Möbius ad the Divisor Fuctios Rosica Dieva July 29, 2005 Mout Holyoke College South Hadley, MA 01075 1 Ackowledgemets This work was supported by the Mout Holyoke College fellowship

More information

3. Covariance and Correlation

3. Covariance and Correlation Virtual Laboratories > 3. Expected Value > 1 2 3 4 5 6 3. Covariace ad Correlatio Recall that by takig the expected value of various trasformatios of a radom variable, we ca measure may iterestig characteristics

More information

TO: Users of the ACTEX Review Seminar on DVD for SOA Exam MLC

TO: Users of the ACTEX Review Seminar on DVD for SOA Exam MLC TO: Users of the ACTEX Review Semiar o DVD for SOA Eam MLC FROM: Richard L. (Dick) Lodo, FSA Dear Studets, Thak you for purchasig the DVD recordig of the ACTEX Review Semiar for SOA Eam M, Life Cotigecies

More information

Key Ideas Section 8-1: Overview hypothesis testing Hypothesis Hypothesis Test Section 8-2: Basics of Hypothesis Testing Null Hypothesis

Key Ideas Section 8-1: Overview hypothesis testing Hypothesis Hypothesis Test Section 8-2: Basics of Hypothesis Testing Null Hypothesis Chapter 8 Key Ideas Hypothesis (Null ad Alterative), Hypothesis Test, Test Statistic, P-value Type I Error, Type II Error, Sigificace Level, Power Sectio 8-1: Overview Cofidece Itervals (Chapter 7) are

More information

Project Deliverables. CS 361, Lecture 28. Outline. Project Deliverables. Administrative. Project Comments

Project Deliverables. CS 361, Lecture 28. Outline. Project Deliverables. Administrative. Project Comments Project Deliverables CS 361, Lecture 28 Jared Saia Uiversity of New Mexico Each Group should tur i oe group project cosistig of: About 6-12 pages of text (ca be loger with appedix) 6-12 figures (please

More information

Approximating the Sum of a Convergent Series

Approximating the Sum of a Convergent Series Approximatig the Sum of a Coverget Series Larry Riddle Ages Scott College Decatur, GA 30030 lriddle@agesscott.edu The BC Calculus Course Descriptio metios how techology ca be used to explore covergece

More information

The Power of Free Branching in a General Model of Backtracking and Dynamic Programming Algorithms

The Power of Free Branching in a General Model of Backtracking and Dynamic Programming Algorithms The Power of Free Brachig i a Geeral Model of Backtrackig ad Dyamic Programmig Algorithms SASHKA DAVIS IDA/Ceter for Computig Scieces Bowie, MD sashka.davis@gmail.com RUSSELL IMPAGLIAZZO Dept. of Computer

More information

Hypothesis testing. Null and alternative hypotheses

Hypothesis testing. Null and alternative hypotheses Hypothesis testig Aother importat use of samplig distributios is to test hypotheses about populatio parameters, e.g. mea, proportio, regressio coefficiets, etc. For example, it is possible to stipulate

More information

Arithmetic of Triangular Fuzzy Variable from Credibility Theory

Arithmetic of Triangular Fuzzy Variable from Credibility Theory Vol., Issue 3, August 0 Arithmetic of Triagular Fuzzy Variable from Credibility Theory Ritupara Chutia (Correspodig Author) Departmet of Mathematics Gauhati Uiversity, Guwahati, Assam, Idia. Rituparachutia7@rediffmail.com

More information

Confidence Intervals for One Mean

Confidence Intervals for One Mean Chapter 420 Cofidece Itervals for Oe Mea Itroductio This routie calculates the sample size ecessary to achieve a specified distace from the mea to the cofidece limit(s) at a stated cofidece level for a

More information

NUMBERS COMMON TO TWO POLYGONAL SEQUENCES

NUMBERS COMMON TO TWO POLYGONAL SEQUENCES NUMBERS COMMON TO TWO POLYGONAL SEQUENCES DIANNE SMITH LUCAS Chia Lake, Califoria a iteger, The polygoal sequece (or sequeces of polygoal umbers) of order r (where r is r > 3) may be defied recursively

More information

Systems Design Project: Indoor Location of Wireless Devices

Systems Design Project: Indoor Location of Wireless Devices Systems Desig Project: Idoor Locatio of Wireless Devices Prepared By: Bria Murphy Seior Systems Sciece ad Egieerig Washigto Uiversity i St. Louis Phoe: (805) 698-5295 Email: bcm1@cec.wustl.edu Supervised

More information

THE HEIGHT OF q-binary SEARCH TREES

THE HEIGHT OF q-binary SEARCH TREES THE HEIGHT OF q-binary SEARCH TREES MICHAEL DRMOTA AND HELMUT PRODINGER Abstract. q biary search trees are obtaied from words, equipped with the geometric distributio istead of permutatios. The average

More information

Discrete Random Variables and Probability Distributions. Random Variables. Chapter 3 3.1

Discrete Random Variables and Probability Distributions. Random Variables. Chapter 3 3.1 UCLA STAT A Applied Probability & Statistics for Egieers Istructor: Ivo Diov, Asst. Prof. I Statistics ad Neurology Teachig Assistat: Neda Farziia, UCLA Statistics Uiversity of Califoria, Los Ageles, Sprig

More information

WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER?

WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER? WHEN IS THE (CO)SINE OF A RATIONAL ANGLE EQUAL TO A RATIONAL NUMBER? JÖRG JAHNEL 1. My Motivatio Some Sort of a Itroductio Last term I tought Topological Groups at the Göttige Georg August Uiversity. This

More information

4 n. n 1. You shold think of the Ratio Test as a generalization of the Geometric Series Test. For example, if a n ar n is a geometric sequence then

4 n. n 1. You shold think of the Ratio Test as a generalization of the Geometric Series Test. For example, if a n ar n is a geometric sequence then SECTION 2.6 THE RATIO TEST 79 2.6. THE RATIO TEST We ow kow how to hadle series which we ca itegrate (the Itegral Test), ad series which are similar to geometric or p-series (the Compariso Test), but of

More information

Partial Di erential Equations

Partial Di erential Equations Partial Di eretial Equatios Partial Di eretial Equatios Much of moder sciece, egieerig, ad mathematics is based o the study of partial di eretial equatios, where a partial di eretial equatio is a equatio

More information

A Recursive Formula for Moments of a Binomial Distribution

A Recursive Formula for Moments of a Binomial Distribution A Recursive Formula for Momets of a Biomial Distributio Árpád Béyi beyi@mathumassedu, Uiversity of Massachusetts, Amherst, MA 01003 ad Saverio M Maago smmaago@psavymil Naval Postgraduate School, Moterey,

More information

Research Article Sign Data Derivative Recovery

Research Article Sign Data Derivative Recovery Iteratioal Scholarly Research Network ISRN Applied Mathematics Volume 0, Article ID 63070, 7 pages doi:0.540/0/63070 Research Article Sig Data Derivative Recovery L. M. Housto, G. A. Glass, ad A. D. Dymikov

More information

CHAPTER 3 THE TIME VALUE OF MONEY

CHAPTER 3 THE TIME VALUE OF MONEY CHAPTER 3 THE TIME VALUE OF MONEY OVERVIEW A dollar i the had today is worth more tha a dollar to be received i the future because, if you had it ow, you could ivest that dollar ad ear iterest. Of all

More information

Time Value of Money, NPV and IRR equation solving with the TI-86

Time Value of Money, NPV and IRR equation solving with the TI-86 Time Value of Moey NPV ad IRR Equatio Solvig with the TI-86 (may work with TI-85) (similar process works with TI-83, TI-83 Plus ad may work with TI-82) Time Value of Moey, NPV ad IRR equatio solvig with

More information

Chapter 7 - Sampling Distributions. 1 Introduction. What is statistics? It consist of three major areas:

Chapter 7 - Sampling Distributions. 1 Introduction. What is statistics? It consist of three major areas: Chapter 7 - Samplig Distributios 1 Itroductio What is statistics? It cosist of three major areas: Data Collectio: samplig plas ad experimetal desigs Descriptive Statistics: umerical ad graphical summaries

More information