Dirichlet s Theorem In Arithmetic Progressions
|
|
- Elaine Wilkerson
- 6 years ago
- Views:
Transcription
1 Drchlet s Theorem In Arthmetc Progressons Parsa Kavkan Hang Wang The Unversty of Adelade February 26, 205
2 Abstract The am of ths paper s to ntroduce and prove Drchlet s theorem n arthmetc progressons, one of the nterestng topcs n number theory. The proof uses complex analyss and s a mlestone for analytc number theory. The theorem was conjectured by Legendre and proved by Drchlet 837. Introducton Drchlet s theorem n arthmetc progressons states that f a and m are postve ntegers wth no common factor except, there are nfntely many prme numbers congruent to a modulo m. That s the seres a, a + m, a + 2m,... contans nfnty many prme numbers. An mmedate observaton of ths theorem by settng a m s Eucld s theorem, that s, there are nfntely many prme numbers. There are several other nterestng problems about prme numbers, one of them beng Landau s fourth problem whch conjectures that there are nfntely many prme numbers of the form n 2 +, where n N. We begn the paper wth some mportant propertes of Drchlet seres, then we defne characters and Drchlet L-functons whch are the man tools used n the proof. Fnally we reformulate the theorem n terms of denstes to reach a deeper result. The general method used n ths paper s based on works of Drchlet, whch can be found n [2]. However, the explanaton of varous concepts and proof of theorems are done by us. Fnally, we would lke to thank Australan Mathematcal Scences Insttute for fundng and makng ths experence possble for us. 2 Drchlet Seres Defnton. Let s be a complex number, {a n } n a sequence of complex numbers and {λ n } n be an ncreasng sequence of real numbers approachng nfnty. Then the general Drchlet seres s defned as n a ne λns. The ordnary Drchlet seres n a nn s s the case where λ n ln n. Theorem 2 Morera s theorem. Let the functon f be contnuous n a smply connected open set U. If C fzdz 0 for all smple closed contours C lyng n U then f s holomorphc on U. Proof. Choose an arbtrary pont z 0 n U and defne functon F : U C by F z z z 0 fτdτ. Note that F s well defned snce ntegral of f over any closed contour s 0 by assumpton and hence the ntegral n F s ndependent of paths from z 0 to z. Now choose z and z n U and let h z z. We have z F z F z z z z 0 fτdτ z z 0 fτdτ z fτdτ h h 2 z
3 and Hence fz h fzh z h fz dτ h F z F z z z z fz h z z z z fzdτ. fτ fzdτ. Snce f s contnuous at z, for any ɛ > 0 there exsts a δ > 0 such that fτ fz < ɛ whenever h < δ. So we have F z F z z z fz z fτ fzdτ h h z z z fτ fz dτ ɛ h z z ɛ. Therefore F s dfferentable wth dervatve f. Snce z was an arbtrary pont n U, thus F s holomorphc and nfnte dfferentable. In partcular F f s holomorphc on U. Theorem 3. Let {f } be a sequence of holomorphc functons defned on an open set U convergng to f : U C unformly. Then f s holomorphc on U. Proof. Let C be a closed contour n U. As f s holomorphc for any, by Cauchy s ntegral theorem we have f zdz 0. By the unform convergence we have fzdz C C C lm f zdz lm f zdz 0. C As C was an arbtrary closed contour n U, hence by Morera s theorem f s holomorphc on U. Lemma 4. Let {a n } and {b n } be two sequences and defne S m,p p a n. Then q a n b n S m,q b q + q S m,n b n b n+. Proof. q q a n b n a m b m + a n b n + q a m b m + S m,n S m,n b n + q q a m b m + S m,n b n S m,n b n + + 3
4 a m b m + S m,m b m + S m,q b q + S m,q b q + q + q + q + S m,n b n q S m,n b n+ S m,n b n b n+ S m,m b m+ S m,n b n b n+ + S m,m b m b m+ S m,q b q + q S m,n b n b n+ Lemma 5. Let a, b, x and y be real numbers wth 0 < a < b and x > 0. If z x + y, then we have e az e bz z e ax e bx. x Proof. We have So z b a e az e bz z e az e bz e zτ dτ z b a z a b a b e zτ dτ z b e zτ dτ z a b a e zτ dτ e zτ dτ e xτ dτ z x e bx e ax z e ax e bx. x Theorem 6. Suppose a general Drchlet seres fs n a ne λns converges for some s 0. Then t converges unformly for any s such that Rs > Rs 0 and args s 0 < α for some α < π 2. Proof. Wthout loss of generalty we can assume s 0 0. Otherwse we apply the transformaton a n a n e λns0 and s s s 0. Then a ne λns a n e λns n converges for s 0. We want to show that fs converges for every s such that Rs > 0 and s args < α. The latter condton s equvalent to sayng M R such that Rs M. Here M cos α. Now by assumng that fs converges for s 0 we know n a n converges. So for any gven ɛ > 0, there exsts an nteger N 0 such that for any m, p N 0 we have S m,p p a n < ɛ. Settng b n e λns n Lemma 4 we have q a n e λns S m,q e λqs + 4 n q S m,n e λns e λn+s.
5 So q a n e λns S m,q e λqs + ɛ + ɛ q q e λ ns e λn+s. S m,n e λns e λn+s Usng Lemma 5 we have e λ ns e λn+s s Rs e λnrs e λn+rs M e λnrs e λn+rs Therefore q a n e λns ɛ + ɛm q fnally snce Rs > 0 we reach e λnrs e λn+rs ɛ + M e λmrs e λqrs. q a n e λns ɛ + M. Hence the unform convergence s shown. Corollary 7. If fs n a ne λns converges for some s 0 C then for any s C such that Rs Rs 0 we have. f converges unformly at s, 2. f s holomorphc at s. Proof. follows from Theorem 6 by choosng α suffcent close to π 2 from below. To prove 2 we defne f s n a ne λns. Clearly f s holomorphc for every and {f } converges to f unformly. Thus by Theorem 3, f s holomorphc at s. Lemma 8. Consder an ordnary Drchlet seres fs n a nn s where {a n } s bounded. Then f converges absolutely for every s C wth Rs >. Proof. There exsts M R such that a n < M for every n. So fs a n n s a n n s M n s M n Rs, n whch clearly converges f Rs >. n Defnton 9. A functon f : N C s sad to be multplcatve where for relatvely prme m, n N we have fmn fmfn. If ths s true for every m, n N then f s sad to be completely multplcatve. n n 5
6 Note: f f 2 f 2 hence f equals 0 or. If f 0 then f s dentcally zero so we requre f to avod the trval case. Theorem 0. Let f : N C be a bounded multplcatve functon and let p, p 2,... be the sequence of prme numbers n ncreasng order. Then fn fp α n s fp α fp α 2 p αs α0 p αs α0 p αs α0 2 n for every s wth Rs >. Proof. Lemma 8 mples that the left sde sum converges absolutely. Let n be a natural number. By the fundamental theorem of arthmetc we know there are unque non-negatve ntegers α, α 2,... only a fnte number of them beng nonzero, such that n pα and so fn fpα. By choosng α α n the th term n the left-hand sde of for, 2, 3,... we produce the term fp α p αs f pα fn pαs n s And we produce each term n the left hand sde of only once by the unqueness of prme factorsaton. Hence there s a bjecton between the nfnte sum and products n. Corollary. If f s bounded by and s completely multplcatve, then for every s C such that Rs > we have fn n s. n fp p s Proof. By Theorem 0 we have n fn n s α0 fp α p αs. Now that f s completely multplcatve we have fp α fp α. Hence fn α fp n s p s n α0 fp p s provded that < for all N. fp p s Defnton 2. Remann zeta functon s defned to be the ordnary Drchlet seres wth a n for all n N, that s, ζs n s, where Rs >. n, 6
7 Usng Corollary we can express Remann zeta functon as an nfnte product where Rs >. Theorem 3. For every s wth Rs >. ζ s holomorphc at s, 2. ζs 0. ζs p s Proof. Suppose Rs > and let r +Rs 2. Snce r >, by Lemma 8, ζr converges. Now by the second part of Corollary 7 and the fact that Rs > Rr r we can conclude that f s holpmorphc at s. To show the second part we note the followng fact: ζs 0 log ζs converges. But log ζs log log p log p s. s p s So t suffces to show that log p converges. Consder the sequence s { } a + log a, where a p. By usng L Hoptal s rule, the lmt of ths sequence as n s s a + log a lm n a 2 lm n a 2 a 2a lm n 2 a 2. Now snce a2 converges, so does a + log a and fnally snce a converges, so does log a log p. s Defnton 4. We defne φs n+ n n s τ s dτ for all s C such that Rs > 0. n Lemma 5. For every s C such that Rs > Proof. If Rs >, then φs + s n n+ n ζs φs + s. n s τ s dτ + τ s dτ n s ζs. n 7
8 From now on we use φs + s Lemma 6. φ s holomorphc on the half-plane Rs > 0. as the defnton of ζ wth the extended doman Rs > 0. Proof. f Rs > 0. sup n τ [n,n+] φs n n+ n n s τ s n s τ s dτ n s n + s n Theorem 7. As s we have Proof. As s log p s n log log ζs log s By the Taylor seres of log about x 0 we have So by applyng settng x p s log s we have j log jp js s. p s x j x j j p s + log. p s jp js. j2 But j2 jp js j p s j2 p s p s p s ps p p. 2 2 Hence as s. p s n log s Corollary 8. There are nfntely many prme numbers. 8
9 3 Characters Let G be a fnte abelan group. Defnton 9. s sad to be a character of G f : G C s a homomorphsm, where C s the group of non zero complex numbers under multplcaton. Denote the set of characters of G by Ĝ. Theorem 20. If n G and Ĝ then we have { n f g 0 f g G Proof. If then g G g g G G. If, ḡ G such that ḡ. Hence we have ḡ g ḡg g. g G g G g G Snce ḡ we can conclude that g G g 0. Corollary 2. For a fnte abelan group G where g G we have { Ĝ f g g 0 f g Ĝ Proof. Ths corollary follows from applyng Theorem 20 to group Ĝ. Let Gm Z/mZ be the set of all ntegers m nvertble modulo m. Defnton 22. s sad to be a character modulo m f : Gm C s a homomorphsm. To extend the doman of a character to all ntegers m we defne g 0 for any g not relatvely prme to m. 4 Drchlet L-functon Defnton 23. Let s be a complex number and be a character modulo m. Then s sad to be a Drchlet L-functon. Ls, n n n s Snce a character s completely multplcatve, by Corollary we have Ls,. p p s 9
10 Example. By settng we have Ls, n coprme to m p s ζs Hence Ls, has a smple pole at s. p m n s p m p m p s p s. p s Lemma 24.. If, then Ls, s bounded on a bounded open neghbourhood of n the half-plane Rs > 0. Proof. Snce, by usng Theorem 20 we have L, < n < φm. n Hence L, s bounded. From Theorem 20 we know f, n nn s converges for s 0. So by the second part of Corollary 7, Ls, s holomorphc on the half-plane Rs > 0. Therefore Ls, remans bounded on a bounded open neghbourhood of n the half-plane Rs > 0. Lemma 25.. If, then L, 0. Proof. The product of L-functons over all the characters modulo m dverges when s φm, where φ s Euler s totent functon [2] page 73. Snce Ls, has a smple pole at s and L, s bounded whenever, we reach the concluson that L, 0 f. Corollary 26. If 0, then log Ls, s bounded on a bounded open neghbourhood of n the half-plane Rs > 0. Proof. Ths s clear from Lemmas 24 and 25. Defnton 27. Let be a character mod m and s be a complex number such that Rs > 0. We defne fs, p p s p m Lemma 28. As s we have fs, log s. 0
11 Proof. Let. Then we have p for every N. By usng Theorem 7 we know that p p s log But fs, dffers from p p s by the fnte sum pp s. p m s. Lemma 29. If then fs, remans bounded as s. Proof. If Rs > log Ls, log The Taylor expanson of log x p p s log p p s about x 0, provded that x < s j x j j x + x2 2 + x By settng x p p s we have x p s <. So log Ls, j j j p p s p p s 2 + j2 j 2 j p 2 But j p j p s j2 j p p s j2 p p p s p s p 2 p s ps p p p. Snce both log Ls, and j2 j subsequently fs,. p p s j are bounded n 2 hence so s p p s Defnton 30. Let a and m be postve ntegers. We defne Q a,m to be the set of prme numbers that are congruent to a modulo m. Theorem 3. Suppose a and m are relatvely prme. Then φm p s p Q a,m fs, a p s and
12 Proof. p m fs, a a p m p p s a p p s a p p s a p p s p m But by Corollary 2 we have a p { φm p m p s p m a p f p a mod m 0 otherwse So fs, a p a mod m p m p s p s a p φm φm p Q a,m p s. Theorem 32 Drchlet s Theorem. If a and m are relatvely prme ntegers, there are nfntely many prme numbers congruent to a modulo m. Proof. From Theorem 3 we have p s φm p Q a,m fs, a. Lemmas 28 and 29 state that as s, fs, s asymptotc to log bounded. Therefore as s p s φm log s. p Q a,m Hence dverges whch shows that Q a,m s nfnte. p Q a,m p s f but otherwse s 2
13 5 Densty Defnton 33. Suppose P s an nfnte set and let Q P. The densty of Q n P s defned to be lm s q Q q s p P p s. Theorem 34. Let P be the set of prme numbers and Q a,m as n Defnton 30. The densty of Q a,m n P s φm for every a. Proof. By usng the results from Theorems 7 and 3, the densty of Q a,m n prme numbers s lm s q Q a,m q s p P p s lm s φm log s log s φm. By settng a and m 0 for nstance, Theorem 34 mples that one quarter of prme numbers end wth a one n the decmal representaton. References [] Tom M. Apostol, Introducton to Analytc Number Theory, Undergraduate Texts n Mathematcs, 976 [2] Jean-Perre Serre, A course n Arthmetc, Graduate Texts n Mathematcs, 973 [3] Dnakar Ramakrshnan, Fourer Analyss on Number Felds, Graduate Texts n Mathematcs, 998 3
Foundations of Arithmetic
Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an
More informationMULTIPLICATIVE FUNCTIONS: A REWRITE OF ANDREWS CHAPTER 6
MULTIPLICATIVE FUNCTIONS: A REWRITE OF ANDREWS CHAPTER 6 In these notes we offer a rewrte of Andrews Chapter 6. Our am s to replace some of the messer arguments n Andrews. To acheve ths, we need to change
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationBernoulli Numbers and Polynomials
Bernoull Numbers and Polynomals T. Muthukumar tmk@tk.ac.n 17 Jun 2014 The sum of frst n natural numbers 1, 2, 3,..., n s n n(n + 1 S 1 (n := m = = n2 2 2 + n 2. Ths formula can be derved by notng that
More informationFACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP
C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More informationRestricted divisor sums
ACTA ARITHMETICA 02 2002) Restrcted dvsor sums by Kevn A Broughan Hamlton) Introducton There s a body of work n the lterature on varous restrcted sums of the number of dvsors of an nteger functon ncludng
More informationChowla s Problem on the Non-Vanishing of Certain Infinite Series and Related Questions
Proc. Int. Conf. Number Theory and Dscrete Geometry No. 4, 2007, pp. 7 79. Chowla s Problem on the Non-Vanshng of Certan Infnte Seres and Related Questons N. Saradha School of Mathematcs, Tata Insttute
More informationTHERE ARE INFINITELY MANY FIBONACCI COMPOSITES WITH PRIME SUBSCRIPTS
Research and Communcatons n Mathematcs and Mathematcal Scences Vol 10, Issue 2, 2018, Pages 123-140 ISSN 2319-6939 Publshed Onlne on November 19, 2018 2018 Jyot Academc Press http://jyotacademcpressorg
More informationA note on almost sure behavior of randomly weighted sums of φ-mixing random variables with φ-mixing weights
ACTA ET COMMENTATIONES UNIVERSITATIS TARTUENSIS DE MATHEMATICA Volume 7, Number 2, December 203 Avalable onlne at http://acutm.math.ut.ee A note on almost sure behavor of randomly weghted sums of φ-mxng
More informationwhere a is any ideal of R. Lemma 5.4. Let R be a ring. Then X = Spec R is a topological space Moreover the open sets
5. Schemes To defne schemes, just as wth algebrac varetes, the dea s to frst defne what an affne scheme s, and then realse an arbtrary scheme, as somethng whch s locally an affne scheme. The defnton of
More informationMath 261 Exercise sheet 2
Math 261 Exercse sheet 2 http://staff.aub.edu.lb/~nm116/teachng/2017/math261/ndex.html Verson: September 25, 2017 Answers are due for Monday 25 September, 11AM. The use of calculators s allowed. Exercse
More informationAnti-van der Waerden numbers of 3-term arithmetic progressions.
Ant-van der Waerden numbers of 3-term arthmetc progressons. Zhanar Berkkyzy, Alex Schulte, and Mchael Young Aprl 24, 2016 Abstract The ant-van der Waerden number, denoted by aw([n], k), s the smallest
More informationAppendix B. Criterion of Riemann-Stieltjes Integrability
Appendx B. Crteron of Remann-Steltes Integrablty Ths note s complementary to [R, Ch. 6] and [T, Sec. 3.5]. The man result of ths note s Theorem B.3, whch provdes the necessary and suffcent condtons for
More informationIntroduction to Algorithms
Introducton to Algorthms 6.046J/8.40J Lecture 7 Prof. Potr Indyk Data Structures Role of data structures: Encapsulate data Support certan operatons (e.g., INSERT, DELETE, SEARCH) Our focus: effcency of
More informationUsing T.O.M to Estimate Parameter of distributions that have not Single Exponential Family
IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran
More informationALGEBRA MID-TERM. 1 Suppose I is a principal ideal of the integral domain R. Prove that the R-module I R I has no non-zero torsion elements.
ALGEBRA MID-TERM CLAY SHONKWILER 1 Suppose I s a prncpal deal of the ntegral doman R. Prove that the R-module I R I has no non-zero torson elements. Proof. Note, frst, that f I R I has no non-zero torson
More informationExercise Solutions to Real Analysis
xercse Solutons to Real Analyss Note: References refer to H. L. Royden, Real Analyss xersze 1. Gven any set A any ɛ > 0, there s an open set O such that A O m O m A + ɛ. Soluton 1. If m A =, then there
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationwhere a is any ideal of R. Lemma Let R be a ring. Then X = Spec R is a topological space. Moreover the open sets
11. Schemes To defne schemes, just as wth algebrac varetes, the dea s to frst defne what an affne scheme s, and then realse an arbtrary scheme, as somethng whch s locally an affne scheme. The defnton of
More informationSL n (F ) Equals its Own Derived Group
Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu
More informationTAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES
TAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES SVANTE JANSON Abstract. We gve explct bounds for the tal probabltes for sums of ndependent geometrc or exponental varables, possbly wth dfferent
More informationCOMPLEX NUMBERS AND QUADRATIC EQUATIONS
COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not
More informationLinear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.
Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +
More informationInner Product. Euclidean Space. Orthonormal Basis. Orthogonal
Inner Product Defnton 1 () A Eucldean space s a fnte-dmensonal vector space over the reals R, wth an nner product,. Defnton 2 (Inner Product) An nner product, on a real vector space X s a symmetrc, blnear,
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationIntroduction to Algorithms
Introducton to Algorthms 6.046J/18.401J Lecture 7 Prof. Potr Indyk Data Structures Role of data structures: Encapsulate data Support certan operatons (e.g., INSERT, DELETE, SEARCH) What data structures
More informationREGULAR POSITIVE TERNARY QUADRATIC FORMS. 1. Introduction
REGULAR POSITIVE TERNARY QUADRATIC FORMS BYEONG-KWEON OH Abstract. A postve defnte quadratc form f s sad to be regular f t globally represents all ntegers that are represented by the genus of f. In 997
More informationComplete subgraphs in multipartite graphs
Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationAnother converse of Jensen s inequality
Another converse of Jensen s nequalty Slavko Smc Abstract. We gve the best possble global bounds for a form of dscrete Jensen s nequalty. By some examples ts frutfulness s shown. 1. Introducton Throughout
More informationProblem Solving in Math (Math 43900) Fall 2013
Problem Solvng n Math (Math 43900) Fall 2013 Week four (September 17) solutons Instructor: Davd Galvn 1. Let a and b be two nteger for whch a b s dvsble by 3. Prove that a 3 b 3 s dvsble by 9. Soluton:
More informationREAL ANALYSIS I HOMEWORK 1
REAL ANALYSIS I HOMEWORK CİHAN BAHRAN The questons are from Tao s text. Exercse 0.0.. If (x α ) α A s a collecton of numbers x α [0, + ] such that x α
More informationAsymptotics of the Solution of a Boundary Value. Problem for One-Characteristic Differential. Equation Degenerating into a Parabolic Equation
Nonl. Analyss and Dfferental Equatons, ol., 4, no., 5 - HIKARI Ltd, www.m-har.com http://dx.do.org/.988/nade.4.456 Asymptotcs of the Soluton of a Boundary alue Problem for One-Characterstc Dfferental Equaton
More informationa b a In case b 0, a being divisible by b is the same as to say that
Secton 6.2 Dvsblty among the ntegers An nteger a ε s dvsble by b ε f there s an nteger c ε such that a = bc. Note that s dvsble by any nteger b, snce = b. On the other hand, a s dvsble by only f a = :
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationBOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS
BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all
More informationON THE EXTENDED HAAGERUP TENSOR PRODUCT IN OPERATOR SPACES. 1. Introduction
ON THE EXTENDED HAAGERUP TENSOR PRODUCT IN OPERATOR SPACES TAKASHI ITOH AND MASARU NAGISA Abstract We descrbe the Haagerup tensor product l h l and the extended Haagerup tensor product l eh l n terms of
More informationLECTURE V. 1. More on the Chinese Remainder Theorem We begin by recalling this theorem, proven in the preceeding lecture.
LECTURE V EDWIN SPARK 1. More on the Chnese Remander Theorem We begn by recallng ths theorem, proven n the preceedng lecture. Theorem 1.1 (Chnese Remander Theorem). Let R be a rng wth deals I 1, I 2,...,
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationTHERE ARE NO POINTS OF ORDER 11 ON ELLIPTIC CURVES OVER Q.
THERE ARE NO POINTS OF ORDER 11 ON ELLIPTIC CURVES OVER Q. IAN KIMING We shall prove the followng result from [2]: Theorem 1. (Bllng-Mahler, 1940, cf. [2]) An ellptc curve defned over Q does not have a
More informationPolynomials. 1 More properties of polynomials
Polynomals 1 More propertes of polynomals Recall that, for R a commutatve rng wth unty (as wth all rngs n ths course unless otherwse noted), we defne R[x] to be the set of expressons n =0 a x, where a
More informationModelli Clamfim Equazioni differenziali 7 ottobre 2013
CLAMFIM Bologna Modell 1 @ Clamfm Equazon dfferenzal 7 ottobre 2013 professor Danele Rtell danele.rtell@unbo.t 1/18? Ordnary Dfferental Equatons A dfferental equaton s an equaton that defnes a relatonshp
More informationRepresentation theory and quantum mechanics tutorial Representation theory and quantum conservation laws
Representaton theory and quantum mechancs tutoral Representaton theory and quantum conservaton laws Justn Campbell August 1, 2017 1 Generaltes on representaton theory 1.1 Let G GL m (R) be a real algebrac
More informationOn the average number of divisors of the sum of digits of squares
Notes on Number heory and Dscrete Mathematcs Prnt ISSN 30 532, Onlne ISSN 2367 8275 Vol. 24, 208, No. 2, 40 46 DOI: 0.7546/nntdm.208.24.2.40-46 On the average number of dvsors of the sum of dgts of squares
More informationCurvature and isoperimetric inequality
urvature and sopermetrc nequalty Julà ufí, Agustí Reventós, arlos J Rodríguez Abstract We prove an nequalty nvolvng the length of a plane curve and the ntegral of ts radus of curvature, that has as a consequence
More informationEXPANSIVE MAPPINGS. by W. R. Utz
Volume 3, 978 Pages 6 http://topology.auburn.edu/tp/ EXPANSIVE MAPPINGS by W. R. Utz Topology Proceedngs Web: http://topology.auburn.edu/tp/ Mal: Topology Proceedngs Department of Mathematcs & Statstcs
More informationThe internal structure of natural numbers and one method for the definition of large prime numbers
The nternal structure of natural numbers and one method for the defnton of large prme numbers Emmanul Manousos APM Insttute for the Advancement of Physcs and Mathematcs 3 Poulou str. 53 Athens Greece Abstract
More informationMath 101 Fall 2013 Homework #7 Due Friday, November 15, 2013
Math 101 Fall 2013 Homework #7 Due Frday, November 15, 2013 1. Let R be a untal subrng of E. Show that E R R s somorphc to E. ANS: The map (s,r) sr s a R-balanced map of E R to E. Hence there s a group
More informationSelf-complementing permutations of k-uniform hypergraphs
Dscrete Mathematcs Theoretcal Computer Scence DMTCS vol. 11:1, 2009, 117 124 Self-complementng permutatons of k-unform hypergraphs Artur Szymańsk A. Paweł Wojda Faculty of Appled Mathematcs, AGH Unversty
More informationGeometry of Müntz Spaces
WDS'12 Proceedngs of Contrbuted Papers, Part I, 31 35, 212. ISBN 978-8-7378-224-5 MATFYZPRESS Geometry of Müntz Spaces P. Petráček Charles Unversty, Faculty of Mathematcs and Physcs, Prague, Czech Republc.
More informationLecture 17 : Stochastic Processes II
: Stochastc Processes II 1 Contnuous-tme stochastc process So far we have studed dscrete-tme stochastc processes. We studed the concept of Makov chans and martngales, tme seres analyss, and regresson analyss
More informationFINITELY-GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN
FINITELY-GENERTED MODULES OVER PRINCIPL IDEL DOMIN EMMNUEL KOWLSKI Throughout ths note, s a prncpal deal doman. We recall the classfcaton theorem: Theorem 1. Let M be a fntely-generated -module. (1) There
More informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
More informationJ. Number Theory 130(2010), no. 4, SOME CURIOUS CONGRUENCES MODULO PRIMES
J. Number Theory 30(200, no. 4, 930 935. SOME CURIOUS CONGRUENCES MODULO PRIMES L-Lu Zhao and Zh-We Sun Department of Mathematcs, Nanjng Unversty Nanjng 20093, People s Republc of Chna zhaollu@gmal.com,
More informationChristian Aebi Collège Calvin, Geneva, Switzerland
#A7 INTEGERS 12 (2012) A PROPERTY OF TWIN PRIMES Chrstan Aeb Collège Calvn, Geneva, Swtzerland chrstan.aeb@edu.ge.ch Grant Carns Department of Mathematcs, La Trobe Unversty, Melbourne, Australa G.Carns@latrobe.edu.au
More informationAndrew D. Loveless Department of Mathematics, University of Washington, Box , Seattle, WA , USA.
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 (2006, #A19 THE GENERAL GCD-PRODUCT FUNCTION Andrew D Loveless Department of Mathematcs, Unversty of Washngton, Box 354350, Seattle, WA 98195-4350,
More informationOn the Nilpotent Length of Polycyclic Groups
JOURNAL OF ALGEBRA 203, 125133 1998 ARTICLE NO. JA977321 On the Nlpotent Length of Polycyclc Groups Gerard Endmon* C.M.I., Unerste de Proence, UMR-CNRS 6632, 39, rue F. Jolot-Cure, 13453 Marselle Cedex
More informationFixed points of IA-endomorphisms of a free metabelian Lie algebra
Proc. Indan Acad. Sc. (Math. Sc.) Vol. 121, No. 4, November 2011, pp. 405 416. c Indan Academy of Scences Fxed ponts of IA-endomorphsms of a free metabelan Le algebra NAIME EKICI 1 and DEMET PARLAK SÖNMEZ
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationLecture 4. Instructor: Haipeng Luo
Lecture 4 Instructor: Hapeng Luo In the followng lectures, we focus on the expert problem and study more adaptve algorthms. Although Hedge s proven to be worst-case optmal, one may wonder how well t would
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationSTEINHAUS PROPERTY IN BANACH LATTICES
DEPARTMENT OF MATHEMATICS TECHNICAL REPORT STEINHAUS PROPERTY IN BANACH LATTICES DAMIAN KUBIAK AND DAVID TIDWELL SPRING 2015 No. 2015-1 TENNESSEE TECHNOLOGICAL UNIVERSITY Cookevlle, TN 38505 STEINHAUS
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationOn the set of natural numbers
On the set of natural numbers by Jalton C. Ferrera Copyrght 2001 Jalton da Costa Ferrera Introducton The natural numbers have been understood as fnte numbers, ths wor tres to show that the natural numbers
More informationCSCE 790S Background Results
CSCE 790S Background Results Stephen A. Fenner September 8, 011 Abstract These results are background to the course CSCE 790S/CSCE 790B, Quantum Computaton and Informaton (Sprng 007 and Fall 011). Each
More informationPES 1120 Spring 2014, Spendier Lecture 6/Page 1
PES 110 Sprng 014, Spender Lecture 6/Page 1 Lecture today: Chapter 1) Electrc feld due to charge dstrbutons -> charged rod -> charged rng We ntroduced the electrc feld, E. I defned t as an nvsble aura
More information10-801: Advanced Optimization and Randomized Methods Lecture 2: Convex functions (Jan 15, 2014)
0-80: Advanced Optmzaton and Randomzed Methods Lecture : Convex functons (Jan 5, 04) Lecturer: Suvrt Sra Addr: Carnege Mellon Unversty, Sprng 04 Scrbes: Avnava Dubey, Ahmed Hefny Dsclamer: These notes
More informationinv lve a journal of mathematics 2008 Vol. 1, No. 1 Divisibility of class numbers of imaginary quadratic function fields
nv lve a journal of mathematcs Dvsblty of class numbers of magnary quadratc functon felds Adam Merberg mathematcal scences publshers 2008 Vol. 1, No. 1 INVOLVE 1:1(2008) Dvsblty of class numbers of magnary
More informationFinding Primitive Roots Pseudo-Deterministically
Electronc Colloquum on Computatonal Complexty, Report No 207 (205) Fndng Prmtve Roots Pseudo-Determnstcally Ofer Grossman December 22, 205 Abstract Pseudo-determnstc algorthms are randomzed search algorthms
More informationSome basic inequalities. Definition. Let V be a vector space over the complex numbers. An inner product is given by a function, V V C
Some basc nequaltes Defnton. Let V be a vector space over the complex numbers. An nner product s gven by a functon, V V C (x, y) x, y satsfyng the followng propertes (for all x V, y V and c C) (1) x +
More informationVolume 18 Figure 1. Notation 1. Notation 2. Observation 1. Remark 1. Remark 2. Remark 3. Remark 4. Remark 5. Remark 6. Theorem A [2]. Theorem B [2].
Bulletn of Mathematcal Scences and Applcatons Submtted: 016-04-07 ISSN: 78-9634, Vol. 18, pp 1-10 Revsed: 016-09-08 do:10.1805/www.scpress.com/bmsa.18.1 Accepted: 016-10-13 017 ScPress Ltd., Swtzerland
More informationarxiv: v6 [math.nt] 23 Aug 2016
A NOTE ON ODD PERFECT NUMBERS JOSE ARNALDO B. DRIS AND FLORIAN LUCA arxv:03.437v6 [math.nt] 23 Aug 206 Abstract. In ths note, we show that f N s an odd perfect number and q α s some prme power exactly
More informationFURTHER RESULTS ON CONVOLUTIONS INVOLVING GAUSSIAN ERROR FUNCTION erf( x 1/2 )
1 ADV MATH SCI JOURNAL Advances n Mathematcs: Scentc Journal 6 (217, no.1, 2938 ISSN 1857-8365 prnted verson ISSN 1857-8438 electronc verson UDC: 517.18:517.983 FURTHER RESULTS ON CONVOLUTIONS INVOLVING
More informationAssortment Optimization under MNL
Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.
More informationPOL VAN HOFTEN (NOTES BY JAMES NEWTON)
INTEGRAL P -ADIC HODGE THEORY, TALK 2 (PERFECTOID RINGS, A nf AND THE PRO-ÉTALE SITE) POL VAN HOFTEN (NOTES BY JAMES NEWTON) 1. Wtt vectors, A nf and ntegral perfectod rngs The frst part of the talk wll
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More informationMAT 578 Functional Analysis
MAT 578 Functonal Analyss John Qugg Fall 2008 Locally convex spaces revsed September 6, 2008 Ths secton establshes the fundamental propertes of locally convex spaces. Acknowledgment: although I wrote these
More informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
More informationOn Finite Rank Perturbation of Diagonalizable Operators
Functonal Analyss, Approxmaton and Computaton 6 (1) (2014), 49 53 Publshed by Faculty of Scences and Mathematcs, Unversty of Nš, Serba Avalable at: http://wwwpmfnacrs/faac On Fnte Rank Perturbaton of Dagonalzable
More informationMaximizing the number of nonnegative subsets
Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum
More informationEdge Isoperimetric Inequalities
November 7, 2005 Ross M. Rchardson Edge Isopermetrc Inequaltes 1 Four Questons Recall that n the last lecture we looked at the problem of sopermetrc nequaltes n the hypercube, Q n. Our noton of boundary
More informationA new construction of 3-separable matrices via an improved decoding of Macula s construction
Dscrete Optmzaton 5 008 700 704 Contents lsts avalable at ScenceDrect Dscrete Optmzaton journal homepage: wwwelsevercom/locate/dsopt A new constructon of 3-separable matrces va an mproved decodng of Macula
More informationMATH 5707 HOMEWORK 4 SOLUTIONS 2. 2 i 2p i E(X i ) + E(Xi 2 ) ä i=1. i=1
MATH 5707 HOMEWORK 4 SOLUTIONS CİHAN BAHRAN 1. Let v 1,..., v n R m, all lengths v are not larger than 1. Let p 1,..., p n [0, 1] be arbtrary and set w = p 1 v 1 + + p n v n. Then there exst ε 1,..., ε
More informationAn (almost) unbiased estimator for the S-Gini index
An (almost unbased estmator for the S-Gn ndex Thomas Demuynck February 25, 2009 Abstract Ths note provdes an unbased estmator for the absolute S-Gn and an almost unbased estmator for the relatve S-Gn for
More informationGeneral viscosity iterative method for a sequence of quasi-nonexpansive mappings
Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 9 (2016), 5672 5682 Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence,
More informationOn the Operation A in Analysis Situs. by Kazimierz Kuratowski
v1.3 10/17 On the Operaton A n Analyss Stus by Kazmerz Kuratowsk Author s note. Ths paper s the frst part slghtly modfed of my thess presented May 12, 1920 at the Unversty of Warsaw for the degree of Doctor
More informationSmarandache-Zero Divisors in Group Rings
Smarandache-Zero Dvsors n Group Rngs W.B. Vasantha and Moon K. Chetry Department of Mathematcs I.I.T Madras, Chenna The study of zero-dvsors n group rngs had become nterestng problem snce 1940 wth the
More informationFirst day August 1, Problems and Solutions
FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve
More informationIntroductory Cardinality Theory Alan Kaylor Cline
Introductory Cardnalty Theory lan Kaylor Clne lthough by name the theory of set cardnalty may seem to be an offshoot of combnatorcs, the central nterest s actually nfnte sets. Combnatorcs deals wth fnte
More informationLecture 3: Probability Distributions
Lecture 3: Probablty Dstrbutons Random Varables Let us begn by defnng a sample space as a set of outcomes from an experment. We denote ths by S. A random varable s a functon whch maps outcomes nto the
More informationn-strongly Ding Projective, Injective and Flat Modules
Internatonal Mathematcal Forum, Vol. 7, 2012, no. 42, 2093-2098 n-strongly Dng Projectve, Injectve and Flat Modules Janmn Xng College o Mathematc and Physcs Qngdao Unversty o Scence and Technology Qngdao
More informationSolutions HW #2. minimize. Ax = b. Give the dual problem, and make the implicit equality constraints explicit. Solution.
Solutons HW #2 Dual of general LP. Fnd the dual functon of the LP mnmze subject to c T x Gx h Ax = b. Gve the dual problem, and make the mplct equalty constrants explct. Soluton. 1. The Lagrangan s L(x,
More information12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA. 4. Tensor product
12 MATH 101A: ALGEBRA I, PART C: MULTILINEAR ALGEBRA Here s an outlne of what I dd: (1) categorcal defnton (2) constructon (3) lst of basc propertes (4) dstrbutve property (5) rght exactness (6) localzaton
More informationDOUBLE POINTS AND THE PROPER TRANSFORM IN SYMPLECTIC GEOMETRY
DOUBLE POINTS AND THE PROPER TRANSFORM IN SYMPLECTIC GEOMETRY JOHN D. MCCARTHY AND JON G. WOLFSON 0. Introducton In hs book, Partal Dfferental Relatons, Gromov ntroduced the symplectc analogue of the complex
More information18.781: Solution to Practice Questions for Final Exam
18.781: Soluton to Practce Questons for Fnal Exam 1. Fnd three solutons n postve ntegers of x 6y = 1 by frst calculatng the contnued fracton expanson of 6. Soluton: We have 1 6=[, ] 6 6+ =[, ] 1 =[,, ]=[,,
More informationModule 2. Random Processes. Version 2 ECE IIT, Kharagpur
Module Random Processes Lesson 6 Functons of Random Varables After readng ths lesson, ou wll learn about cdf of functon of a random varable. Formula for determnng the pdf of a random varable. Let, X be
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationCase Study of Markov Chains Ray-Knight Compactification
Internatonal Journal of Contemporary Mathematcal Scences Vol. 9, 24, no. 6, 753-76 HIKAI Ltd, www.m-har.com http://dx.do.org/.2988/cms.24.46 Case Study of Marov Chans ay-knght Compactfcaton HaXa Du and
More information