ICS141: Discrete Mathematics for Computer Science I
|
|
- Molly Barber
- 5 years ago
- Views:
Transcription
1 ICS4: Discrete Mthemtics for Computer Sciece I Dept. Iformtio & Computer Sci., J Stelovsky sed o slides y Dr. Bek d Dr. Still Origils y Dr. M. P. Frk d Dr. J.L. Gross Provided y McGrw-Hill 3-
2 Quiz. gcd(84,96). lcm(84,96) 3. gcd(84,96) x lcm(84,96) Hits Wht's the prime fctoriztio of 84? Wht's the prime fctoriztio of 96? Try the primes, 3 d 7 3-
3 Lecture 8 Chpter 3. The Fudmetls 3.6 Itegers d Algorithms 3-3
4 Review: Gretest Commo Divisor The gretest commo divisor gcd(,) of itegers, (ot oth ) is the lrgest iteger d tht is divisor oth of d of. d gcd(,) mx(d: d d ) d d e Z, (e e ) (d e) If the prime fctoriztios re writte s d p p p, the the GCD is give y: p p p gcd(, ) p mi(, ) p mi(, ) p mi(, ). Exmple: d gcd(84,96)
5 Review: Lest Commo Multiple lcm(,) of positive itegers,, is the smllest positive iteger tht is multiple oth of d of. E.g. lcm(6,) 3 m lcm(,) mi(m: m m) m m Z: ( ) (m ) If the prime fctoriztios re writte s d p p p, the the LCM is give y: p p p lcm(, ) p mx(, ) p mx(, ) p mx(, ). Exmple: d lcm(84,96)
6 GCD d LCM Theorem: Let d e positive itegers. The gcd(,) lcm(,) Exmple ( 3 7 ) ( ) mi(,5) 3 mi(,) 7 mi(,) mx(,5) 3 mx(,) 7 mx(,) gcd(,) lcm(,) 3-6
7 Itegers d Algorithms Topics: Bse- represettios of itegers. Especilly: iry, hexdeciml, octl. Algorithms for computer rithmetic: Biry dditio d multiplictio. Euclide lgorithm for fidig GCD s. 3-7
8 Bse- Numer Systems Ordirily, we write se- represettios of umers, usig digits -9. But, is t specil! Ay se > will work. For y positive itegers d, there is uique sequece k k- of digits i < such tht: k k i k i i k k k k Nottio: ( k k- ) The se- expsio of 3-8
9 Prticulr Bses of Iterest Bse (deciml): digits:,,,3,4,5,6,7,8,9. Bse (iry): digits:,. ( Bits iry digits. ) Bse 8 (octl): 8 digits:,,,3,4,5,6,7. Bse 6 (hexdeciml): Used oly ecuse we hve figers 6 digits:,,,3,4,5,6,7,8,9,a,b,c,d,e,f Used iterlly i ll moder computers Octl digits correspod to groups of 3 its Hex digits give groups of 4 its 3-9
10 Exmples Exmple : Deciml expsio of the iteger with iry expsio ()? () (35) Exmple : Deciml expsio of the iteger with hexdeciml expsio (AEB) 6? (AEB) (7567) 3-
11 Covertig to Bse (A lgorithm, iformlly stted.) To covert y iteger to y se > : To fid the vlue of the rightmost (lowestorder) digit, simply compute mod. Now, replce with the quotiet. Repet ove two steps to fid susequet digits, util is goe ( ). Exercise: Write this out i pseudocode 3-
12 3- Covertig to Bse q q q q q ) ( ) ( ) ( ) (
13 Exmples Exmple 3: Fid the se 8, i.e. octl, expsio of (345) Therefore, (345) (37) 8 3-3
14 Biry Hexdeciml Hexdeciml expsio of ( ) 3 E B C ( ) (3EBC) 6 Biry expsio of (A8D) 6 (A) 6 (), (8) 6 (), (D) 6 () (A8D) 6 ( ) 3-4
15 Additio of Biry Numers Crry: Crry itsum / s itidex itsum mod itsum crry 3-5
16 Additio of Biry Numers procedure dd(, : iry represettios of o-egtive itegers, ) crry : for itidex : to egi {go through its} itsum : itidex itidex crry {-it sum} crry : itsum / s itidex : itsum crry ed s : crry {high it of sum} {low it of sum} retur s s : iry represettio of iteger s 3-6
17 Multiplictio of Biry Numers ( - - ) ( ) ( ) ( - - ) x shift it to the left, i.e. pped extr -it shift it to the left, i.e. pped extr -its 3-7
18 Multiplictio of Biry Numers ( - - ) ( ) ( ) ( - - ) procedure multiply(, : iry represettios of positive itegers,) product : for i : to if i the retur product i extr -its ppeded fter the digits of i times product : dd(, product) 3-8
19 Divisio with Remider procedure div-mod( Z,d Z ) {quotiet & remider of /d} q : r : while r d egi r : r d q : q ed if < d r > the egi { is egtive} r : d r q : (q ) ed {q div d (quotiet), r mod d (remider)} 3-9
20 Euclid s Algorithm for GCD Fidig GCDs y comprig prime fctoriztios c e difficult whe the prime fctors re ot kow! Euclid discovered: Let q r, where,, q, d r re itegers. The gcd(,) gcd(,r) (i.e. gcd(,) gcd(, ( mod ))) Exmple: gcd(36, 4) gcd(4, ) Sort, so tht >, d the (give > ) ( mod ) <, so prolem is simplified. 3-
21 Euclid s Algorithm Exmple gcd(37, 64) gcd(64, 37 mod 64) 37 mod / gcd(64, 44) gcd(44, 64 mod 44) 64 mod / gcd(44, 3) gcd(3, 44 mod 3) gcd(3, ) gcd(, 3 mod ) gcd(, 8) gcd(8, mod 8) gcd(8, 4) gcd(4, 8 mod 4) gcd(4, ) 4 3-
22 Euclid s Algorithm Pseudocode procedure gcd(, : positive itegers) x : y : while y egi r : x mod y; x : y; y : r; ed retur x {x gcd(, )} 3-
23 Proof Tht Euclid s Algorithm Works Theorem : gcd(,) gcd(,c) if c mod. Proof: First, c mod implies t: t c. Let g gcd(,), d gʹ gcd(,c). Sice g d g (thus g t) we kow g ( t), i.e. g c. Sice g g c, it follows tht g gcd(,c) gʹ. Now, sice gʹ (thus gʹ t) d gʹ c, we kow gʹ (tc), i.e., gʹ. Sice gʹ gʹ, it follows tht gʹ gcd(,) g. Sice we hve show tht oth g gʹ d gʹ g, it must e the cse tht g gʹ. 3-3
24 Two s Complemet I iry, egtive umers c e coveietly represeted usig two s complemet ottio. I this scheme, strig of its c represet y iteger i such tht i <. The leftmost it is used to represet the sig (:positive, :egtive iteger) The egtio of y -it two s complemet umer is give y. The itwise logicl complemet of the -it strig. 3-4
25 Two s Complemet Exmple i < ( i < ) vlue 3-it ptter To oti the results for 4, cosider, the I the iry represettio of, replce ech y, d ech y, This is the oe s complemet of. Add (i.e. ) to the result from the previous step. This is the two s complemet of. Exmple 3: -> 3-5
26 Sutrctio of Biry Numers procedure sutrct(, : iry two s complemet reps. of itegers, ) retur dd(, dd(,)) { ( ) } Note tht this fils if either of the dds cuses crry ito or out of the positio, sice, d ( ) is t represetle! We cll this overflow. 3-6
27 Modulr Expoetitio Prolem: Give lrge itegers (se), (expoet), d m (modulus), efficietly compute mod m. Note tht itself my e completely ifesile to compute d store directly. E.g. if is,-it umer, the itself will hve fr more digits th there re toms i the uiverse! Yet, this is type of clcultio tht is commoly required i moder cryptogrphic lgorithms! 3-7
28 3-8 Algorithm Cocept ) ( ) ( ) ( k k k k k k k k Note tht: We c compute to vrious powers of y repeted squrig. The multiply them ito the prtil product, or ot, depedig o whether the correspodig i it is. Crucilly, we c do the mod m opertios s we go log, ecuse of the vrious idetity lws of modulr rithmetic. All the umers sty smll. The iry expsio of
29 Modulr Expoetitio procedure modulrexpoetitio(: iteger, ( k ), m: positive itegers) x : {ccumultes the result} i : mod m { i mod m; i iitilly} for i : to k egi {go thru ll k its of } if i the x : (x i) mod m i : (i i) mod m ed retur x {x equls mod m} i i ( i ) ( i ) 3-9
Laws of Integral Indices
A Lws of Itegrl Idices A. Positive Itegrl Idices I, is clled the se, is clled the idex lso clled the expoet. mes times.... Exmple Simplify 5 6 c Solutio 8 5 6 c 6 Exmple Simplify Solutio The results i
More informationAdvanced Algorithmic Problem Solving Le 6 Math and Search
Advced Algorithmic Prolem Solvig Le Mth d Serch Fredrik Heitz Dept of Computer d Iformtio Sciece Liköpig Uiversity Outlie Arithmetic (l. d.) Solvig lier equtio systems (l. d.) Chiese remider theorem (l.5
More informationCHAPTER 1 INTRODUCTION NUMBER SYSTEMS AND CONVERSION
Fudmetls of Logic Desig Chp. CHAPTE /9 INTODUCTION NUMBE SYSTEMS AND CONVESION This chpter i the book icludes: Objectives Study Guide. Digitl Systems d Switchig Circuits. Number Systems d Coversio. Biry
More informationChapter Real Numbers
Chpter. - Rel Numbers Itegers: coutig umbers, zero, d the egtive of the coutig umbers. ex: {,-3, -, -,,,, 3, } Rtiol Numbers: quotiets of two itegers with ozero deomitor; termitig or repetig decimls. ex:
More informationSection 6.3: Geometric Sequences
40 Chpter 6 Sectio 6.: Geometric Sequeces My jobs offer ul cost-of-livig icrese to keep slries cosistet with ifltio. Suppose, for exmple, recet college grdute fids positio s sles mger erig ul slry of $6,000.
More informationPresentation for use with the textbook, Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, Divide-and-Conquer
Presettio for use with the textook, Algorithm Desig d Applictios, y M. T. Goodrich d R. Tmssi, Wiley, 25 Divide-d-Coquer Divide-d-Coquer Divide-d coquer is geerl lgorithm desig prdigm: Divide: divide the
More informationThe Elementary Arithmetic Operators of Continued Fraction
Americ-Eursi Jourl of Scietific Reserch 0 (5: 5-63, 05 ISSN 88-6785 IDOSI Pulictios, 05 DOI: 0.589/idosi.ejsr.05.0.5.697 The Elemetry Arithmetic Opertors of Cotiued Frctio S. Mugssi d F. Mistiri Deprtmet
More informationNumbers (Part I) -- Solutions
Ley College -- For AMATYC SML Mth Competitio Cochig Sessios v.., [/7/00] sme s /6/009 versio, with presettio improvemets Numbers Prt I) -- Solutios. The equtio b c 008 hs solutio i which, b, c re distict
More informationRULES FOR MANIPULATING SURDS b. This is the addition law of surds with the same radicals. (ii)
SURDS Defiitio : Ay umer which c e expressed s quotiet m of two itegers ( 0 ), is clled rtiol umer. Ay rel umer which is ot rtiol is clled irrtiol. Irrtiol umers which re i the form of roots re clled surds.
More informationSect Simplifying Radical Expressions. We can use our properties of exponents to establish two properties of radicals: and
128 Sect 10.3 - Simplifyig Rdicl Expressios Cocept #1 Multiplictio d Divisio Properties of Rdicls We c use our properties of expoets to estlish two properties of rdicls: () 1/ 1/ 1/ & ( Multiplictio d
More informationWeek 13 Notes: 1) Riemann Sum. Aim: Compute Area Under a Graph. Suppose we want to find out the area of a graph, like the one on the right:
Week 1 Notes: 1) Riem Sum Aim: Compute Are Uder Grph Suppose we wt to fid out the re of grph, like the oe o the right: We wt to kow the re of the red re. Here re some wys to pproximte the re: We cut the
More informationThe total number of permutations of S is n!. We denote the set of all permutations of S by
DETERMINNTS. DEFINITIONS Def: Let S {,,, } e the set of itegers from to, rrged i scedig order. rerrgemet jjj j of the elemets of S is clled permuttio of S. S. The totl umer of permuttios of S is!. We deote
More informationWestchester Community College Elementary Algebra Study Guide for the ACCUPLACER
Westchester Commuity College Elemetry Alger Study Guide for the ACCUPLACER Courtesy of Aims Commuity College The followig smple questios re similr to the formt d cotet of questios o the Accuplcer Elemetry
More informationAssessment Center Elementary Algebra Study Guide for the ACCUPLACER (CPT)
Assessmet Ceter Elemetr Alger Stud Guide for the ACCUPLACER (CPT) The followig smple questios re similr to the formt d cotet of questios o the Accuplcer Elemetr Alger test. Reviewig these smples will give
More informationM3P14 EXAMPLE SHEET 1 SOLUTIONS
M3P14 EXAMPLE SHEET 1 SOLUTIONS 1. Show tht for, b, d itegers, we hve (d, db) = d(, b). Sice (, b) divides both d b, d(, b) divides both d d db, d hece divides (d, db). O the other hd, there exist m d
More information{ } { S n } is monotonically decreasing if Sn
Sequece A sequece is fuctio whose domi of defiitio is the set of turl umers. Or it c lso e defied s ordered set. Nottio: A ifiite sequece is deoted s { } S or { S : N } or { S, S, S,...} or simply s {
More informationGRAPHING LINEAR EQUATIONS. Linear Equations. x l ( 3,1 ) _x-axis. Origin ( 0, 0 ) Slope = change in y change in x. Equation for l 1.
GRAPHING LINEAR EQUATIONS Qudrt II Qudrt I ORDERED PAIR: The first umer i the ordered pir is the -coordite d the secod umer i the ordered pir is the y-coordite. (, ) Origi ( 0, 0 ) _-is Lier Equtios Qudrt
More informationINFINITE SERIES. ,... having infinite number of terms is called infinite sequence and its indicated sum, i.e., a 1
Appedix A.. Itroductio As discussed i the Chpter 9 o Sequeces d Series, sequece,,...,,... hvig ifiite umber of terms is clled ifiite sequece d its idicted sum, i.e., + + +... + +... is clled ifite series
More informationChapter Real Numbers
Chpter. - Rel Numbers Itegers: coutig umbers, zero, d the egtive of the coutig umbers. ex: {,-3, -, -, 0,,, 3, } Rtiol Numbers: quotiets of two itegers with ozero deomitor; termitig or repetig decimls.
More informationSM2H. Unit 2 Polynomials, Exponents, Radicals & Complex Numbers Notes. 3.1 Number Theory
SMH Uit Polyomils, Epoets, Rdicls & Comple Numbers Notes.1 Number Theory .1 Addig, Subtrctig, d Multiplyig Polyomils Notes Moomil: A epressio tht is umber, vrible, or umbers d vribles multiplied together.
More informationLecture 14. Encryption
Lecture 4. Ecryptio T. H. Corme, C. E. Leiserso d R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukw Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-207 Networkig Lbortory
More informationCH 39 USING THE GCF TO REDUCE FRACTIONS
359 CH 39 USING THE GCF TO EDUCE FACTIONS educig Algeric Frctios M ost of us lered to reduce rithmetic frctio dividig the top d the ottom of the frctio the sme (o-zero) umer. For exmple, 30 30 5 75 75
More informationRADICALS. Upon completion, you should be able to. define the principal root of numbers. simplify radicals
RADICALS m 1 RADICALS Upo completio, you should be ble to defie the pricipl root of umbers simplify rdicls perform dditio, subtrctio, multiplictio, d divisio of rdicls Mthemtics Divisio, IMSP, UPLB Defiitio:
More informationALGEBRA. Set of Equations. have no solution 1 b1. Dependent system has infinitely many solutions
Qudrtic Equtios ALGEBRA Remider theorem: If f() is divided b( ), the remider is f(). Fctor theorem: If ( ) is fctor of f(), the f() = 0. Ivolutio d Evlutio ( + b) = + b + b ( b) = + b b ( + b) 3 = 3 +
More informationMath 153: Lecture Notes For Chapter 1
Mth : Lecture Notes For Chpter Sectio.: Rel Nubers Additio d subtrctios : Se Sigs: Add Eples: = - - = - Diff. Sigs: Subtrct d put the sig of the uber with lrger bsolute vlue Eples: - = - = - Multiplictio
More informationis an ordered list of numbers. Each number in a sequence is a term of a sequence. n-1 term
Mthemticl Ptters. Arithmetic Sequeces. Arithmetic Series. To idetify mthemticl ptters foud sequece. To use formul to fid the th term of sequece. To defie, idetify, d pply rithmetic sequeces. To defie rithmetic
More informationHandout #2. Introduction to Matrix: Matrix operations & Geometric meaning
Hdout # Title: FAE Course: Eco 8/ Sprig/5 Istructor: Dr I-Mig Chiu Itroductio to Mtrix: Mtrix opertios & Geometric meig Mtrix: rectgulr rry of umers eclosed i pretheses or squre rckets It is covetiolly
More informationUnit 1. Extending the Number System. 2 Jordan School District
Uit Etedig the Number System Jord School District Uit Cluster (N.RN. & N.RN.): Etedig Properties of Epoets Cluster : Etedig properties of epoets.. Defie rtiol epoets d eted the properties of iteger epoets
More informationSUTCLIFFE S NOTES: CALCULUS 2 SWOKOWSKI S CHAPTER 11
UTCLIFFE NOTE: CALCULU WOKOWKI CHAPTER Ifiite eries Coverget or Diverget eries Cosider the sequece If we form the ifiite sum 0, 00, 000, 0 00 000, we hve wht is clled ifiite series We wt to fid the sum
More informationName: Period: Date: 2.1 Rules of Exponents
SM NOTES Ne: Period: Dte:.1 Rules of Epoets The followig properties re true for ll rel ubers d b d ll itegers d, provided tht o deoitors re 0 d tht 0 0 is ot cosidered. 1 s epoet: 1 1 1 = e.g.) 7 = 7,
More informationYOUR FINAL IS THURSDAY, MAY 24 th from 10:30 to 12:15
Algebr /Trig Fil Em Study Guide (Sprig Semester) Mrs. Duphy YOUR FINAL IS THURSDAY, MAY 4 th from 10:30 to 1:15 Iformtio About the Fil Em The fil em is cumultive for secod semester, coverig Chpters, 3,
More informationChapter 7 Infinite Series
MA Ifiite Series Asst.Prof.Dr.Supree Liswdi Chpter 7 Ifiite Series Sectio 7. Sequece A sequece c be thought of s list of umbers writte i defiite order:,,...,,... 2 The umber is clled the first term, 2
More informationIntermediate Arithmetic
Git Lerig Guides Iteredite Arithetic Nuer Syste, Surds d Idices Author: Rghu M.D. NUMBER SYSTEM Nuer syste: Nuer systes re clssified s Nturl, Whole, Itegers, Rtiol d Irrtiol uers. The syste hs ee digrticlly
More information( a n ) converges or diverges.
Chpter Ifiite Series Pge of Sectio E Rtio Test Chpter : Ifiite Series By the ed of this sectio you will be ble to uderstd the proof of the rtio test test series for covergece by pplyig the rtio test pprecite
More informationProject 3: Using Identities to Rewrite Expressions
MAT 5 Projet 3: Usig Idetities to Rewrite Expressios Wldis I lger, equtios tht desrie properties or ptters re ofte lled idetities. Idetities desrie expressio e repled with equl or equivlet expressio tht
More informationMathacle. PSet Stats, Concepts In Statistics Level Number Name: Date:
APPENDEX I. THE RAW ALGEBRA IN STATISTICS A I-1. THE INEQUALITY Exmple A I-1.1. Solve ech iequlity. Write the solutio i the itervl ottio..) 2 p - 6 p -8.) 2x- 3 < 5 Solutio:.). - 4 p -8 p³ 2 or pî[2, +
More information* power rule: * fraction raised to negative exponent: * expanded power rule:
Mth 15 Iteredite Alger Stud Guide for E 3 (Chpters 7, 8, d 9) You use 3 5 ote crd (oth sides) d scietific clcultor. You re epected to kow (or hve writte o our ote crd) foruls ou eed. Thik out rules d procedures
More informationLimit of a function:
- Limit of fuctio: We sy tht f ( ) eists d is equl with (rel) umer L if f( ) gets s close s we wt to L if is close eough to (This defiitio c e geerlized for L y syig tht f( ) ecomes s lrge (or s lrge egtive
More informationTHE NATIONAL UNIVERSITY OF IRELAND, CORK COLÁISTE NA hollscoile, CORCAIGH UNIVERSITY COLLEGE, CORK SUMMER EXAMINATION 2005 FIRST ENGINEERING
OLLSCOIL NA héireann, CORCAIGH THE NATIONAL UNIVERSITY OF IRELAND, CORK COLÁISTE NA hollscoile, CORCAIGH UNIVERSITY COLLEGE, CORK SUMMER EXAMINATION 2005 FIRST ENGINEERING MATHEMATICS MA008 Clculus d Lier
More information5. Solving recurrences
5. Solvig recurreces Time Complexity Alysis of Merge Sort T( ) 0 if 1 2T ( / 2) otherwise sortig oth hlves mergig Q. How to prove tht the ru-time of merge sort is O( )? A. 2 Time Complexity Alysis of Merge
More informationAppendix A Examples for Labs 1, 2, 3 1. FACTORING POLYNOMIALS
Appedi A Emples for Ls,,. FACTORING POLYNOMIALS Tere re m stdrd metods of fctorig tt ou ve lered i previous courses. You will uild o tese fctorig metods i our preclculus course to ele ou to fctor epressios
More informationStudent Success Center Elementary Algebra Study Guide for the ACCUPLACER (CPT)
Studet Success Ceter Elemetry Algebr Study Guide for the ACCUPLACER (CPT) The followig smple questios re similr to the formt d cotet of questios o the Accuplcer Elemetry Algebr test. Reviewig these smples
More informationLecture 2. Rational Exponents and Radicals. 36 y. b can be expressed using the. Rational Exponent, thus b. b can be expressed using the
Lecture. Rtiol Epoets d Rdicls Rtiol Epoets d Rdicls Lier Equtios d Iequlities i Oe Vrile Qudrtic Equtios Appedi A6 Nth Root - Defiitio Rtiol Epoets d Rdicls For turl umer, c e epressed usig the r is th
More informationUNIT 4 EXTENDING THE NUMBER SYSTEM Lesson 1: Working with the Number System Instruction
Lesso : Workig with the Nuber Syste Istructio Prerequisite Skills This lesso requires the use of the followig skills: evlutig expressios usig the order of opertios evlutig expoetil expressios ivolvig iteger
More informationCopyrighted by Gabriel Tang B.Ed., B.Sc. Page 1.
Alger Prerequisites Chpter: Alger Review P-: Modelig the Rel World Prerequisites Chpter: Alger Review Model: - mthemticl depictio of rel world coditio. - it c e formul (equtios with meigful vriles), properly
More informationSimilar idea to multiplication in N, C. Divide and conquer approach provides unexpected improvements. Naïve matrix multiplication
Next. Covered bsics of simple desig techique (Divided-coquer) Ch. of the text.. Next, Strsse s lgorithm. Lter: more desig d coquer lgorithms: MergeSort. Solvig recurreces d the Mster Theorem. Similr ide
More informationLinford 1. Kyle Linford. Math 211. Honors Project. Theorems to Analyze: Theorem 2.4 The Limit of a Function Involving a Radical (A4)
Liford 1 Kyle Liford Mth 211 Hoors Project Theorems to Alyze: Theorem 2.4 The Limit of Fuctio Ivolvig Rdicl (A4) Theorem 2.8 The Squeeze Theorem (A5) Theorem 2.9 The Limit of Si(x)/x = 1 (p. 85) Theorem
More information( x y ) x y. a b. a b. Chapter 2Properties of Exponents and Scientific Notation. x x. x y, Example: (x 2 )(x 4 ) = x 6.
Chpter Properties of Epoets d Scietific Nottio Epoet - A umer or symol, s i ( + y), plced to the right of d ove other umer, vrile, or epressio (clled the se), deotig the power to which the se is to e rised.
More informationGeneral properties of definite integrals
Roerto s Notes o Itegrl Clculus Chpter 4: Defiite itegrls d the FTC Sectio Geerl properties of defiite itegrls Wht you eed to kow lredy: Wht defiite Riem itegrl is. Wht you c ler here: Some key properties
More informationPOWER SERIES R. E. SHOWALTER
POWER SERIES R. E. SHOWALTER. sequeces We deote by lim = tht the limit of the sequece { } is the umber. By this we me tht for y ε > 0 there is iteger N such tht < ε for ll itegers N. This mkes precise
More informationLecture 4 Recursive Algorithm Analysis. Merge Sort Solving Recurrences The Master Theorem
Lecture 4 Recursive Algorithm Alysis Merge Sort Solvig Recurreces The Mster Theorem Merge Sort MergeSortA, left, right) { if left < right) { mid = floorleft + right) / 2); MergeSortA, left, mid); MergeSortA,
More informationStatistics for Financial Engineering Session 1: Linear Algebra Review March 18 th, 2006
Sttistics for Ficil Egieerig Sessio : Lier Algebr Review rch 8 th, 6 Topics Itroductio to trices trix opertios Determits d Crmer s rule Eigevlues d Eigevectors Quiz The cotet of Sessio my be fmilir to
More informationLAWS OF INDICES M.K. HOME TUITION. Mathematics Revision Guides Level: GCSE Higher Tier
Mthetics Revisio Guides Lws of Idices Pge of 7 Author: Mrk Kudlowski M.K. HOME TUITION Mthetics Revisio Guides Level: GCSE Higher Tier LAWS OF INDICES Versio:. Dte: 0--0 Mthetics Revisio Guides Lws of
More informationMA123, Chapter 9: Computing some integrals (pp )
MA13, Chpter 9: Computig some itegrls (pp. 189-05) Dte: Chpter Gols: Uderstd how to use bsic summtio formuls to evlute more complex sums. Uderstd how to compute its of rtiol fuctios t ifiity. Uderstd how
More informationElementary Linear Algebra
Elemetry Lier Alger Ato & Rorres, th Editio Lecture Set Chpter : Systems of Lier Equtios & Mtrices Chpter Cotets Itroductio to System of Lier Equtios Gussi Elimitio Mtrices d Mtri Opertios Iverses; Rules
More informationCS 331 Design and Analysis of Algorithms. -- Divide and Conquer. Dr. Daisy Tang
CS 33 Desig d Alysis of Algorithms -- Divide d Coquer Dr. Disy Tg Divide-Ad-Coquer Geerl ide: Divide problem ito subproblems of the sme id; solve subproblems usig the sme pproh, d ombie prtil solutios,
More informationLEVEL I. ,... if it is known that a 1
LEVEL I Fid the sum of first terms of the AP, if it is kow tht + 5 + 0 + 5 + 0 + = 5 The iterior gles of polygo re i rithmetic progressio The smllest gle is 0 d the commo differece is 5 Fid the umber of
More information,... are the terms of the sequence. If the domain consists of the first n positive integers only, the sequence is a finite sequence.
Chpter 9 & 0 FITZGERALD MAT 50/5 SECTION 9. Sequece Defiitio A ifiite sequece is fuctio whose domi is the set of positive itegers. The fuctio vlues,,, 4,...,,... re the terms of the sequece. If the domi
More informationAccuplacer Elementary Algebra Study Guide
Testig Ceter Studet Suess Ceter Aupler Elemetry Alger Study Guide The followig smple questios re similr to the formt d otet of questios o the Aupler Elemetry Alger test. Reviewig these smples will give
More informationMerge Sort. Outline and Reading. Divide-and-Conquer. Divide-and-conquer paradigm ( 4.1.1) Merge-sort ( 4.1.1)
Merge Sort 7 2 9 4 2 4 7 9 7 2 2 7 9 4 4 9 7 7 2 2 9 9 4 4 Merge Sort versio 1.3 1 Outlie d Redig Divide-d-coquer prdigm ( 4.1.1 Merge-sort ( 4.1.1 Algorithm Mergig two sorted sequeces Merge-sort tree
More informationTaylor Polynomials. The Tangent Line. (a, f (a)) and has the same slope as the curve y = f (x) at that point. It is the best
Tylor Polyomils Let f () = e d let p() = 1 + + 1 + 1 6 3 Without usig clcultor, evlute f (1) d p(1) Ok, I m still witig With little effort it is possible to evlute p(1) = 1 + 1 + 1 (144) + 6 1 (178) =
More information1 Summary: Binary and Logic
1 Summary: Biary ad Logic Biary Usiged Represetatio : each 1-bit is a power of two, the right-most is for 2 0 : 0110101 2 = 2 5 + 2 4 + 2 2 + 2 0 = 32 + 16 + 4 + 1 = 53 10 Usiged Rage o bits is [0...2
More informationTrial division, Pollard s p 1, Pollard s ρ, and Fermat s method. Christopher Koch 1. April 8, 2014
Iteger Divisio Algorithm ad Cogruece Iteger Trial divisio,,, ad with itegers mod Iverses mod Multiplicatio ad GCD Iteger Christopher Koch 1 1 Departmet of Computer Sciece ad Egieerig CSE489/589 Algorithms
More information( ) 2 3 ( ) I. Order of operations II. Scientific Notation. Simplify. Write answers in scientific notation. III.
Assessmet Ceter Elemetry Alger Study Guide for the ACCUPLACER (CPT) The followig smple questios re similr to the formt d otet of questios o the Aupler Elemetry Alger test. Reviewig these smples will give
More informationPROGRESSIONS AND SERIES
PROGRESSIONS AND SERIES A sequece is lso clled progressio. We ow study three importt types of sequeces: () The Arithmetic Progressio, () The Geometric Progressio, () The Hrmoic Progressio. Arithmetic Progressio.
More informationSection IV.6: The Master Method and Applications
Sectio IV.6: The Mster Method d Applictios Defiitio IV.6.1: A fuctio f is symptoticlly positive if d oly if there exists rel umer such tht f(x) > for ll x >. A cosequece of this defiitio is tht fuctio
More informationSUTCLIFFE S NOTES: CALCULUS 2 SWOKOWSKI S CHAPTER 11
SUTCLIFFE S NOTES: CALCULUS SWOKOWSKI S CHAPTER Ifiite Series.5 Altertig Series d Absolute Covergece Next, let us cosider series with both positive d egtive terms. The simplest d most useful is ltertig
More informationImproving XOR-Dominated Circuits by Exploiting Dependencies between Operands. Ajay K. Verma and Paolo Ienne. csda
Improvig XOR-Domited Circuits y Exploitig Depedecies etwee Operds Ajy K. Verm d Polo Iee csd Processor Architecture Lortory LAP & Cetre for Advced Digitl Systems CSDA Ecole Polytechique Fédérle de Luse
More informationFast Fourier Transform 1) Legendre s Interpolation 2) Vandermonde Matrix 3) Roots of Unity 4) Polynomial Evaluation
Algorithm Desig d Alsis Victor Admchi CS 5-45 Sprig 4 Lecture 3 J 7, 4 Cregie Mello Uiversit Outlie Fst Fourier Trsform ) Legedre s Iterpoltio ) Vdermode Mtri 3) Roots of Uit 4) Polomil Evlutio Guss (777
More informationDiscrete Mathematics I Tutorial 12
Discrete Mthemtics I Tutoril Refer to Chpter 4., 4., 4.4. For ech of these sequeces fid recurrece reltio stisfied by this sequece. (The swers re ot uique becuse there re ifiitely my differet recurrece
More informationMTH 146 Class 16 Notes
MTH 46 Clss 6 Notes 0.4- Cotiued Motivtio: We ow cosider the rc legth of polr curve. Suppose we wish to fid the legth of polr curve curve i terms of prmetric equtios s: r f where b. We c view the cos si
More informationConvergence rates of approximate sums of Riemann integrals
Covergece rtes of pproximte sums of Riem itegrls Hiroyuki Tski Grdute School of Pure d Applied Sciece, Uiversity of Tsuku Tsuku Irki 5-857 Jp tski@mth.tsuku.c.jp Keywords : covergece rte; Riem sum; Riem
More informationSurds, Indices, and Logarithms Radical
MAT 6 Surds, Idices, d Logrithms Rdicl Defiitio of the Rdicl For ll rel, y > 0, d ll itegers > 0, y if d oly if y where is the ide is the rdicl is the rdicd. Surds A umber which c be epressed s frctio
More informationFundamentals of Mathematics. Pascal s Triangle An Investigation March 20, 2008 Mario Soster
Fudmetls of Mthemtics Pscl s Trigle A Ivestigtio Mrch 0, 008 Mrio Soster Historicl Timelie A trigle showig the iomil coefficiets pper i Idi ook i the 0 th cetury I the th cetury Chiese mthemtici Yg Hui
More informationRepeated Root and Common Root
Repeted Root d Commo Root 1 (Method 1) Let α, β, γ e the roots of p(x) x + x + 0 (1) The α + β + γ 0, αβ + βγ + γα, αβγ - () (α - β) (α + β) - αβ (α + β) [ (βγ + γα)] + [(α + β) + γ (α + β)] +γ (α + β)
More informationInfinite Series Sequences: terms nth term Listing Terms of a Sequence 2 n recursively defined n+1 Pattern Recognition for Sequences Ex:
Ifiite Series Sequeces: A sequece i defied s fuctio whose domi is the set of positive itegers. Usully it s esier to deote sequece i subscript form rther th fuctio ottio.,, 3, re the terms of the sequece
More informationError-free compression
Error-free compressio Useful i pplictio where o loss of iformtio is tolerble. This mybe due to ccurcy requiremets, legl requiremets, or less th perfect qulity of origil imge. Compressio c be chieved by
More informationIntroduction to Computational Molecular Biology. Suffix Trees
18.417 Itroductio to Computtiol Moleculr Biology Lecture 11: October 14, 004 Scribe: Athich Muthitchroe Lecturer: Ross Lippert Editor: Toy Scelfo Suffix Trees This is oe of the most complicted dt structures
More informationFig. 1. I a. V ag I c. I n. V cg. Z n Z Y. I b. V bg
ymmetricl Compoets equece impedces Although the followig focuses o lods, the results pply eqully well to lies, or lies d lods. Red these otes together with sectios.6 d.9 of text. Cosider the -coected lced
More informationRecurrece reltio & Recursio 9 Chpter 3 Recurrece reltio & Recursio Recurrece reltio : A recurrece is equtio or iequlity tht describes fuctio i term of itself with its smller iputs. T T The problem of size
More informationCSE 1400 Applied Discrete Mathematics Number Theory and Proofs
CSE 1400 Applied Discrete Mathematics Number Theory ad Proofs Departmet of Computer Scieces College of Egieerig Florida Tech Sprig 01 Problems for Number Theory Backgroud Number theory is the brach of
More informationPre-Calculus - Chapter 3 Sections Notes
Pre-Clculus - Chpter 3 Sectios 3.1-3.4- Notes Properties o Epoets (Review) 1. ( )( ) = + 2. ( ) =, (c) = 3. 0 = 1 4. - = 1/( ) 5. 6. c Epoetil Fuctios (Sectio 3.1) Deiitio o Epoetil Fuctios The uctio deied
More informationINTEGRAL SOLUTIONS OF THE TERNARY CUBIC EQUATION
Itertiol Reserch Jourl of Egieerig d Techology IRJET) e-issn: 9-006 Volume: 04 Issue: Mr -017 www.irjet.et p-issn: 9-007 INTEGRL SOLUTIONS OF THE TERNRY CUBIC EQUTION y ) 4y y ) 97z G.Jki 1, C.Sry,* ssistt
More informationLincoln Land Community College Placement and Testing Office
Licol Ld Commuity College Plcemet d Testig Office Elemetry Algebr Study Guide for the ACCUPLACER (CPT) A totl of questios re dmiistered i this test. The first type ivolves opertios with itegers d rtiol
More information1.3 Continuous Functions and Riemann Sums
mth riem sums, prt 0 Cotiuous Fuctios d Riem Sums I Exmple we sw tht lim Lower() = lim Upper() for the fuctio!! f (x) = + x o [0, ] This is o ccidet It is exmple of the followig theorem THEOREM Let f be
More informationDiscrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Lecture 17
CS 70 Discrete Mthemtics d Proility Theory Sprig 206 Ro d Wlrd Lecture 7 Vrice We hve see i the previous ote tht if we toss coi times with is p, the the expected umer of heds is p. Wht this mes is tht
More informationALGEBRA II CHAPTER 7 NOTES. Name
ALGEBRA II CHAPTER 7 NOTES Ne Algebr II 7. th Roots d Rtiol Expoets Tody I evlutig th roots of rel ubers usig both rdicl d rtiol expoet ottio. I successful tody whe I c evlute th roots. It is iportt for
More informationSummer MA Lesson 4 Section P.3. such that =, denoted by =, is the principal square root
Suer MA 00 Lesso Sectio P. I Squre Roots If b, the b is squre root of. If is oegtive rel uber, the oegtive uber b b b such tht, deoted by, is the pricipl squre root of. rdicl sig rdicl expressio rdicd
More informationFACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING. Lectures
FACULTY OF MATHEMATICAL STUDIES MATHEMATICS FOR PART I ENGINEERING Lectures MODULE 0 FURTHER CALCULUS II. Sequeces d series. Rolle s theorem d me vlue theorems 3. Tlor s d Mcluri s theorems 4. L Hopitl
More informationUnit 1 Chapter-3 Partial Fractions, Algebraic Relationships, Surds, Indices, Logarithms
Uit Chpter- Prtil Frctios, Algeric Reltioships, Surds, Idices, Logriths. Prtil Frctios: A frctio of the for 7 where the degree of the uertor is less th the degree of the deoitor is referred to s proper
More informationGeometric Sequences. Geometric Sequence. Geometric sequences have a common ratio.
s A geometric sequece is sequece such tht ech successive term is obtied from the previous term by multiplyig by fixed umber clled commo rtio. Exmples, 6, 8,, 6,..., 0, 0, 0, 80,... Geometric sequeces hve
More informationInner Product Spaces (Chapter 5)
Ier Product Spces Chpter 5 I this chpter e ler out :.Orthogol ectors orthogol suspces orthogol mtrices orthogol ses. Proectios o ectors d o suspces Orthogol Suspces We ko he ectors re orthogol ut ht out
More informationLecture 3. Introduction digital logic. Notes. Notes. Notes. Representations. February Bern University of Applied Sciences.
Lecture 3 Ferury 6 ern University of pplied ciences ev. f57fc 3. We hve seen tht circuit cn hve multiple (n) inputs, e.g.,, C, We hve lso seen tht circuit cn hve multiple (m) outputs, e.g. X, Y,, ; or
More informationMATH 118 HW 7 KELLY DOUGAN, ANDREW KOMAR, MARIA SIMBIRSKY, BRANDEN LASKE
MATH 118 HW 7 KELLY DOUGAN, ANDREW KOMAR, MARIA SIMBIRSKY, BRANDEN LASKE Prt 1. Let be odd rime d let Z such tht gcd(, 1. Show tht if is qudrtic residue mod, the is qudrtic residue mod for y ositive iteger.
More informationChapter 2 Infinite Series Page 1 of 9
Chpter Ifiite eries Pge of 9 Chpter : Ifiite eries ectio A Itroductio to Ifiite eries By the ed of this sectio you will be ble to uderstd wht is met by covergece d divergece of ifiite series recogise geometric
More informationAlgebra II, Chapter 7. Homework 12/5/2016. Harding Charter Prep Dr. Michael T. Lewchuk. Section 7.1 nth roots and Rational Exponents
Algebr II, Chpter 7 Hrdig Chrter Prep 06-07 Dr. Michel T. Lewchuk Test scores re vilble olie. I will ot discuss the test. st retke opportuit Sturd Dec. If ou hve ot tke the test, it is our resposibilit
More informationVectors. Vectors in Plane ( 2
Vectors Vectors i Ple ( ) The ide bout vector is to represet directiol force Tht mes tht every vector should hve two compoets directio (directiol slope) d mgitude (the legth) I the ple we preset vector
More informationWe will begin by supplying the proof to (a).
(The solutios of problem re mostly from Jeffrey Mudrock s HWs) Problem 1. There re three sttemet from Exmple 5.4 i the textbook for which we will supply proofs. The sttemets re the followig: () The spce
More informationLecture 4 Recursive Algorithm Analysis. Merge Sort Solving Recurrences The Master Theorem
Lecture 4 Recursive Algorithm Alysis Merge Sort Solvig Recurreces The Mster Theorem Merge Sort MergeSortA, left, right) { if left < right) { mid floorleft right) / 2); MergeSortA, left, mid); MergeSortA,
More information0 otherwise. sin( nx)sin( kx) 0 otherwise. cos( nx) sin( kx) dx 0 for all integers n, k.
. Computtio of Fourier Series I this sectio, we compute the Fourier coefficiets, f ( x) cos( x) b si( x) d b, i the Fourier series To do this, we eed the followig result o the orthogolity of the trigoometric
More information