18.S34 (FALL, 2007) GREATEST INTEGER PROBLEMS. n + n + 1 = 4n + 2.

Size: px
Start display at page:

Download "18.S34 (FALL, 2007) GREATEST INTEGER PROBLEMS. n + n + 1 = 4n + 2."

Transcription

1 18.S34 (FALL, 007) GREATEST INTEGER PROBLEMS Note: We use the otatio x for the greatest iteger x, eve if the origial source used the older otatio [x]. 1. (48P) If is a positive iteger, prove that = (a) Let p deote a prie uber, ad let be ay positive iteger. Show that the expoet of the highest power of p which divides! is + + +, p p p s where p s+1 >. (b) I how ay zeros does the uber 1000! ed, whe writte i base 10? 3. (a) Prove ( ) that the expoet of the highest power of p which divides is equal to the uber of carries that occur whe ad are added i base p (Kuer s theore). (b) For > 1 a coposite iteger, prove that ot all of ( ) ( ),..., 1 1 ca be divisible by. 4. Prove that for ay positive itegers i, j, k, is a iteger. (3i)!(3j)!(3k)! i!j!k!(i + j)!(j + k)!(k + i)! 5. Prove that for ay itegers 1,... k, the product j i j i is a iteger. 1 i<j k 1

2 6. (68IMO) For every atural uber, evaluate the su + k k = k+1 4 k+1 k=0 7. A sequece of real ubers is defied by the oliear first order recurrece u +1 = u (u 3). (a) If u 0 = 5/, give a siple forula for u. (b) If u 0 = 4, how ay digits (i base te) does u 10 have? 8. Defie a sequece a 1 < a < of positive itegers as follows. Pick a 1 = 1. Oce a 1,..., a have bee chose, let a +1 be the least positive iteger ot already chose ad ot of the for a i + i for 1 i. Thus a = is ot allowed, so a = 3. Now a + = 5 is also ot allowed, so a 3 = 4. The a = 7 is ot allowed, so a 4 = 6, etc. The sequece begis: 1, 3, 4, 6, 8, 9, 11, 1, 14, 16, 17, 19,.... Fid a siple forula for a. Your forula should eable you, for istace, to copute a 1,000, (a) (Proble A6, 93P; o cotestat solved it.) The ifiite sequece of s ad 3 s, 3, 3,, 3, 3, 3,, 3, 3, 3,, 3, 3,, 3, 3, 3,, 3, 3, 3,, 3, 3, 3,, 3, 3,, 3, 3, 3,,... has the property that, if oe fors a secod sequece that records the uber of 3 s betwee successive s, the result is idetical to the first sequece. Show that there exists a real uber r such that, for ay, the th ter of the sequece is if ad oly if = 1 + r for soe oegative iteger. (b) (siilar i flavor to (a), though ot ivolvig the greatest iteger fuctio) Let a 1, a,... be the sequece 1,,, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 8, 9, 9, 9, 9, 9,...

3 of itegers a defied as follows: a 1 = 1, a 1 a a 3, ad a is the uber of s appearig i the sequece. Fid real ubers α, c > 0 such that a li = c. α 10. (Proble B6, 95P; five of the top 04 cotestats received at least 9 poits (out of 10), ad o oe received 3 8 poits.) For a positive real uber α, defie S(α) = { α : = 1,, 3,...}. Prove that {1,, 3,...} caot be expressed as the disjoit uio of three sets S(α), S(β), ad S(γ). 11. Let be a positive iteger ad k ay iteger. Defie a sequece a, a +1,... as follows: a = k + a +1 = a,. Show that there exists a positive iteger N ad polyoials P 0 (),P 1 (),..., P N 1 () such that for all 0 i N 1 ad all itegers t for which tn + i, we have a tn+i = P i (t). 1. (Proble B1, 97P; 171 of the top 05 cotestats received 10 poits, ad 14 others received 8 9 poits.) Let {x} deote the distace betwee the real uber x ad the earest iteger. For each positive iteger, evaluate 6 1 ({ } { }) F = i,. 6 3 =1 (Here i(a, b) deotes the iiu of a ad b.) 13. (Proble B4, 98P; 73 of the top 199 cotestats received at least 8 poits.) Fid ecessary ad sufficiet coditios o positive itegers ad so that 1 ( 1) i/ + i/ = 0. i=0 3

4 14. (Proble B3, 01P; 9 of the top 00 cotestats received at least 8 poits.) For ay positive iteger, let deote the closest iteger to. Evaluate +. =1 15. (Proble B3, 03P; 15 of the top 01 cotestats received at least 8 poits.) Show that for each positive iteger,! = lc{1,,..., /i }. i=1 (Here lc deotes the least coo ultiple.) 16. Defie a 1 = 1 ad a +1 = a (a + 1), 1. Thus (a 1,..., a 10 ) = (1,, 3, 4, 6, 9, 13, 19, 7, 38). Show that a +1 a = 1, ad fid a siple descriptio of a +1 a Prove that for all positive itegers,, 1 k gcd(, ) = + +. k=0 18. Let a, b, c, d be real ubers such that a + b = c + d for all positive itegers. Prove that at least oe of a + b, a c, a d is a iteger. 19. Let p be a prie cogruet to 1 odulo 4. Prove that (p 1)/4 p 1 ip =. 1 i= Which positive itegers ca be writte i the for + + for soe positive iteger? 1. For a positive iteger, let x be the last digit i the decial represetatio of /. Is the sequece x 1, x,... periodic? 4

5 MIT OpeCourseWare 18.A34 Matheatical Proble Solvig (Puta Seiar) Fall 018 For iforatio about citig these aterials or our Ters of Use, visit:

On the transcendence of infinite sums of values of rational functions

On the transcendence of infinite sums of values of rational functions O the trascedece of ifiite sus of values of ratioal fuctios N. Saradha ad R. Tijdea Abstract P () = We ivestigate coverget sus T = Q() ad U = P (X), Q(X) Q[X], ad Q(X) has oly siple ratioal roots. = (

More information

Discrete Mathematics: Lectures 8 and 9 Principle of Inclusion and Exclusion Instructor: Arijit Bishnu Date: August 11 and 13, 2009

Discrete Mathematics: Lectures 8 and 9 Principle of Inclusion and Exclusion Instructor: Arijit Bishnu Date: August 11 and 13, 2009 Discrete Matheatics: Lectures 8 ad 9 Priciple of Iclusio ad Exclusio Istructor: Arijit Bishu Date: August ad 3, 009 As you ca observe by ow, we ca cout i various ways. Oe such ethod is the age-old priciple

More information

Jacobi symbols. p 1. Note: The Jacobi symbol does not necessarily distinguish between quadratic residues and nonresidues. That is, we could have ( a

Jacobi symbols. p 1. Note: The Jacobi symbol does not necessarily distinguish between quadratic residues and nonresidues. That is, we could have ( a Jacobi sybols efiitio Let be a odd positive iteger If 1, the Jacobi sybol : Z C is the costat fuctio 1 1 If > 1, it has a decopositio ( as ) a product of (ot ecessarily distict) pries p 1 p r The Jacobi

More information

Bertrand s postulate Chapter 2

Bertrand s postulate Chapter 2 Bertrad s postulate Chapter We have see that the sequece of prie ubers, 3, 5, 7,... is ifiite. To see that the size of its gaps is ot bouded, let N := 3 5 p deote the product of all prie ubers that are

More information

Binomial transform of products

Binomial transform of products Jauary 02 207 Bioial trasfor of products Khristo N Boyadzhiev Departet of Matheatics ad Statistics Ohio Norther Uiversity Ada OH 4580 USA -boyadzhiev@ouedu Abstract Give the bioial trasfors { b } ad {

More information

Automated Proofs for Some Stirling Number Identities

Automated Proofs for Some Stirling Number Identities Autoated Proofs for Soe Stirlig Nuber Idetities Mauel Kauers ad Carste Scheider Research Istitute for Sybolic Coputatio Johaes Kepler Uiversity Altebergerstraße 69 A4040 Liz, Austria Subitted: Sep 1, 2007;

More information

Generalized Fibonacci-Like Sequence and. Fibonacci Sequence

Generalized Fibonacci-Like Sequence and. Fibonacci Sequence It. J. Cotep. Math. Scieces, Vol., 04, o., - 4 HIKARI Ltd, www.-hiari.co http://dx.doi.org/0.88/ijcs.04.48 Geeralized Fiboacci-Lie Sequece ad Fiboacci Sequece Sajay Hare epartet of Matheatics Govt. Holar

More information

Math 155 (Lecture 3)

Math 155 (Lecture 3) Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,

More information

COMP 2804 Solutions Assignment 1

COMP 2804 Solutions Assignment 1 COMP 2804 Solutios Assiget 1 Questio 1: O the first page of your assiget, write your ae ad studet uber Solutio: Nae: Jaes Bod Studet uber: 007 Questio 2: I Tic-Tac-Toe, we are give a 3 3 grid, cosistig

More information

Statistics for Applications Fall Problem Set 7

Statistics for Applications Fall Problem Set 7 18.650. Statistics for Applicatios Fall 016. Proble Set 7 Due Friday, Oct. 8 at 1 oo Proble 1 QQ-plots Recall that the Laplace distributio with paraeter λ > 0 is the cotiuous probaλ bility easure with

More information

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS

THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity

More information

and each factor on the right is clearly greater than 1. which is a contradiction, so n must be prime.

and each factor on the right is clearly greater than 1. which is a contradiction, so n must be prime. MATH 324 Summer 200 Elemetary Number Theory Solutios to Assigmet 2 Due: Wedesday July 2, 200 Questio [p 74 #6] Show that o iteger of the form 3 + is a prime, other tha 2 = 3 + Solutio: If 3 + is a prime,

More information

x !1! + 1!2!

x !1! + 1!2! 4 Euler-Maclauri Suatio Forula 4. Beroulli Nuber & Beroulli Polyoial 4.. Defiitio of Beroulli Nuber Beroulli ubers B (,,3,) are defied as coefficiets of the followig equatio. x e x - B x! 4.. Expreesio

More information

Name Period ALGEBRA II Chapter 1B and 2A Notes Solving Inequalities and Absolute Value / Numbers and Functions

Name Period ALGEBRA II Chapter 1B and 2A Notes Solving Inequalities and Absolute Value / Numbers and Functions Nae Period ALGEBRA II Chapter B ad A Notes Solvig Iequalities ad Absolute Value / Nubers ad Fuctios SECTION.6 Itroductio to Solvig Equatios Objectives: Write ad solve a liear equatio i oe variable. Solve

More information

PROBLEMS ON ABSTRACT ALGEBRA

PROBLEMS ON ABSTRACT ALGEBRA PROBLEMS ON ABSTRACT ALGEBRA 1 (Putam 197 A). Let S be a set ad let be a biary operatio o S satisfyig the laws x (x y) = y for all x, y i S, (y x) x = y for all x, y i S. Show that is commutative but ot

More information

FACTORS OF SUMS OF POWERS OF BINOMIAL COEFFICIENTS. Dedicated to the memory of Paul Erdős. 1. Introduction. n k. f n,a =

FACTORS OF SUMS OF POWERS OF BINOMIAL COEFFICIENTS. Dedicated to the memory of Paul Erdős. 1. Introduction. n k. f n,a = FACTORS OF SUMS OF POWERS OF BINOMIAL COEFFICIENTS NEIL J. CALKIN Abstract. We prove divisibility properties for sus of powers of bioial coefficiets ad of -bioial coefficiets. Dedicated to the eory of

More information

Summer MA Lesson 13 Section 1.6, Section 1.7 (part 1)

Summer MA Lesson 13 Section 1.6, Section 1.7 (part 1) Suer MA 1500 Lesso 1 Sectio 1.6, Sectio 1.7 (part 1) I Solvig Polyoial Equatios Liear equatio ad quadratic equatios of 1 variable are specific types of polyoial equatios. Soe polyoial equatios of a higher

More information

distinct distinct n k n k n! n n k k n 1 if k n, identical identical p j (k) p 0 if k > n n (k)

distinct distinct n k n k n! n n k k n 1 if k n, identical identical p j (k) p 0 if k > n n (k) THE TWELVEFOLD WAY FOLLOWING GIAN-CARLO ROTA How ay ways ca we distribute objects to recipiets? Equivaletly, we wat to euerate equivalece classes of fuctios f : X Y where X = ad Y = The fuctios are subject

More information

Putnam Training Exercise Counting, Probability, Pigeonhole Principle (Answers)

Putnam Training Exercise Counting, Probability, Pigeonhole Principle (Answers) Putam Traiig Exercise Coutig, Probability, Pigeohole Pricile (Aswers) November 24th, 2015 1. Fid the umber of iteger o-egative solutios to the followig Diohatie equatio: x 1 + x 2 + x 3 + x 4 + x 5 = 17.

More information

CS 70 Second Midterm 7 April NAME (1 pt): SID (1 pt): TA (1 pt): Name of Neighbor to your left (1 pt): Name of Neighbor to your right (1 pt):

CS 70 Second Midterm 7 April NAME (1 pt): SID (1 pt): TA (1 pt): Name of Neighbor to your left (1 pt): Name of Neighbor to your right (1 pt): CS 70 Secod Midter 7 April 2011 NAME (1 pt): SID (1 pt): TA (1 pt): Nae of Neighbor to your left (1 pt): Nae of Neighbor to your right (1 pt): Istructios: This is a closed book, closed calculator, closed

More information

Bernoulli Polynomials Talks given at LSBU, October and November 2015 Tony Forbes

Bernoulli Polynomials Talks given at LSBU, October and November 2015 Tony Forbes Beroulli Polyoials Tals give at LSBU, October ad Noveber 5 Toy Forbes Beroulli Polyoials The Beroulli polyoials B (x) are defied by B (x), Thus B (x) B (x) ad B (x) x, B (x) x x + 6, B (x) dx,. () B 3

More information

Chapter 0. Review of set theory. 0.1 Sets

Chapter 0. Review of set theory. 0.1 Sets Chapter 0 Review of set theory Set theory plays a cetral role i the theory of probability. Thus, we will ope this course with a quick review of those otios of set theory which will be used repeatedly.

More information

KNOWLEDGE OF NUMBER SENSE, CONCEPTS, AND OPERATIONS

KNOWLEDGE OF NUMBER SENSE, CONCEPTS, AND OPERATIONS DOMAIN I. COMPETENCY.0 MATHEMATICS KNOWLEDGE OF NUMBER SENSE, CONCEPTS, AND OPERATIONS Skill. Apply ratio ad proportio to solve real-world problems. A ratio is a compariso of umbers. If a class had boys

More information

CSE 1400 Applied Discrete Mathematics Number Theory and Proofs

CSE 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 information

[ 47 ] then T ( m ) is true for all n a. 2. The greatest integer function : [ ] is defined by selling [ x]

[ 47 ] then T ( m ) is true for all n a. 2. The greatest integer function : [ ] is defined by selling [ x] [ 47 ] Number System 1. Itroductio Pricile : Let { T ( ) : N} be a set of statemets, oe for each atural umber. If (i), T ( a ) is true for some a N ad (ii) T ( k ) is true imlies T ( k 1) is true for all

More information

SphericalHarmonicY. Notations. Primary definition. Specific values. Traditional name. Traditional notation. Mathematica StandardForm notation

SphericalHarmonicY. Notations. Primary definition. Specific values. Traditional name. Traditional notation. Mathematica StandardForm notation SphericalHaroicY Notatios Traditioal ae Spherical haroic Traditioal otatio Y, φ Matheatica StadardFor otatio SphericalHaroicY,,, φ Priary defiitio 05.0.0.000.0 Y, φ φ P cos ; 05.0.0.000.0 Y 0 k, φ k k

More information

CHAPTER 10 INFINITE SEQUENCES AND SERIES

CHAPTER 10 INFINITE SEQUENCES AND SERIES CHAPTER 10 INFINITE SEQUENCES AND SERIES 10.1 Sequeces 10.2 Ifiite Series 10.3 The Itegral Tests 10.4 Compariso Tests 10.5 The Ratio ad Root Tests 10.6 Alteratig Series: Absolute ad Coditioal Covergece

More information

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 +

62. Power series Definition 16. (Power series) Given a sequence {c n }, the series. c n x n = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + 62. Power series Defiitio 16. (Power series) Give a sequece {c }, the series c x = c 0 + c 1 x + c 2 x 2 + c 3 x 3 + is called a power series i the variable x. The umbers c are called the coefficiets of

More information

Double Derangement Permutations

Double Derangement Permutations Ope Joural of iscrete Matheatics, 206, 6, 99-04 Published Olie April 206 i SciRes http://wwwscirporg/joural/ojd http://dxdoiorg/04236/ojd2066200 ouble erageet Perutatios Pooya aeshad, Kayar Mirzavaziri

More information

Hoggatt and King [lo] defined a complete sequence of natural numbers

Hoggatt and King [lo] defined a complete sequence of natural numbers REPRESENTATIONS OF N AS A SUM OF DISTINCT ELEMENTS FROM SPECIAL SEQUENCES DAVID A. KLARNER, Uiversity of Alberta, Edmoto, Caada 1. INTRODUCTION Let a, I deote a sequece of atural umbers which satisfies

More information

Sets. Sets. Operations on Sets Laws of Algebra of Sets Cardinal Number of a Finite and Infinite Set. Representation of Sets Power Set Venn Diagram

Sets. Sets. Operations on Sets Laws of Algebra of Sets Cardinal Number of a Finite and Infinite Set. Representation of Sets Power Set Venn Diagram Sets MILESTONE Sets Represetatio of Sets Power Set Ve Diagram Operatios o Sets Laws of lgebra of Sets ardial Number of a Fiite ad Ifiite Set I Mathematical laguage all livig ad o-livig thigs i uiverse

More information

Unit 6: Sequences and Series

Unit 6: Sequences and Series AMHS Hoors Algebra 2 - Uit 6 Uit 6: Sequeces ad Series 26 Sequeces Defiitio: A sequece is a ordered list of umbers ad is formally defied as a fuctio whose domai is the set of positive itegers. It is commo

More information

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.

It is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function. MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied

More information

Problem. Consider the sequence a j for j N defined by the recurrence a j+1 = 2a j + j for j > 0

Problem. Consider the sequence a j for j N defined by the recurrence a j+1 = 2a j + j for j > 0 GENERATING FUNCTIONS Give a ifiite sequece a 0,a,a,, its ordiary geeratig fuctio is A : a Geeratig fuctios are ofte useful for fidig a closed forula for the eleets of a sequece, fidig a recurrece forula,

More information

Course : Algebraic Combinatorics

Course : Algebraic Combinatorics Course 18.312: Algebraic Combiatorics Lecture Notes # 18-19 Addedum by Gregg Musier March 18th - 20th, 2009 The followig material ca be foud i a umber of sources, icludig Sectios 7.3 7.5, 7.7, 7.10 7.11,

More information

Bernoulli Number Identities via Euler-Maclaurin Summation

Bernoulli Number Identities via Euler-Maclaurin Summation = Jacob eroulli 654-75 eroulli Nuber Idetities via Euler-Maclauri Suatio Hieu D. Nguye Math Dept Colloquiu Septeber 4, 8 Sus of Powers 3... 3... () 5,5 ()() 6 333,833,5 3...? ( ) 3... ( ) (Pythagoreas)

More information

1. By using truth tables prove that, for all statements P and Q, the statement

1. By using truth tables prove that, for all statements P and Q, the statement Author: Satiago Salazar Problems I: Mathematical Statemets ad Proofs. By usig truth tables prove that, for all statemets P ad Q, the statemet P Q ad its cotrapositive ot Q (ot P) are equivalet. I example.2.3

More information

PROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1.

PROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1. Math 7 Sprig 06 PROBLEM SET 5 SOLUTIONS Notatios. Give a real umber x, we will defie sequeces (a k ), (x k ), (p k ), (q k ) as i lecture.. (a) (5 pts) Fid the simple cotiued fractio represetatios of 6

More information

Some results on the Apostol-Bernoulli and Apostol-Euler polynomials

Some results on the Apostol-Bernoulli and Apostol-Euler polynomials Soe results o the Apostol-Beroulli ad Apostol-Euler polyoials Weipig Wag a, Cagzhi Jia a Tiaig Wag a, b a Departet of Applied Matheatics, Dalia Uiversity of Techology Dalia 116024, P. R. Chia b Departet

More information

THE GREATEST ORDER OF THE DIVISOR FUNCTION WITH INCREASING DIMENSION

THE GREATEST ORDER OF THE DIVISOR FUNCTION WITH INCREASING DIMENSION MATHEMATICA MONTISNIGRI Vol XXVIII (013) 17-5 THE GREATEST ORDER OF THE DIVISOR FUNCTION WITH INCREASING DIMENSION GLEB V. FEDOROV * * Mechaics ad Matheatics Faculty Moscow State Uiversity Moscow, Russia

More information

MATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006

MATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006 MATH 34 Summer 006 Elemetary Number Theory Solutios to Assigmet Due: Thursday July 7, 006 Departmet of Mathematical ad Statistical Scieces Uiversity of Alberta Questio [p 74 #6] Show that o iteger of the

More information

Complex Numbers Solutions

Complex Numbers Solutions Complex Numbers Solutios Joseph Zoller February 7, 06 Solutios. (009 AIME I Problem ) There is a complex umber with imagiary part 64 ad a positive iteger such that Fid. [Solutio: 697] 4i + + 4i. 4i 4i

More information

Week 5-6: The Binomial Coefficients

Week 5-6: The Binomial Coefficients Wee 5-6: The Biomial Coefficiets March 6, 2018 1 Pascal Formula Theorem 11 (Pascal s Formula For itegers ad such that 1, ( ( ( 1 1 + 1 The umbers ( 2 ( 1 2 ( 2 are triagle umbers, that is, The petago umbers

More information

Sequences, Sums, and Products

Sequences, Sums, and Products CSCE 222 Discrete Structures for Computig Sequeces, Sums, ad Products Dr. Philip C. Ritchey Sequeces A sequece is a fuctio from a subset of the itegers to a set S. A discrete structure used to represet

More information

Real Variables II Homework Set #5

Real Variables II Homework Set #5 Real Variables II Homework Set #5 Name: Due Friday /0 by 4pm (at GOS-4) Istructios: () Attach this page to the frot of your homework assigmet you tur i (or write each problem before your solutio). () Please

More information

Lecture Outline. 2 Separating Hyperplanes. 3 Banach Mazur Distance An Algorithmist s Toolkit October 22, 2009

Lecture Outline. 2 Separating Hyperplanes. 3 Banach Mazur Distance An Algorithmist s Toolkit October 22, 2009 18.409 A Algorithist s Toolkit October, 009 Lecture 1 Lecturer: Joatha Keler Scribes: Alex Levi (009) 1 Outlie Today we ll go over soe of the details fro last class ad ake precise ay details that were

More information

Algebraic Geometry I

Algebraic Geometry I 6.859/15.083 Iteger Programmig ad Combiatorial Optimizatio Fall 2009 Lecture 14: Algebraic Geometry I Today... 0/1-iteger programmig ad systems of polyomial equatios The divisio algorithm for polyomials

More information

Sequences. Notation. Convergence of a Sequence

Sequences. Notation. Convergence of a Sequence Sequeces A sequece is essetially just a list. Defiitio (Sequece of Real Numbers). A sequece of real umbers is a fuctio Z (, ) R for some real umber. Do t let the descriptio of the domai cofuse you; it

More information

Random Models. Tusheng Zhang. February 14, 2013

Random Models. Tusheng Zhang. February 14, 2013 Radom Models Tusheg Zhag February 14, 013 1 Radom Walks Let me describe the model. Radom walks are used to describe the motio of a movig particle (object). Suppose that a particle (object) moves alog the

More information

Al Lehnen Madison Area Technical College 10/5/2014

Al Lehnen Madison Area Technical College 10/5/2014 The Correlatio of Two Rado Variables Page Preliiary: The Cauchy-Schwarz-Buyakovsky Iequality For ay two sequeces of real ubers { a } ad = { b } =, the followig iequality is always true. Furtherore, equality

More information

On Modeling On Minimum Description Length Modeling. M-closed

On Modeling On Minimum Description Length Modeling. M-closed O Modelig O Miiu Descriptio Legth Modelig M M-closed M-ope Do you believe that the data geeratig echais really is i your odel class M? 7 73 Miiu Descriptio Legth Priciple o-m-closed predictive iferece

More information

Generating Functions and Their Applications

Generating Functions and Their Applications Geeratig Fuctios ad Their Applicatios Agustius Peter Sahaggau MIT Matheatics Departet Class of 2007 18.104 Ter Paper Fall 2006 Abstract. Geeratig fuctios have useful applicatios i ay fields of study. I

More information

THE UNIVERSITY OF TORONTO UNDERGRADUATE MATHEMATICS COMPETITION. In Memory of Robert Barrington Leigh. March 9, 2014

THE UNIVERSITY OF TORONTO UNDERGRADUATE MATHEMATICS COMPETITION. In Memory of Robert Barrington Leigh. March 9, 2014 THE UNIVERSITY OF TORONTO UNDERGRADUATE MATHEMATICS COMPETITION I Memory of Robert Barrigto Leigh March 9, 4 Time: 3 hours No aids or calculators permitted. The gradig is desiged to ecourage oly the stroger

More information

ONE MODULO THREE GEOMETRIC MEAN LABELING OF SOME FAMILIES OF GRAPHS

ONE MODULO THREE GEOMETRIC MEAN LABELING OF SOME FAMILIES OF GRAPHS ONE MODULO THREE GEOMETRIC MEAN LABELING OF SOME FAMILIES OF GRAPHS A.Maheswari 1, P.Padiaraj 2 1,2 Departet of Matheatics,Kaaraj College of Egieerig ad Techology, Virudhuagar (Idia) ABSTRACT A graph G

More information

Riemann Hypothesis Proof

Riemann Hypothesis Proof Riea Hypothesis Proof H. Vic Dao 43 rd West Coast Nuber Theory Coferece, Dec 6-0, 009, Asiloar, CA. Revised 0/8/00. Riea Hypothesis Proof H. Vic Dao vic0@cocast.et March, 009 Revised Deceber, 009 Abstract

More information

Teacher s Marking. Guide/Answers

Teacher s Marking. Guide/Answers WOLLONGONG COLLEGE AUSRALIA eacher s Markig A College of the Uiversity of Wollogog Guide/Aswers Diploa i Iforatio echology Fial Exaiatio Autu 008 WUC Discrete Matheatics his exa represets 60% of the total

More information

( a) ( ) 1 ( ) 2 ( ) ( ) 3 3 ( ) =!

( a) ( ) 1 ( ) 2 ( ) ( ) 3 3 ( ) =! .8,.9: Taylor ad Maclauri Series.8. Although we were able to fid power series represetatios for a limited group of fuctios i the previous sectio, it is ot immediately obvious whether ay give fuctio has

More information

Chapter 2. Asymptotic Notation

Chapter 2. Asymptotic Notation Asyptotic Notatio 3 Chapter Asyptotic Notatio Goal : To siplify the aalysis of ruig tie by gettig rid of details which ay be affected by specific ipleetatio ad hardware. [1] The Big Oh (O-Notatio) : It

More information

Ma/CS 6a Class 22: Power Series

Ma/CS 6a Class 22: Power Series Ma/CS 6a Class 22: Power Series By Ada Sheffer Power Series Mooial: ax i. Polyoial: a 0 + a 1 x + a 2 x 2 + + a x. Power series: A x = a 0 + a 1 x + a 2 x 2 + Also called foral power series, because we

More information

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3

(A sequence also can be thought of as the list of function values attained for a function f :ℵ X, where f (n) = x n for n 1.) x 1 x N +k x N +4 x 3 MATH 337 Sequeces Dr. Neal, WKU Let X be a metric space with distace fuctio d. We shall defie the geeral cocept of sequece ad limit i a metric space, the apply the results i particular to some special

More information

Lecture 11. Solution of Nonlinear Equations - III

Lecture 11. Solution of Nonlinear Equations - III Eiciecy o a ethod Lecture Solutio o Noliear Equatios - III The eiciecy ide o a iterative ethod is deied by / E r r: rate o covergece o the ethod : total uber o uctios ad derivative evaluatios at each step

More information

Math 4707 Spring 2018 (Darij Grinberg): midterm 2 page 1. Math 4707 Spring 2018 (Darij Grinberg): midterm 2 with solutions [preliminary version]

Math 4707 Spring 2018 (Darij Grinberg): midterm 2 page 1. Math 4707 Spring 2018 (Darij Grinberg): midterm 2 with solutions [preliminary version] Math 4707 Sprig 08 Darij Griberg: idter page Math 4707 Sprig 08 Darij Griberg: idter with solutios [preliiary versio] Cotets 0.. Coutig first-eve tuples......................... 3 0.. Coutig legal paths

More information

A PROBABILITY PROBLEM

A PROBABILITY PROBLEM A PROBABILITY PROBLEM A big superarket chai has the followig policy: For every Euros you sped per buy, you ear oe poit (suppose, e.g., that = 3; i this case, if you sped 8.45 Euros, you get two poits,

More information

IP Reference guide for integer programming formulations.

IP Reference guide for integer programming formulations. IP Referece guide for iteger programmig formulatios. by James B. Orli for 15.053 ad 15.058 This documet is iteded as a compact (or relatively compact) guide to the formulatio of iteger programs. For more

More information

CERTAIN CONGRUENCES FOR HARMONIC NUMBERS Kotor, Montenegro

CERTAIN CONGRUENCES FOR HARMONIC NUMBERS Kotor, Montenegro MATHEMATICA MONTISNIGRI Vol XXXVIII (017) MATHEMATICS CERTAIN CONGRUENCES FOR HARMONIC NUMBERS ROMEO METROVIĆ 1 AND MIOMIR ANDJIĆ 1 Maritie Faculty Kotor, Uiversity of Moteegro 85330 Kotor, Moteegro e-ail:

More information

ECE Spring Prof. David R. Jackson ECE Dept. Notes 20

ECE Spring Prof. David R. Jackson ECE Dept. Notes 20 ECE 6341 Sprig 016 Prof. David R. Jackso ECE Dept. Notes 0 1 Spherical Wave Fuctios Cosider solvig ψ + k ψ = 0 i spherical coordiates z φ θ r y x Spherical Wave Fuctios (cot.) I spherical coordiates we

More information

Integrals of Functions of Several Variables

Integrals of Functions of Several Variables Itegrals of Fuctios of Several Variables We ofte resort to itegratios i order to deterie the exact value I of soe quatity which we are uable to evaluate by perforig a fiite uber of additio or ultiplicatio

More information

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018

Sequences, Mathematical Induction, and Recursion. CSE 2353 Discrete Computational Structures Spring 2018 CSE 353 Discrete Computatioal Structures Sprig 08 Sequeces, Mathematical Iductio, ad Recursio (Chapter 5, Epp) Note: some course slides adopted from publisher-provided material Overview May mathematical

More information

Chapter 4. Fourier Series

Chapter 4. Fourier Series Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,

More information

Binomial Notations Traditional name Traditional notation Mathematica StandardForm notation Primary definition

Binomial Notations Traditional name Traditional notation Mathematica StandardForm notation Primary definition Bioial Notatios Traditioal ae Bioial coefficiet Traditioal otatio Matheatica StadardFor otatio Bioial, Priary defiitio 06.03.0.0001.01 1 1 1 ; 0 For Ν, Κ egative itegers with, the bioial coefficiet Ν caot

More information

CHAPTER 1 SEQUENCES AND INFINITE SERIES

CHAPTER 1 SEQUENCES AND INFINITE SERIES CHAPTER SEQUENCES AND INFINITE SERIES SEQUENCES AND INFINITE SERIES (0 meetigs) Sequeces ad limit of a sequece Mootoic ad bouded sequece Ifiite series of costat terms Ifiite series of positive terms Alteratig

More information

In number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play.

In number theory we will generally be working with integers, though occasionally fractions and irrationals will come into play. Number Theory Math 5840 otes. Sectio 1: Axioms. I umber theory we will geerally be workig with itegers, though occasioally fractios ad irratioals will come ito play. Notatio: Z deotes the set of all itegers

More information

} is said to be a Cauchy sequence provided the following condition is true.

} is said to be a Cauchy sequence provided the following condition is true. Math 4200, Fial Exam Review I. Itroductio to Proofs 1. Prove the Pythagorea theorem. 2. Show that 43 is a irratioal umber. II. Itroductio to Logic 1. Costruct a truth table for the statemet ( p ad ~ r

More information

Complex Analysis Spring 2001 Homework I Solution

Complex Analysis Spring 2001 Homework I Solution Complex Aalysis Sprig 2001 Homework I Solutio 1. Coway, Chapter 1, sectio 3, problem 3. Describe the set of poits satisfyig the equatio z a z + a = 2c, where c > 0 ad a R. To begi, we see from the triagle

More information

MATH10040 Chapter 4: Sets, Functions and Counting

MATH10040 Chapter 4: Sets, Functions and Counting MATH10040 Chapter 4: Sets, Fuctios ad Coutig 1. The laguage of sets Iforally, a set is ay collectio of objects. The objects ay be atheatical objects such as ubers, fuctios ad eve sets, or letters or sybols

More information

Lecture Notes for Analysis Class

Lecture Notes for Analysis Class Lecture Notes for Aalysis Class Topological Spaces A topology for a set X is a collectio T of subsets of X such that: (a) X ad the empty set are i T (b) Uios of elemets of T are i T (c) Fiite itersectios

More information

GENERALIZATIONS OF ZECKENDORFS THEOREM. TilVIOTHY J. KELLER Student, Harvey Mudd College, Claremont, California

GENERALIZATIONS OF ZECKENDORFS THEOREM. TilVIOTHY J. KELLER Student, Harvey Mudd College, Claremont, California GENERALIZATIONS OF ZECKENDORFS THEOREM TilVIOTHY J. KELLER Studet, Harvey Mudd College, Claremot, Califoria 91711 The Fiboacci umbers F are defied by the recurrece relatio Fi = F 2 = 1, F = F - + F 0 (

More information

ROSE WONG. f(1) f(n) where L the average value of f(n). In this paper, we will examine averages of several different arithmetic functions.

ROSE WONG. f(1) f(n) where L the average value of f(n). In this paper, we will examine averages of several different arithmetic functions. AVERAGE VALUES OF ARITHMETIC FUNCTIONS ROSE WONG Abstract. I this paper, we will preset problems ivolvig average values of arithmetic fuctios. The arithmetic fuctios we discuss are: (1)the umber of represetatios

More information

ECE 901 Lecture 4: Estimation of Lipschitz smooth functions

ECE 901 Lecture 4: Estimation of Lipschitz smooth functions ECE 9 Lecture 4: Estiatio of Lipschitz sooth fuctios R. Nowak 5/7/29 Cosider the followig settig. Let Y f (X) + W, where X is a rado variable (r.v.) o X [, ], W is a r.v. o Y R, idepedet of X ad satisfyig

More information

A talk given at Institut Camille Jordan, Université Claude Bernard Lyon-I. (Jan. 13, 2005), and University of Wisconsin at Madison (April 4, 2006).

A talk given at Institut Camille Jordan, Université Claude Bernard Lyon-I. (Jan. 13, 2005), and University of Wisconsin at Madison (April 4, 2006). A tal give at Istitut Caille Jorda, Uiversité Claude Berard Lyo-I (Ja. 13, 005, ad Uiversity of Wiscosi at Madiso (April 4, 006. SOME CURIOUS RESULTS ON BERNOULLI AND EULER POLYNOMIALS Zhi-Wei Su Departet

More information

A string of not-so-obvious statements about correlation in the data. (This refers to the mechanical calculation of correlation in the data.

A string of not-so-obvious statements about correlation in the data. (This refers to the mechanical calculation of correlation in the data. STAT-UB.003 NOTES for Wedesday 0.MAY.0 We will use the file JulieApartet.tw. We ll give the regressio of Price o SqFt, show residual versus fitted plot, save residuals ad fitted. Give plot of (Resid, Price,

More information

Statistics and Data Analysis in MATLAB Kendrick Kay, February 28, Lecture 4: Model fitting

Statistics and Data Analysis in MATLAB Kendrick Kay, February 28, Lecture 4: Model fitting Statistics ad Data Aalysis i MATLAB Kedrick Kay, kedrick.kay@wustl.edu February 28, 2014 Lecture 4: Model fittig 1. The basics - Suppose that we have a set of data ad suppose that we have selected the

More information

LOWER BOUNDS FOR MOMENTS OF ζ (ρ) 1. Introduction

LOWER BOUNDS FOR MOMENTS OF ζ (ρ) 1. Introduction LOWER BOUNDS FOR MOMENTS OF ζ ρ MICAH B. MILINOVICH AND NATHAN NG Abstract. Assuig the Riea Hypothesis, we establish lower bouds for oets of the derivative of the Riea zeta-fuctio averaged over the otrivial

More information

Exam 2 CMSC 203 Fall 2009 Name SOLUTION KEY Show All Work! 1. (16 points) Circle T if the corresponding statement is True or F if it is False.

Exam 2 CMSC 203 Fall 2009 Name SOLUTION KEY Show All Work! 1. (16 points) Circle T if the corresponding statement is True or F if it is False. 1 (1 poits) Circle T if the correspodig statemet is True or F if it is False T F For ay positive iteger,, GCD(, 1) = 1 T F Every positive iteger is either prime or composite T F If a b mod p, the (a/p)

More information

6.3 Testing Series With Positive Terms

6.3 Testing Series With Positive Terms 6.3. TESTING SERIES WITH POSITIVE TERMS 307 6.3 Testig Series With Positive Terms 6.3. Review of what is kow up to ow I theory, testig a series a i for covergece amouts to fidig the i= sequece of partial

More information

A GENERALIZATION OF THE SYMMETRY BETWEEN COMPLETE AND ELEMENTARY SYMMETRIC FUNCTIONS. Mircea Merca

A GENERALIZATION OF THE SYMMETRY BETWEEN COMPLETE AND ELEMENTARY SYMMETRIC FUNCTIONS. Mircea Merca Idia J Pure Appl Math 45): 75-89 February 204 c Idia Natioal Sciece Academy A GENERALIZATION OF THE SYMMETRY BETWEEN COMPLETE AND ELEMENTARY SYMMETRIC FUNCTIONS Mircea Merca Departmet of Mathematics Uiversity

More information

Multinomial. Notations. Primary definition. Specific values. Traditional name. Traditional notation. Mathematica StandardForm notation

Multinomial. Notations. Primary definition. Specific values. Traditional name. Traditional notation. Mathematica StandardForm notation Multioial Notatios Traditioal ae Multioial coefficiet Traditioal otatio 1 2 ; 1, 2,, Matheatica StadardFor otatio Multioial 1, 2,, Priary defiitio 06.04.02.0001.01 1 2 ; 1, 2,, 06.04.02.0002.01 1 k k 1

More information

19.1 The dictionary problem

19.1 The dictionary problem CS125 Lecture 19 Fall 2016 19.1 The dictioary proble Cosider the followig data structural proble, usually called the dictioary proble. We have a set of ites. Each ite is a (key, value pair. Keys are i

More information

PROPERTIES OF THE POSITIVE INTEGERS

PROPERTIES OF THE POSITIVE INTEGERS PROPERTIES OF THE POSITIVE ITEGERS The first itroductio to mathematics occurs at the pre-school level ad cosists of essetially coutig out the first te itegers with oe s figers. This allows the idividuals

More information

TEACHER CERTIFICATION STUDY GUIDE

TEACHER CERTIFICATION STUDY GUIDE COMPETENCY 1. ALGEBRA SKILL 1.1 1.1a. ALGEBRAIC STRUCTURES Kow why the real ad complex umbers are each a field, ad that particular rigs are ot fields (e.g., itegers, polyomial rigs, matrix rigs) Algebra

More information

s = and t = with C ij = A i B j F. (i) Note that cs = M and so ca i µ(a i ) I E (cs) = = c a i µ(a i ) = ci E (s). (ii) Note that s + t = M and so

s = and t = with C ij = A i B j F. (i) Note that cs = M and so ca i µ(a i ) I E (cs) = = c a i µ(a i ) = ci E (s). (ii) Note that s + t = M and so 3 From the otes we see that the parts of Theorem 4. that cocer us are: Let s ad t be two simple o-egative F-measurable fuctios o X, F, µ ad E, F F. The i I E cs ci E s for all c R, ii I E s + t I E s +

More information

Infinite Sequences and Series

Infinite Sequences and Series Chapter 6 Ifiite Sequeces ad Series 6.1 Ifiite Sequeces 6.1.1 Elemetary Cocepts Simply speakig, a sequece is a ordered list of umbers writte: {a 1, a 2, a 3,...a, a +1,...} where the elemets a i represet

More information

Find a formula for the exponential function whose graph is given , 1 2,16 1, 6

Find a formula for the exponential function whose graph is given , 1 2,16 1, 6 Math 4 Activity (Due by EOC Apr. ) Graph the followig epoetial fuctios by modifyig the graph of f. Fid the rage of each fuctio.. g. g. g 4. g. g 6. g Fid a formula for the epoetial fuctio whose graph is

More information

Different kinds of Mathematical Induction

Different kinds of Mathematical Induction Differet ids of Mathematical Iductio () Mathematical Iductio Give A N, [ A (a A a A)] A N () (First) Priciple of Mathematical Iductio Let P() be a propositio (ope setece), if we put A { : N p() is true}

More information

RADICAL EXPRESSION. If a and x are real numbers and n is a positive integer, then x is an. n th root theorems: Example 1 Simplify

RADICAL EXPRESSION. If a and x are real numbers and n is a positive integer, then x is an. n th root theorems: Example 1 Simplify Example 1 Simplify 1.2A Radical Operatios a) 4 2 b) 16 1 2 c) 16 d) 2 e) 8 1 f) 8 What is the relatioship betwee a, b, c? What is the relatioship betwee d, e, f? If x = a, the x = = th root theorems: RADICAL

More information

Mathematical Description of Discrete-Time Signals. 9/10/16 M. J. Roberts - All Rights Reserved 1

Mathematical Description of Discrete-Time Signals. 9/10/16 M. J. Roberts - All Rights Reserved 1 Mathematical Descriptio of Discrete-Time Sigals 9/10/16 M. J. Roberts - All Rights Reserved 1 Samplig ad Discrete Time Samplig is the acquisitio of the values of a cotiuous-time sigal at discrete poits

More information

Formula List for College Algebra Sullivan 10 th ed. DO NOT WRITE ON THIS COPY.

Formula List for College Algebra Sullivan 10 th ed. DO NOT WRITE ON THIS COPY. Forula List for College Algera Sulliva 10 th ed. DO NOT WRITE ON THIS COPY. Itercepts: Lear how to fid the x ad y itercepts. Syetry: Lear how test for syetry with respect to the x-axis, y-axis ad origi.

More information

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence

A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as

More information

The Boolean Ring of Intervals

The Boolean Ring of Intervals MATH 532 Lebesgue Measure Dr. Neal, WKU We ow shall apply the results obtaied about outer measure to the legth measure o the real lie. Throughout, our space X will be the set of real umbers R. Whe ecessary,

More information

INMO-2018 problems and solutions

INMO-2018 problems and solutions Pioeer Educatio The Best Way To Success INMO-018 proles ad solutios NTSE Olypiad AIPMT JEE - Mais & Advaced 1. Let ABC e a o-equilateral triagle with iteger sides. Let D ad E e respectively the id-poits

More information