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

Size: px
Start display at page:

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

Transcription

1 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 sybol : Z C is give by a a a Note: The Jacobi sybol does ot ecessarily distiguish betwee quadratic residues ad oresidues That is, we could have ( a ) 1 just because two of the factors happe to be 1 For istace, ( 1)( 1) 1, but is ot a square odulo 15 The followig properties of the Jacobi sybol are direct cosequeces of its defiitio Propositio 1 Let, be positive odd itegers ad a, b Z The 1 (i) 1; a (ii) 0 (a, ) > 1; a b (iii) a b (od ) ; ab a b (iv) ; (v) ( a ) ( a ) a ; 1 p 1 p r

2 (vi) (a, ) 1 a b b Proof Exercise Theore Let, be positive odd itegers The 1 (i) ( 1) 1 ; (ii) ( 1) 1 ; (iii) ( 1) 1 1 Proof The first two forulas are trivially true whe 1 ad so is the third if 1 or 1 or if (, ) > 1 We assue that, > 1 ad (, ) 1 Thus p 1 p r ad q 1 q s for soe pries p i ad q j ad p i q j for all 1 i r, 1 j s The p i (1 + (p i 1)) 1 + (p i 1) + (p i1 1)(p i 1)+ 1 i 1 <i r products of 3, 4 ad so o factors Sice is odd, so are the pries p i Therefore p i 1 0 (od ) ad (p i1 1)(p i 1) 0 (od 4) Therefore all the ters i the above su that are iplicit are also divisible by 4 Hece 1 + (p i 1) (od 4), which is to say 1 (p i 1) (od 4) Sice ad the p i s are odd, it follows that 1 0 (od ) ad p (od ), 1 i r Thus we ca divide each ter above by ad still get itegers It follows that so Siilarly, 1 ( 1) 1 ( 1) r p i 1 p i 1 ( 1) p i 1 (od ), (1) 1 p i 1

3 p i ( 1 + (p i 1) ) 1 + (p i 1) + (p i 1 1)(p i 1)+ 1 i 1 <i r products of 3, 4 ad so o factors We use agai the fact that both ad the p i are odd That eas that 1 ( 1)( + 1) is the product of two cosecutive eve itegers, so oe of the is divisible by 4 Thus 1 0 (od ) ad likewise p i 1 0 (od ), 1 i r It follows that the product of two or ore factors i the above suatio is divisible by 64, hece 1 (p i 1) (od 64) Moreover each ter is divisible by, so 1 p i 1 (od ), as itegers It follows that ( 1) 1 ( 1) r p i 1 ( 1) p i 1 p i The last part of the theore, i the case, > 1 ad (, ) 1, is equivalet to ( 1) 1 1 But where t By (1), we have t 1 p i 1 1 ( pi qj q j p i qj 1 ) ( 1) p i 1 q j 1 ( 1) t p i 1 q j 1 (od ) ad the quadratic reciprocity law follows Jacobi sybols have ay applicatios The followig result is a exaple of how they ca be used i the study of certai iophatie equatios 3

4 Propositio 3 The iophatie equatio y x 3 + k has o solutio if k (4 1) 3 4 ad o prie p 3 (od 4) divides Proof We argue by cotradictio Assue that (x, y) is a solutio Sice k 1 (od 4), it follows that y x 3 1 (od 4) But y 0, 1 (od 4), so x caot be eve ad x 1 (od 4) Therefore x 1 (od 4) Let a 4 1 The a 1 (od 4) ad k a 3 4 We have so y x 3 + k x 3 + a 3 4, y + 4 x 3 + a 3 (x + a)(x ax + a ) () Give that x 1 (od 4) ad a 1 (od 4), we have that the last factor x ax + a 3 (od 4) Thus x ax+a is odd ad it ust have soe prie divisor p 3 (od 4) But () iplies that p y + 4, ie 4 y (od p) so 4 1 p O the other had, sice p 3 (od 4), we have that p ad therefore (cotradictio!) p p Propositio 4 If, are positive odd itegers ad is a iteger with 0, 1 (od 4) such that (od ), the Proof First we treat the case whe 1 (od 4) If > 0, the ( 1) 1 1 But 1 is eve, hece The arguet holds for ay positive odd iteger, ad it ca therefore be applied just as well to The result follows iediately sice (od ) 4

5 If < 0, set d The d > 0 ad d 3 (od 4), so d+1 is eve We have d 1 d ( 1) 1 ( 1) 1 d 1 ( 1) 1 d+1 d d Sice the sae holds for, the result follows fro the fact that (od d) Now cosider the other case, 0 (od 4) It follows that a b for soe positive odd iteger b ad a d If > 0, the a b ( 1) 1 a ( 1) 1 b 1 b Siilarly, ( 1) 1 The result would follow if we showed that ad 1 1 b 1 a ( 1) 1 b 1 b a 1 a (od ) (3) 1 b 1 (od ) (4) We have 1 b 1 1 b 1 b 1 ad this is eve sice 4 Thus (4) is proved For the other relatio, we have 1 a 1 a a ( )( + ) a Now + ad a Thus 0 (od 16) whe a 3 ad (3) follows i this case O the other had, if a, the a is agai eve ad we are doe (We used the fact that Z) If < 0, set d The d > 0 ad d 0 (od 4) Fro above it follows that d d We also have d ( 1 )( d ) ( 1) 1 d 5

6 ad, siilarly, The result follows fro the fact that 1 1 (od ) ( 1) 1 d 4 { (od ) 0 (od 4) Theore 5 Let 0, 1 (od 4) be a ozero iteger The there exists a uique group hooorphis χ : (Z/Z) {±1} such that χ ([p]) (the Legedre sybol odulo p) for all odd pries p p Furtherore, χ ([ 1]) { 1 if > 0; 1 if < 0 Proof First we show existece Let χ : (Z/Z) {±1}, χ([a]) where a (od ) is a odd positive iteger We eed to show that this is a well-defied ap, ad for that we eed to prove the followig two facts Clai 1 For ay (a, ) 1 there exists a positive odd iteger a (od ) Clai If, are positive odd itegers ad (od ), the The secod clai is a iediate cosequece of Propositio 4 The first oe, is also easy There exists soe iteger k for which a + k > 0 If is eve, the a has to be odd ad a + k is odd ad positive If is odd, the either a + k or a + k + is both odd ad positive The ap χ is clearly a group hooorphis sice the Jacobi sybol is copletely ultiplicative The coditio o pries is just as clear Now we have to prove uiqueess Assue that f : (Z/Z) {±1} is a group hooorphis with f([p]) for ay odd prie p Clearly f() 1 Also, for p ay odd iteger > 1, we have p 1 p r for soe odd pries p 1,, p r The f([]) f([p 1 ]) f([p r ]) χ([]) p 1 6 p r

7 Sice we have show that every class [a] (Z/Z) cotais a positive odd iteger, it follows that f([a]) χ([a]) for all [a] (Z/Z) The proof for the expressio of χ ([ 1]) is left as a exercise 7

42 Dependence and Bases

42 Dependence and Bases 42 Depedece ad Bases The spa s(a) of a subset A i vector space V is a subspace of V. This spa ay be the whole vector space V (we say the A spas V). I this paragraph we study subsets A of V which spa V

More information

Lecture 10: Bounded Linear Operators and Orthogonality in Hilbert Spaces

Lecture 10: Bounded Linear Operators and Orthogonality in Hilbert Spaces Lecture : Bouded Liear Operators ad Orthogoality i Hilbert Spaces 34 Bouded Liear Operator Let ( X, ), ( Y, ) i i be ored liear vector spaces ad { } X Y The, T is said to be bouded if a real uber c such

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

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

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

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

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

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

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

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

Math 609/597: Cryptography 1

Math 609/597: Cryptography 1 Math 609/597: Cryptography 1 The Solovay-Strasse Primality Test 12 October, 1993 Burt Roseberg Revised: 6 October, 2000 1 Itroductio We describe the Solovay-Strasse primality test. There is quite a bit

More information

SOME FINITE SIMPLE GROUPS OF LIE TYPE C n ( q) ARE UNIQUELY DETERMINED BY THEIR ELEMENT ORDERS AND THEIR ORDER

SOME FINITE SIMPLE GROUPS OF LIE TYPE C n ( q) ARE UNIQUELY DETERMINED BY THEIR ELEMENT ORDERS AND THEIR ORDER Joural of Algebra, Nuber Theory: Advaces ad Applicatios Volue, Nuber, 010, Pages 57-69 SOME FINITE SIMPLE GROUPS OF LIE TYPE C ( q) ARE UNIQUELY DETERMINED BY THEIR ELEMENT ORDERS AND THEIR ORDER School

More information

The Structure of Z p when p is Prime

The Structure of Z p when p is Prime LECTURE 13 The Structure of Z p whe p is Prime Theorem 131 If p > 1 is a iteger, the the followig properties are equivalet (1) p is prime (2) For ay [0] p i Z p, the equatio X = [1] p has a solutio i Z

More information

Primes of the form n 2 + 1

Primes of the form n 2 + 1 Itroductio Ladau s Probles are four robles i Nuber Theory cocerig rie ubers: Goldbach s Cojecture: This cojecture states that every ositive eve iteger greater tha ca be exressed as the su of two (ot ecessarily

More information

6.4 Binomial Coefficients

6.4 Binomial Coefficients 64 Bioial Coefficiets Pascal s Forula Pascal s forula, aed after the seveteeth-cetury Frech atheaticia ad philosopher Blaise Pascal, is oe of the ost faous ad useful i cobiatorics (which is the foral ter

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

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

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial.

It is often useful to approximate complicated functions using simpler ones. We consider the task of approximating a function by a polynomial. Taylor Polyomials ad Taylor Series It is ofte useful to approximate complicated fuctios usig simpler oes We cosider the task of approximatig a fuctio by a polyomial If f is at least -times differetiable

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

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

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

Zeros of Polynomials

Zeros of Polynomials Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree

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

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

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

Math 4400/6400 Homework #7 solutions

Math 4400/6400 Homework #7 solutions MATH 4400 problems. Math 4400/6400 Homewor #7 solutios 1. Let p be a prime umber. Show that the order of 1 + p modulo p 2 is exactly p. Hit: Expad (1 + p) p by the biomial theorem, ad recall from MATH

More information

M17 MAT25-21 HOMEWORK 5 SOLUTIONS

M17 MAT25-21 HOMEWORK 5 SOLUTIONS M17 MAT5-1 HOMEWORK 5 SOLUTIONS 1. To Had I Cauchy Codesatio Test. Exercise 1: Applicatio of the Cauchy Codesatio Test Use the Cauchy Codesatio Test to prove that 1 diverges. Solutio 1. Give the series

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

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

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

Probability Theory. Exercise Sheet 4. ETH Zurich HS 2017

Probability Theory. Exercise Sheet 4. ETH Zurich HS 2017 ETH Zurich HS 2017 D-MATH, D-PHYS Prof. A.-S. Szita Coordiator Yili Wag Probability Theory Exercise Sheet 4 Exercise 4.1 Let X ) N be a sequece of i.i.d. rado variables i a probability space Ω, A, P ).

More information

Seunghee Ye Ma 8: Week 5 Oct 28

Seunghee Ye Ma 8: Week 5 Oct 28 Week 5 Summary I Sectio, we go over the Mea Value Theorem ad its applicatios. I Sectio 2, we will recap what we have covered so far this term. Topics Page Mea Value Theorem. Applicatios of the Mea Value

More information

DIRICHLET CHARACTERS AND PRIMES IN ARITHMETIC PROGRESSIONS

DIRICHLET CHARACTERS AND PRIMES IN ARITHMETIC PROGRESSIONS DIRICHLET CHARACTERS AND PRIMES IN ARITHMETIC PROGRESSIONS We la to rove the followig Theore (Dirichlet s Theore) Let (a, k) = The the arithetic rogressio cotais ifiitely ay ries a + k : = 0,, 2, } = :

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

MATH 304: MIDTERM EXAM SOLUTIONS

MATH 304: MIDTERM EXAM SOLUTIONS MATH 304: MIDTERM EXAM SOLUTIONS [The problems are each worth five poits, except for problem 8, which is worth 8 poits. Thus there are 43 possible poits.] 1. Use the Euclidea algorithm to fid the greatest

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

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

Some remarks on the paper Some elementary inequalities of G. Bennett

Some remarks on the paper Some elementary inequalities of G. Bennett Soe rears o the paper Soe eleetary iequalities of G. Beett Dag Ah Tua ad Luu Quag Bay Vieta Natioal Uiversity - Haoi Uiversity of Sciece Abstract We give soe couterexaples ad soe rears of soe of the corollaries

More information

Queueing Theory II. Summary. M/M/1 Output process Networks of Queue Method of Stages. General Distributions

Queueing Theory II. Summary. M/M/1 Output process Networks of Queue Method of Stages. General Distributions Queueig Theory II Suary M/M/1 Output process Networks of Queue Method of Stages Erlag Distributio Hyperexpoetial Distributio Geeral Distributios Ebedded Markov Chais 1 M/M/1 Output Process Burke s Theore:

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

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

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

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

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

18.S34 (FALL, 2007) GREATEST INTEGER PROBLEMS. n + n + 1 = 4n + 2. 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 + + 1

More information

Math 140A Elementary Analysis Homework Questions 1

Math 140A Elementary Analysis Homework Questions 1 Math 14A Elemetary Aalysis Homewor Questios 1 1 Itroductio 1.1 The Set N of Natural Numbers 1 Prove that 1 2 2 2 2 1 ( 1(2 1 for all atural umbers. 2 Prove that 3 11 (8 5 4 2 for all N. 4 (a Guess a formula

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

Complete Solutions to Supplementary Exercises on Infinite Series

Complete Solutions to Supplementary Exercises on Infinite Series Coplete Solutios to Suppleetary Eercises o Ifiite Series. (a) We eed to fid the su ito partial fractios gives By the cover up rule we have Therefore Let S S A / ad A B B. Covertig the suad / the by usig

More information

THE ARTIN CARMICHAEL PRIMITIVE ROOT PROBLEM ON AVERAGE

THE ARTIN CARMICHAEL PRIMITIVE ROOT PROBLEM ON AVERAGE THE ARTIN CARMICHAEL PRIMITIVE ROOT PROBLEM ON AVERAGE SHUGUANG LI AND CARL POMERANCE Abstract. For a atural uber, let λ() deote the order of the largest cyclic subgroup of (Z/Z). For a give iteger a,

More information

SEQUENCE AND SERIES NCERT

SEQUENCE AND SERIES NCERT 9. Overview By a sequece, we mea a arragemet of umbers i a defiite order accordig to some rule. We deote the terms of a sequece by a, a,..., etc., the subscript deotes the positio of the term. I view of

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

Polynomial Functions and Their Graphs

Polynomial Functions and Their Graphs Polyomial Fuctios ad Their Graphs I this sectio we begi the study of fuctios defied by polyomial expressios. Polyomial ad ratioal fuctios are the most commo fuctios used to model data, ad are used extesively

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

MATH 205 HOMEWORK #2 OFFICIAL SOLUTION. (f + g)(x) = f(x) + g(x) = f( x) g( x) = (f + g)( x)

MATH 205 HOMEWORK #2 OFFICIAL SOLUTION. (f + g)(x) = f(x) + g(x) = f( x) g( x) = (f + g)( x) MATH 205 HOMEWORK #2 OFFICIAL SOLUTION Problem 2: Do problems 7-9 o page 40 of Hoffma & Kuze. (7) We will prove this by cotradictio. Suppose that W 1 is ot cotaied i W 2 ad W 2 is ot cotaied i W 1. The

More information

b i u x i U a i j u x i u x j

b i u x i U a i j u x i u x j M ath 5 2 7 Fall 2 0 0 9 L ecture 1 9 N ov. 1 6, 2 0 0 9 ) S ecod- Order Elliptic Equatios: Weak S olutios 1. Defiitios. I this ad the followig two lectures we will study the boudary value problem Here

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

Bertrand s Postulate

Bertrand s Postulate Bertrad s Postulate Lola Thompso Ross Program July 3, 2009 Lola Thompso (Ross Program Bertrad s Postulate July 3, 2009 1 / 33 Bertrad s Postulate I ve said it oce ad I ll say it agai: There s always a

More information

Math 4107: Abstract Algebra I Fall Webwork Assignment1-Groups (5 parts/problems) Solutions are on Webwork.

Math 4107: Abstract Algebra I Fall Webwork Assignment1-Groups (5 parts/problems) Solutions are on Webwork. Math 4107: Abstract Algebra I Fall 2017 Assigmet 1 Solutios 1. Webwork Assigmet1-Groups 5 parts/problems) Solutios are o Webwork. 2. Webwork Assigmet1-Subgroups 5 parts/problems) Solutios are o Webwork.

More information

REVIEW OF CALCULUS Herman J. Bierens Pennsylvania State University (January 28, 2004) x 2., or x 1. x j. ' ' n i'1 x i well.,y 2

REVIEW OF CALCULUS Herman J. Bierens Pennsylvania State University (January 28, 2004) x 2., or x 1. x j. ' ' n i'1 x i well.,y 2 REVIEW OF CALCULUS Hera J. Bieres Pesylvaia State Uiversity (Jauary 28, 2004) 1. Suatio Let x 1,x 2,...,x e a sequece of uers. The su of these uers is usually deoted y x 1 % x 2 %...% x ' j x j, or x 1

More information

BOUNDS ON SOME VAN DER WAERDEN NUMBERS. Tom Brown Department of Mathematics, Simon Fraser University, Burnaby, BC V5A 1S6

BOUNDS ON SOME VAN DER WAERDEN NUMBERS. Tom Brown Department of Mathematics, Simon Fraser University, Burnaby, BC V5A 1S6 BOUNDS ON SOME VAN DER WAERDEN NUMBERS To Brow Departet of Matheatics, Sio Fraser Uiversity, Buraby, BC V5A S6 Bruce M Lada Departet of Matheatics, Uiversity of West Georgia, Carrollto, GA 308 Aaro Robertso

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

ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS

ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS ON THE LEHMER CONSTANT OF FINITE CYCLIC GROUPS NORBERT KAIBLINGER Abstract. Results of Lid o Lehmer s problem iclude the value of the Lehmer costat of the fiite cyclic group Z/Z, for 5 ad all odd. By complemetary

More information

Chapter 2. Periodic points of toral. automorphisms. 2.1 General introduction

Chapter 2. Periodic points of toral. automorphisms. 2.1 General introduction Chapter 2 Periodic poits of toral automorphisms 2.1 Geeral itroductio The automorphisms of the two-dimesioal torus are rich mathematical objects possessig iterestig geometric, algebraic, topological ad

More information

(s)h(s) = K( s + 8 ) = 5 and one finite zero is located at z 1

(s)h(s) = K( s + 8 ) = 5 and one finite zero is located at z 1 ROOT LOCUS TECHNIQUE 93 should be desiged differetly to eet differet specificatios depedig o its area of applicatio. We have observed i Sectio 6.4 of Chapter 6, how the variatio of a sigle paraeter like

More information

On The Prime Numbers In Intervals

On The Prime Numbers In Intervals O The Prie Nubers I Itervals arxiv:1706.01009v1 [ath.nt] 4 Ju 2017 Kyle D. Balliet A Thesis Preseted to the Faculty of the Departet of Matheatics West Chester Uiversity West Chester, Pesylvaia I Partial

More information

Convergence of random variables. (telegram style notes) P.J.C. Spreij

Convergence of random variables. (telegram style notes) P.J.C. Spreij Covergece of radom variables (telegram style otes).j.c. Spreij this versio: September 6, 2005 Itroductio As we kow, radom variables are by defiitio measurable fuctios o some uderlyig measurable space

More information

Homework 1 Solutions. The exercises are from Foundations of Mathematical Analysis by Richard Johnsonbaugh and W.E. Pfaffenberger.

Homework 1 Solutions. The exercises are from Foundations of Mathematical Analysis by Richard Johnsonbaugh and W.E. Pfaffenberger. Homewor 1 Solutios Math 171, Sprig 2010 Hery Adams The exercises are from Foudatios of Mathematical Aalysis by Richard Johsobaugh ad W.E. Pfaffeberger. 2.2. Let h : X Y, g : Y Z, ad f : Z W. Prove that

More information

Math 7409 Homework 2 Fall from which we can calculate the cycle index of the action of S 5 on pairs of vertices as

Math 7409 Homework 2 Fall from which we can calculate the cycle index of the action of S 5 on pairs of vertices as Math 7409 Hoewok 2 Fall 2010 1. Eueate the equivalece classes of siple gaphs o 5 vetices by usig the patte ivetoy as a guide. The cycle idex of S 5 actig o 5 vetices is 1 x 5 120 1 10 x 3 1 x 2 15 x 1

More information

1.2 AXIOMATIC APPROACH TO PROBABILITY AND PROPERTIES OF PROBABILITY MEASURE 1.2 AXIOMATIC APPROACH TO PROBABILITY AND

1.2 AXIOMATIC APPROACH TO PROBABILITY AND PROPERTIES OF PROBABILITY MEASURE 1.2 AXIOMATIC APPROACH TO PROBABILITY AND NTEL- robability ad Distributios MODULE 1 ROBABILITY LECTURE 2 Topics 1.2 AXIOMATIC AROACH TO ROBABILITY AND ROERTIES OF ROBABILITY MEASURE 1.2.1 Iclusio-Exclusio Forula I the followig sectio we will discuss

More information

Iterative Techniques for Solving Ax b -(3.8). Assume that the system has a unique solution. Let x be the solution. Then x A 1 b.

Iterative Techniques for Solving Ax b -(3.8). Assume that the system has a unique solution. Let x be the solution. Then x A 1 b. Iterative Techiques for Solvig Ax b -(8) Cosider solvig liear systems of them form: Ax b where A a ij, x x i, b b i Assume that the system has a uique solutio Let x be the solutio The x A b Jacobi ad Gauss-Seidel

More information

Fourier Analysis, Stein and Shakarchi Chapter 8 Dirichlet s Theorem

Fourier Analysis, Stein and Shakarchi Chapter 8 Dirichlet s Theorem Fourier Aalysis, Stei ad Shakarchi Chapter 8 Dirichlet s Theorem 208.05.05 Abstract Durig the course Aalysis II i NTU 208 Sprig, this solutio file is latexed by the teachig assistat Yug-Hsiag Huag with

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

5.6 Absolute Convergence and The Ratio and Root Tests

5.6 Absolute Convergence and The Ratio and Root Tests 5.6 Absolute Covergece ad The Ratio ad Root Tests Bria E. Veitch 5.6 Absolute Covergece ad The Ratio ad Root Tests Recall from our previous sectio that diverged but ( ) coverged. Both of these sequeces

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

sin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n =

sin(n) + 2 cos(2n) n 3/2 3 sin(n) 2cos(2n) n 3/2 a n = 60. Ratio ad root tests 60.1. Absolutely coverget series. Defiitio 13. (Absolute covergece) A series a is called absolutely coverget if the series of absolute values a is coverget. The absolute covergece

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

subcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016

subcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016 subcaptiofot+=small,labelformat=pares,labelsep=space,skip=6pt,list=0,hypcap=0 subcaptio ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, /6/06. Self-cojugate Partitios Recall that, give a partitio λ, we may

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

Matrix Algebra 2.3 CHARACTERIZATIONS OF INVERTIBLE MATRICES Pearson Education, Inc.

Matrix Algebra 2.3 CHARACTERIZATIONS OF INVERTIBLE MATRICES Pearson Education, Inc. 2 Matrix Algebra 2.3 CHARACTERIZATIONS OF INVERTIBLE MATRICES 2012 Pearso Educatio, Ic. Theorem 8: Let A be a square matrix. The the followig statemets are equivalet. That is, for a give A, the statemets

More information

GENERALIZED LEGENDRE POLYNOMIALS AND RELATED SUPERCONGRUENCES

GENERALIZED LEGENDRE POLYNOMIALS AND RELATED SUPERCONGRUENCES J. Nuber Theory 0, o., 9-9. GENERALIZED LEGENDRE POLYNOMIALS AND RELATED SUPERCONGRUENCES Zhi-Hog Su School of Matheatical Scieces, Huaiyi Noral Uiversity, Huaia, Jiagsu 00, PR Chia Eail: zhihogsu@yahoo.co

More information

International Baccalaureate LECTURE NOTES MATHEMATICS HL FURTHER MATHEMATICS HL Christos Nikolaidis TOPIC NUMBER THEORY

International Baccalaureate LECTURE NOTES MATHEMATICS HL FURTHER MATHEMATICS HL Christos Nikolaidis TOPIC NUMBER THEORY Iteratioal Baccalaureate LECTURE NOTES MATHEMATICS HL FURTHER MATHEMATICS HL TOPIC NUMBER THEORY METHODS OF PROOF. Couterexample - Cotradictio - Pigeohole Priciple Strog mathematical iductio 2 DIVISIBILITY....

More information

Orthogonal Functions

Orthogonal Functions Royal Holloway Uiversity of odo Departet of Physics Orthogoal Fuctios Motivatio Aalogy with vectors You are probably failiar with the cocept of orthogoality fro vectors; two vectors are orthogoal whe they

More information

Chapter IV Integration Theory

Chapter IV Integration Theory Chapter IV Itegratio Theory Lectures 32-33 1. Costructio of the itegral I this sectio we costruct the abstract itegral. As a matter of termiology, we defie a measure space as beig a triple (, A, µ), where

More information

Homework 3. = k 1. Let S be a set of n elements, and let a, b, c be distinct elements of S. The number of k-subsets of S is

Homework 3. = k 1. Let S be a set of n elements, and let a, b, c be distinct elements of S. The number of k-subsets of S is Homewor 3 Chapter 5 pp53: 3 40 45 Chapter 6 p85: 4 6 4 30 Use combiatorial reasoig to prove the idetity 3 3 Proof Let S be a set of elemets ad let a b c be distict elemets of S The umber of -subsets of

More information

JORGE LUIS AROCHA AND BERNARDO LLANO. Average atchig polyoial Cosider a siple graph G =(V E): Let M E a atchig of the graph G: If M is a atchig, the a

JORGE LUIS AROCHA AND BERNARDO LLANO. Average atchig polyoial Cosider a siple graph G =(V E): Let M E a atchig of the graph G: If M is a atchig, the a MEAN VALUE FOR THE MATCHING AND DOMINATING POLYNOMIAL JORGE LUIS AROCHA AND BERNARDO LLANO Abstract. The ea value of the atchig polyoial is coputed i the faily of all labeled graphs with vertices. We dee

More information

(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m?

(b) What is the probability that a particle reaches the upper boundary n before the lower boundary m? MATH 529 The Boudary Problem The drukard s walk (or boudary problem) is oe of the most famous problems i the theory of radom walks. Oe versio of the problem is described as follows: Suppose a particle

More information

DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS

DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS DIVISIBILITY PROPERTIES OF GENERALIZED FIBONACCI POLYNOMIALS VERNER E. HOGGATT, JR. Sa Jose State Uiversity, Sa Jose, Califoria 95192 ad CALVIN T. LONG Washigto State Uiversity, Pullma, Washigto 99163

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

NICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =

NICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) = AN INTRODUCTION TO SCHRÖDER AND UNKNOWN NUMBERS NICK DUFRESNE Abstract. I this article we will itroduce two types of lattice paths, Schröder paths ad Ukow paths. We will examie differet properties of each,

More information

1. ARITHMETIC OPERATIONS IN OBSERVER'S MATHEMATICS

1. ARITHMETIC OPERATIONS IN OBSERVER'S MATHEMATICS 1. ARITHMETIC OPERATIONS IN OBSERVER'S MATHEMATICS We cosider a ite well-ordered system of observers, where each observer sees the real umbers as the set of all iite decimal fractios. The observers are

More information

Inverse Matrix. A meaning that matrix B is an inverse of matrix A.

Inverse Matrix. A meaning that matrix B is an inverse of matrix A. Iverse Matrix Two square matrices A ad B of dimesios are called iverses to oe aother if the followig holds, AB BA I (11) The otio is dual but we ofte write 1 B A meaig that matrix B is a iverse of matrix

More information

[ 11 ] z of degree 2 as both degree 2 each. The degree of a polynomial in n variables is the maximum of the degrees of its terms.

[ 11 ] z of degree 2 as both degree 2 each. The degree of a polynomial in n variables is the maximum of the degrees of its terms. [ 11 ] 1 1.1 Polyomial Fuctios 1 Algebra Ay fuctio f ( x) ax a1x... a1x a0 is a polyomial fuctio if ai ( i 0,1,,,..., ) is a costat which belogs to the set of real umbers ad the idices,, 1,...,1 are atural

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

arxiv: v1 [math.co] 3 Feb 2013

arxiv: v1 [math.co] 3 Feb 2013 Cotiued Fractios of Quadratic Numbers L ubomíra Balková Araka Hrušková arxiv:0.05v [math.co] Feb 0 February 5 0 Abstract I this paper we will first summarize kow results cocerig cotiued fractios. The we

More information

Brief Review of Functions of Several Variables

Brief Review of Functions of Several Variables Brief Review of Fuctios of Several Variables Differetiatio Differetiatio Recall, a fuctio f : R R is differetiable at x R if ( ) ( ) lim f x f x 0 exists df ( x) Whe this limit exists we call it or f(

More information

Cardinality Homework Solutions

Cardinality Homework Solutions Cardiality Homework Solutios April 16, 014 Problem 1. I the followig problems, fid a bijectio from A to B (you eed ot prove that the fuctio you list is a bijectio): (a) A = ( 3, 3), B = (7, 1). (b) A =

More information

GROUPOID CARDINALITY AND EGYPTIAN FRACTIONS

GROUPOID CARDINALITY AND EGYPTIAN FRACTIONS GROUPOID CARDINALITY AND EGYPTIAN FRACTIONS JULIA E. BERGNER AND CHRISTOPHER D. WALKER Abstract. I this paper we show that two very ew questios about the cardiality of groupoids reduce to very old questios

More information

SOLVED EXAMPLES

SOLVED EXAMPLES Prelimiaries Chapter PELIMINAIES Cocept of Divisibility: A o-zero iteger t is said to be a divisor of a iteger s if there is a iteger u such that s tu I this case we write t s (i) 6 as ca be writte as

More information

d) If the sequence of partial sums converges to a limit L, we say that the series converges and its

d) If the sequence of partial sums converges to a limit L, we say that the series converges and its Ifiite Series. Defiitios & covergece Defiitio... Let {a } be a sequece of real umbers. a) A expressio of the form a + a +... + a +... is called a ifiite series. b) The umber a is called as the th term

More information

Bertrand s Postulate. Theorem (Bertrand s Postulate): For every positive integer n, there is a prime p satisfying n < p 2n.

Bertrand s Postulate. Theorem (Bertrand s Postulate): For every positive integer n, there is a prime p satisfying n < p 2n. Bertrad s Postulate Our goal is to prove the followig Theorem Bertrad s Postulate: For every positive iteger, there is a prime p satisfyig < p We remark that Bertrad s Postulate is true by ispectio for,,

More information