Two formulas for the Euler ϕ-function
|
|
- Sharleen McCormick
- 5 years ago
- Views:
Transcription
1 Two formulas for the Euler ϕ-function Robert Frieman A multiplication formula for ϕ(n) The first formula we want to prove is the following: Theorem 1. If n 1 an n 2 are relatively prime positive integers, then Thus for example ϕ(n 1 n 2 ) = ϕ(n 1 )ϕ(n 2 ). ϕ(36) = ϕ(4 9) = ϕ(4)ϕ(9) = 2 6 = 12. On the other han, if n 1 an n 2 are not relatively prime, then it is never the case that ϕ(n 1 n 2 ) = ϕ(n 1 )ϕ(n 2 ). For example, ϕ(36) = ϕ(2 18) ϕ(2)ϕ(18) = 1 6 = 6. An easy inuction yiels the following generalization of Theorem 1: Theorem 2. If n 1,..., n 2 are positive integers such that, for all i j, n i an n j are relatively prime, then ϕ(n 1 n 2 n k ) = ϕ(n 1 )ϕ(n 2 ) ϕ(n k ). It is natural to apply Theorem 2 in the following situation: if n is factore as a prouct of istinct primes, say n = p a 1 1 pa 2 2 pa k k, where the p i are prime, a i 1, an, for all i j, p i p j, then ϕ(n) = ϕ(p a 1 1 pa 2 2 pa k k ) = ϕ(p a 1 1 )ϕ(pa 2 2 ) ϕ(pa k k ) = p a (p 1 1)p a (p 2 1) p a k 1 k (p k 1), 1
2 where we have use previous work to evaluate ϕ(p a ) for a prime power a. Using ( p a i 1 p a i ) ( ) ) i i (p i 1) = (p i 1) = p a i pi 1 i = p a i i (1 1pi, p i p i we can write the last prouct in the formula for ϕ(n) as ) ) ) p a 1 1 pa 2 2 pa k k (1 (1 1p1 1p2 (1 1pk. Finally, using n = p a 1 1 pa 2 2 pa k k, this expression takes the form ϕ(n) = n ( 1 1 ), p p n where the prouct is unerstoo to be over all of the primes iviing n. We shall prove Theorem 1 by proving a more conceptual result below. The Chinese Remainer Theorem The following result erives its name from the fact that it was known in Chinese mathematics about 100 AD in the form of a proceure for solving simultaneous ivisibility with remainer problems (although roughly equivalent formulations also turn up in Western mathematical texts aroun the same time): Theorem 3 (Chinese Remainer Theorem). If n 1 an n 2 are relatively prime positive integers an n = n 1 n 2, then, for all integers r 1, r 2, there exists an integer r such that r r 1 (mo n 1 ); r r 2 (mo n 2 ). Moreover, r is unique moulo n = n 1 n 2, in the sense that, if s is another integer such that s r 1 (mo n 1 ) an s r 2 (mo n 2 ), then r s (mo n). Proof. First we shall construct an r satisfying the conclusion; then we shall prove the uniqueness mo n. To fin r, use the fact that, since n 1 an n 2 are relatively prime, there exist integers a an b such that an 1 + bn 2 = 1. Now set r = r 2 an 1 + r 1 bn 2. 2
3 We claim that r has the esire properties. In fact, clearly r r 1 bn 2 (mo n 1 ). On the other han, multiplying the equation an 1 + bn 2 = 1 by r 1 gives r 1 an 1 + r 1 bn 2 = r 1. In particular, r 1 r 1 bn 2 (mo n 1 ). Using the reflexive an transitive properties of congruences, we see that r 1 bn 2 r 1 (mo n 1 ) an r r 1 bn 2 (mo n 1 ), so that r r 1 (mo n 1 ) as esire. The proof that r r 2 (mo n 2 ) is very similar an we will leave it to you. Now suppose that s is also an integer such that s r 1 (mo n 1 ) an s r 2 (mo n 2 ). Then r s 0 (mo n 1 ) an r s 0 (mo n 2 ). We nee to show that r s 0 (mo n), for then r s (mo n). To see this, note that by efinition, since r s 0 (mo n 1 ), n 1 ivies r s; say r s = n 1 k for some integer k. Since n 2 ivies r s = n 1 k an n 2 is relatively prime to n 1, it follows that n 1 ivies k; say k = n 2 l. Thus r s = n 1 n 2 l = nl, so that r s 0 (mo n). Hence r s (mo n). Note that the metho for fining r in the proof of the Chinese Remainer Theorem is completely constructive, once we know how to fin a, b such that 1 = an 1 + bn 2 (which we can fin using the Eucliean algorithm). Example 4. Let us fin an integer x such that x 3 (mo 13) an x 7 (mo 9). To fin x, first write 1 as a multiple of 13 plus a multiple of 9. We shall just give such an expression: 1 = Here n 1 = 13, n 2 = 9, r 1 = 3, r 2 = 7, an a = 7, b = 10. Following the recipe of the proof of the Chinese Remainer Theorem, we shoul take r = 7(7 13) + 3 ( 10 9) = = 367. Thus r = 367 solves the problem. However, we are only concerne with congruence mo 13 9 = 117, an (mo 117) since = 351 = Thus, the smallest positive r which is congruent to 3 mo 13 an 7 mo 9 is 16. It is natural to ask for necessary an sufficient conitions for solving the pairs of congruences r r 1 (mo n 1 ) an r r 2 (mo n 2 ) in case n 1 an n 2 are not relatively prime. We shall iscuss this in the exercises. One way to interpret the Chinese Remainer Theorem is as follows. Given relatively prime positive integers n 1 an n 2 an n = n 1 n 2, if we have prescribe remainers r 1 an r 2 for n 1 an n 2 respectively (0 r 1 n 1 1 an 0 r 2 n 2 1), in other wors we want to fin an integer r with remainer r 1 when ivie by n 1 an remainer r 2 when ivie by n 2, then 3
4 we can always fin such an integer, an its remainer after long ivision by n is uniquely specifie by this conition. Since there are n 1 possible integers r 1 satisfying 0 r 1 n 1 1 an n 2 possible integers r 2 satisfying 0 r 2 n 2 1, the number of pairs (r 1, r 2 ) of such integers is n 1 n 2 = n, an this is of course the number of possible remainers r, i.e. integers r with 0 r n 1. To use the above iea to get information about the Euler ϕ-function, we recall the following lemma (Corollary 12 in Lecture 4): Lemma 5. Let n be a positive integer. Then a 1 an a 2 are both relatively prime to n if an only if a 1 a 2 is relatively prime to n. Applying this lemma to r, n 1, n 2, we see that r is relatively prime to n 1 an n 2 if an only if r is relatively prime to n = n 1 n 2. It follows that an integer r, 0 r n 1 an relatively prime to n, is uniquely specifie by two integers r 1 an r 2, where 0 r 1 n 1 1, r 1 is relatively prime to n 1, 0 r 2 n 2 1, an r 2 is relatively prime to n 2. Counting up an using the efinition of the ϕ-function, we see that we have prove Theorem 1: If n 1 an n 2 are relatively prime positive integers, then ϕ(n 1 n 2 ) = ϕ(n 1 )ϕ(n 2 ). An example may make this clearer. In the following table, we tabulate the possible pairs of remainers (r 1, r 2 ) mo 2 an 3 respectively, an the corresponing remainer r mo 6. You can then check irectly that r is relatively prime to 6 if an only if r 1 is relatively prime to 2 (r 1 = 1) an r 2 is relative prime to 3 (r 2 = 1, 2). (r 1, r 2 ) (0,0) (1,0) (0,1) (1,1) (0,2) (1,2) r A secon formula for ϕ(n) The formula in question is the following: Theorem 6. For all positive integers n, n = n ϕ(). 4
5 The formula means that, if we sum up ϕ() over all of the ivisors of n (incluing 1 an n), then the result is n. For example, 18 = ϕ(1) + ϕ(2) + ϕ(3) + ϕ(6) + ϕ(9) + ϕ(18) = As with our first formula, we shall erive Theorem 6 from a more conceptual result. We begin with the following efinition. Definition 7. Let n be a positive integer, an let a be an integer. The orer of a mo n is the smallest positive integer k such that ak 0 (mo n), i.e. such that n ivies ak. Example Since n an for every a, the orer of a is well-efine an is always less than or equal to n. 2. The orer of 0 is The orer of 1 is n. 4. More generally, if the gc of a an n is 1, the orer of a is n. (If a an n are relatively prime an n ak, then n k an hence the orer is a multiple of n. Since the orer of a mo n is also positive an less than or equal to n, it is exactly n.) 5. If a b (mo n), then a an b have the same orer mo n. (The proof is an exercise.) Generalizing (4) above, we have the following: Proposition 9. The orer of a mo n is n/, where is the gc of a an n. Proof. First note that, since a an n, ( n ) ( a a = n, ) which is thus a multiple of n. Hence the orer of a is at most n/. To see that the orer is exactly, recall that a/ an n/ are relatively prime. (There exist integers x, y such that ax + ny =. Diviing through by gives ( a ( n ) 1 = x + y, ) 5
6 so that a/ an n/ are relatively prime.) Now if k is the orer of a mo n, then k is a positive integer an n ivies ak. Hence n/ ivies (a/)k (if ak = nl, then (a/)k = (n/)l). But since a/ an n/ are relatively prime, if n/ ivies (a/)k, then n/ ivies k, an hence k is at least n/. Since k is also at most n/, it is exactly n/. Corollary 10. The orer of a mo n ivies n. Corollary 11. The orer of a mo n is n if an only if a an n are relatively prime. Proof. Proposition 9 implies that the orer of a mo n is n if an only if the gc of a an n is 1, i.e. if an only if a an n are relatively prime. Following the train of though in Corollary 11, we can ask the following question: Given a positive integer, how many integers a have orer mo n? If oes not ivie n, then there are none, by Corollary 10, so we shall always assume that ivies n. Of course, we are only intereste in a up to congruence mo n (otherwise there are always infinitely many possible a), so we coul ask more precisely how many integers r with 0 r n 1 have orer. For example, r has orer n mo n if an only if r an n are relatively prime, by Corollary 11, so the number of r with 0 r n 1 which have orer n mo n is ϕ(n). Generalizing this, we have: Proposition 12. If n, then there are exactly ϕ() integers r with 0 r n 1 whose orer mo n is. Proof. Let ivie n, an suppose that r has orer mo n, where 0 r n 1. Then n r, an hence n/ ivies r. Write r = b n for some. Since 0 r n 1, 0 b 1. It now clearly suffices to show that b n has orer mo n if an only if b is relatively prime to, since there are exactly ϕ() such integers b with 0 b 1. First note that b n = bn, which is clearly ivisible by n, so that the orer of b n n mo n is at most. Now n ivies k b for some k if an only if nl = k b n for some integer l, if an only if l = kb, if an only if ivies kb. If b an are relatively prime, ivies kb if an only if ivies k, an so the orer of b n is at least if b an are relatively prime. Thus, the orer of 6
7 b n is exactly if b an are relatively prime. If an b have a common factor e > 1, then ivies e b = b n, an hence the orer of b is at e most /e < e. Thus, b n has orer mo n if an only if b is relatively prime to, an hence there are exactly ϕ() integers r with 0 r n 1 whose orer mo n is. We now show that Theorem 6 is a corollary of Proposition 12. Given r with 0 r n, it has some orer mo n, an n ivies. Moreover, by Proposition 12, there are exactly ϕ() integers r with 0 r n such that r has orer mo n. Hence n ϕ() counts up every r with 0 r n, exactly once, an so n ϕ() = n. Exercises Exercise 1. Calculate ϕ(180); ϕ(900). Exercise 2. What are all positive integers n with ϕ(n) = 1? With ϕ(n) = 2? Exercise 3. How many o numbers are there which are less than one million an whose last igit is not 5? Exercise 4. Fin a number which is congruent to 6 mo 12 an to 1 mo 13. What is the smallest such positive number? Exercise 5. A ban of 13 pirates stole a chest containing a certain number of gol coins. They trie to ivie them up equally, but there were 8 left over. Two pirates ie of smallpox, an they trie to ivie up the coins again. This time there were 3 left over. They then shot three pirates an trie again, but there was a remainer of 5 coins this time. What was the smallest possible number of coins? Exercise 6. What is the orer of 36 mo 45? Of 13 mo 100? Exercise 7. Let k an n be positive integers. Suppose that a b (mo n). Is it always the case that a b (mo k)? Fin an example where this oes not hol for n = 5 an k = 2. However, suppose that in aition k n. Show that, if a b (mo n), then a b (mo k). 7
8 Exercise 8. Suppose that n 1 an n 2 are two positive integers, not necessarily relatively prime, an that = gc(n 1, n 2 ). Suppose that r 1 an r 2 are two integers an that there exists an integer r such that r r 1 (mo n 1 ) an r r 2 (mo n 2 ). Show that r 1 r 2 (mo ). (One can show the following: Conversely, if n 1, n 2 an are as above, an r 1 an r 2 are two integers such that r 1 r 2 (mo ), then there exists an integer r such that r r 1 (mo n 1 ) an r r 2 (mo n 2 ).) 8
Witt#5: Around the integrality criterion 9.93 [version 1.1 (21 April 2013), not completed, not proofread]
Witt vectors. Part 1 Michiel Hazewinkel Sienotes by Darij Grinberg Witt#5: Aroun the integrality criterion 9.93 [version 1.1 21 April 2013, not complete, not proofrea In [1, section 9.93, Hazewinkel states
More informationChapter 5. Factorization of Integers
Chapter 5 Factorization of Integers 51 Definition: For a, b Z we say that a ivies b (or that a is a factor of b, or that b is a multiple of a, an we write a b, when b = ak for some k Z 52 Theorem: (Basic
More informationWeek 1: Number Theory - Euler Phi Function, Order and Primitive Roots. 1 Greatest Common Divisor and the Euler Phi Function
2010 IMO Summer Training: Number Theory 1 Week 1: Number Theory - Euler Phi Function, Orer an Primitive Roots 1 Greatest Common Divisor an the Euler Phi Function Consier the following problem. Exercise
More informationLinear First-Order Equations
5 Linear First-Orer Equations Linear first-orer ifferential equations make up another important class of ifferential equations that commonly arise in applications an are relatively easy to solve (in theory)
More informationLEGENDRE TYPE FORMULA FOR PRIMES GENERATED BY QUADRATIC POLYNOMIALS
Ann. Sci. Math. Québec 33 (2009), no 2, 115 123 LEGENDRE TYPE FORMULA FOR PRIMES GENERATED BY QUADRATIC POLYNOMIALS TAKASHI AGOH Deicate to Paulo Ribenboim on the occasion of his 80th birthay. RÉSUMÉ.
More informationProof by Mathematical Induction.
Proof by Mathematical Inuction. Mathematicians have very peculiar characteristics. They like proving things or mathematical statements. Two of the most important techniques of mathematical proof are proof
More informationZachary Scherr Math 503 HW 5 Due Friday, Feb 26
Zachary Scherr Math 503 HW 5 Due Friay, Feb 26 1 Reaing 1. Rea Chapter 9 of Dummit an Foote 2 Problems 1. 9.1.13 Solution: We alreay know that if R is any commutative ring, then R[x]/(x r = R for any r
More informationQF101: Quantitative Finance September 5, Week 3: Derivatives. Facilitator: Christopher Ting AY 2017/2018. f ( x + ) f(x) f(x) = lim
QF101: Quantitative Finance September 5, 2017 Week 3: Derivatives Facilitator: Christopher Ting AY 2017/2018 I recoil with ismay an horror at this lamentable plague of functions which o not have erivatives.
More informationThe derivative of a function f(x) is another function, defined in terms of a limiting expression: f(x + δx) f(x)
Y. D. Chong (2016) MH2801: Complex Methos for the Sciences 1. Derivatives The erivative of a function f(x) is another function, efine in terms of a limiting expression: f (x) f (x) lim x δx 0 f(x + δx)
More informationOn the enumeration of partitions with summands in arithmetic progression
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 8 (003), Pages 149 159 On the enumeration of partitions with summans in arithmetic progression M. A. Nyblom C. Evans Department of Mathematics an Statistics
More informationAcute sets in Euclidean spaces
Acute sets in Eucliean spaces Viktor Harangi April, 011 Abstract A finite set H in R is calle an acute set if any angle etermine by three points of H is acute. We examine the maximal carinality α() of
More informationKnow the Well-ordering principle: Any set of positive integers which has at least one element contains a smallest element.
The first exam will be on Monday, June 8, 202. The syllabus will be sections. and.2 in Lax, and the number theory handout found on the class web site, plus the handout on the method of successive squaring
More informationZachary Scherr Math 503 HW 3 Due Friday, Feb 12
Zachary Scherr Math 503 HW 3 Due Friay, Feb 1 1 Reaing 1. Rea sections 7.5, 7.6, 8.1 of Dummit an Foote Problems 1. DF 7.5. Solution: This problem is trivial knowing how to work with universal properties.
More informationImplicit Differentiation
Implicit Differentiation Thus far, the functions we have been concerne with have been efine explicitly. A function is efine explicitly if the output is given irectly in terms of the input. For instance,
More informationLINEAR DIFFERENTIAL EQUATIONS OF ORDER 1. where a(x) and b(x) are functions. Observe that this class of equations includes equations of the form
LINEAR DIFFERENTIAL EQUATIONS OF ORDER 1 We consier ifferential equations of the form y + a()y = b(), (1) y( 0 ) = y 0, where a() an b() are functions. Observe that this class of equations inclues equations
More informationJUST THE MATHS UNIT NUMBER DIFFERENTIATION 2 (Rates of change) A.J.Hobson
JUST THE MATHS UNIT NUMBER 10.2 DIFFERENTIATION 2 (Rates of change) by A.J.Hobson 10.2.1 Introuction 10.2.2 Average rates of change 10.2.3 Instantaneous rates of change 10.2.4 Derivatives 10.2.5 Exercises
More informationALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS
ALGEBRAIC AND ANALYTIC PROPERTIES OF ARITHMETIC FUNCTIONS MARK SCHACHNER Abstract. When consiere as an algebraic space, the set of arithmetic functions equippe with the operations of pointwise aition an
More information4.2 First Differentiation Rules; Leibniz Notation
.. FIRST DIFFERENTIATION RULES; LEIBNIZ NOTATION 307. First Differentiation Rules; Leibniz Notation In this section we erive rules which let us quickly compute the erivative function f (x) for any polynomial
More informationTOEPLITZ AND POSITIVE SEMIDEFINITE COMPLETION PROBLEM FOR CYCLE GRAPH
English NUMERICAL MATHEMATICS Vol14, No1 Series A Journal of Chinese Universities Feb 2005 TOEPLITZ AND POSITIVE SEMIDEFINITE COMPLETION PROBLEM FOR CYCLE GRAPH He Ming( Λ) Michael K Ng(Ξ ) Abstract We
More informationSECTION 3.2 THE PRODUCT AND QUOTIENT RULES 1 8 3
SECTION 3.2 THE PRODUCT AND QUOTIENT RULES 8 3 L P f Q L segments L an L 2 to be tangent to the parabola at the transition points P an Q. (See the figure.) To simplify the equations you ecie to place the
More informationLectures - Week 10 Introduction to Ordinary Differential Equations (ODES) First Order Linear ODEs
Lectures - Week 10 Introuction to Orinary Differential Equations (ODES) First Orer Linear ODEs When stuying ODEs we are consiering functions of one inepenent variable, e.g., f(x), where x is the inepenent
More informationd dx But have you ever seen a derivation of these results? We ll prove the first result below. cos h 1
Lecture 5 Some ifferentiation rules Trigonometric functions (Relevant section from Stewart, Seventh Eition: Section 3.3) You all know that sin = cos cos = sin. () But have you ever seen a erivation of
More information2Algebraic ONLINE PAGE PROOFS. foundations
Algebraic founations. Kick off with CAS. Algebraic skills.3 Pascal s triangle an binomial expansions.4 The binomial theorem.5 Sets of real numbers.6 Surs.7 Review . Kick off with CAS Playing lotto Using
More information7. Localization. (d 1, m 1 ) (d 2, m 2 ) d 3 D : d 3 d 1 m 2 = d 3 d 2 m 1. (ii) If (d 1, m 1 ) (d 1, m 1 ) and (d 2, m 2 ) (d 2, m 2 ) then
7. Localization To prove Theorem 6.1 it becomes necessary to be able to a enominators to rings (an to moules), even when the rings have zero-ivisors. It is a tool use all the time in commutative algebra,
More informationDiophantine Approximations: Examining the Farey Process and its Method on Producing Best Approximations
Diophantine Approximations: Examining the Farey Process an its Metho on Proucing Best Approximations Kelly Bowen Introuction When a person hears the phrase irrational number, one oes not think of anything
More informationDigitally delicate primes
Digitally elicate rimes Jackson Hoer Paul Pollack Deartment of Mathematics University of Georgia Athens, Georgia 30602 Tao has shown that in any fixe base, a ositive roortion of rime numbers cannot have
More informationII. First variation of functionals
II. First variation of functionals The erivative of a function being zero is a necessary conition for the etremum of that function in orinary calculus. Let us now tackle the question of the equivalent
More informationSchrödinger s equation.
Physics 342 Lecture 5 Schröinger s Equation Lecture 5 Physics 342 Quantum Mechanics I Wenesay, February 3r, 2010 Toay we iscuss Schröinger s equation an show that it supports the basic interpretation of
More informationarxiv: v1 [math.co] 31 Mar 2008
On the maximum size of a (k,l)-sum-free subset of an abelian group arxiv:080386v1 [mathco] 31 Mar 2008 Béla Bajnok Department of Mathematics, Gettysburg College Gettysburg, PA 17325-186 USA E-mail: bbajnok@gettysburgeu
More informationThe Exact Form and General Integrating Factors
7 The Exact Form an General Integrating Factors In the previous chapters, we ve seen how separable an linear ifferential equations can be solve using methos for converting them to forms that can be easily
More informationPeriods of quadratic twists of elliptic curves
Perios of quaratic twists of elliptic curves Vivek Pal with an appenix by Amo Agashe Abstract In this paper we prove a relation between the perio of an elliptic curve an the perio of its real an imaginary
More informationMath 300 Winter 2011 Advanced Boundary Value Problems I. Bessel s Equation and Bessel Functions
Math 3 Winter 2 Avance Bounary Value Problems I Bessel s Equation an Bessel Functions Department of Mathematical an Statistical Sciences University of Alberta Bessel s Equation an Bessel Functions We use
More informationLecture 5. Symmetric Shearer s Lemma
Stanfor University Spring 208 Math 233: Non-constructive methos in combinatorics Instructor: Jan Vonrák Lecture ate: January 23, 208 Original scribe: Erik Bates Lecture 5 Symmetric Shearer s Lemma Here
More informationLecture 6: Calculus. In Song Kim. September 7, 2011
Lecture 6: Calculus In Song Kim September 7, 20 Introuction to Differential Calculus In our previous lecture we came up with several ways to analyze functions. We saw previously that the slope of a linear
More informationSurvey Sampling. 1 Design-based Inference. Kosuke Imai Department of Politics, Princeton University. February 19, 2013
Survey Sampling Kosuke Imai Department of Politics, Princeton University February 19, 2013 Survey sampling is one of the most commonly use ata collection methos for social scientists. We begin by escribing
More informationSimilar Operators and a Functional Calculus for the First-Order Linear Differential Operator
Avances in Applie Mathematics, 9 47 999 Article ID aama.998.067, available online at http: www.iealibrary.com on Similar Operators an a Functional Calculus for the First-Orer Linear Differential Operator
More informationApplications of the Wronskian to ordinary linear differential equations
Physics 116C Fall 2011 Applications of the Wronskian to orinary linear ifferential equations Consier a of n continuous functions y i (x) [i = 1,2,3,...,n], each of which is ifferentiable at least n times.
More informationNOTES. The Primes that Euclid Forgot
NOTES Eite by Sergei Tabachnikov The Primes that Eucli Forgot Paul Pollack an Enrique Treviño Abstract. Let q 2. Suosing that we have efine q j for all ale j ale k, let q k+ be a rime factor of + Q k j
More informationPure Further Mathematics 1. Revision Notes
Pure Further Mathematics Revision Notes June 20 2 FP JUNE 20 SDB Further Pure Complex Numbers... 3 Definitions an arithmetical operations... 3 Complex conjugate... 3 Properties... 3 Complex number plane,
More informationHomework 5 Solutions
Homewor 5 Solutions Enrique Treviño October 10, 2014 1 Chater 5 Problem 1. Exercise 1 Suose that G is a finite grou with an element g of orer 5 an an element h of orer 7. Why must G 35? Solution 1. Let
More informationRelatively Prime Uniform Partitions
Gen. Math. Notes, Vol. 13, No., December, 01, pp.1-1 ISSN 19-7184; Copyright c ICSRS Publication, 01 www.i-csrs.org Available free online at http://www.geman.in Relatively Prime Uniform Partitions A. Davi
More informationPDE Notes, Lecture #11
PDE Notes, Lecture # from Professor Jalal Shatah s Lectures Febuary 9th, 2009 Sobolev Spaces Recall that for u L loc we can efine the weak erivative Du by Du, φ := udφ φ C0 If v L loc such that Du, φ =
More informationReview/Outline Review: Basic computations in finite fields Reed-Solomon codes Hamming codes Bose-Chaudhuri-Hocquengham (BCH) codes
Review/Outline Review: Basic computations in finite fiels Ree-Solomon coes Hamming coes Bose-Chauhuri-Hocquengham (BCH) coes Testing for irreucibility Frobenius automorphisms Other roots of equations Counting
More informationREAL ANALYSIS I HOMEWORK 5
REAL ANALYSIS I HOMEWORK 5 CİHAN BAHRAN The questions are from Stein an Shakarchi s text, Chapter 3. 1. Suppose ϕ is an integrable function on R with R ϕ(x)x = 1. Let K δ(x) = δ ϕ(x/δ), δ > 0. (a) Prove
More informationCalculus in the AP Physics C Course The Derivative
Limits an Derivatives Calculus in the AP Physics C Course The Derivative In physics, the ieas of the rate change of a quantity (along with the slope of a tangent line) an the area uner a curve are essential.
More informationAlgebra IV. Contents. Alexei Skorobogatov. December 12, 2017
Algebra IV Alexei Skorobogatov December 12, 2017 Abstract This course is an introuction to homological algebra an group cohomology. Contents 1 Moules over a ring 2 1.1 Definitions an examples.........................
More informationMath 115 Section 018 Course Note
Course Note 1 General Functions Definition 1.1. A function is a rule that takes certain numbers as inputs an assigns to each a efinite output number. The set of all input numbers is calle the omain of
More informationDerivatives and the Product Rule
Derivatives an the Prouct Rule James K. Peterson Department of Biological Sciences an Department of Mathematical Sciences Clemson University January 28, 2014 Outline Differentiability Simple Derivatives
More informationNILPOTENCE ORDER GROWTH OF RECURSION OPERATORS IN CHARACTERISTIC p. Contents. 1. Introduction Preliminaries 3. References
NILPOTENCE ORDER GROWTH OF RECURSION OPERATORS IN CHARACTERISTIC p ANNA MEDVEDOVSKY Abstract. We prove that the killing rate of certain egree-lowering recursion operators on a polynomial algebra over a
More informationConstruction of the Electronic Radial Wave Functions and Probability Distributions of Hydrogen-like Systems
Construction of the Electronic Raial Wave Functions an Probability Distributions of Hyrogen-like Systems Thomas S. Kuntzleman, Department of Chemistry Spring Arbor University, Spring Arbor MI 498 tkuntzle@arbor.eu
More informationLecture 10: October 30, 2017
Information an Coing Theory Autumn 2017 Lecturer: Mahur Tulsiani Lecture 10: October 30, 2017 1 I-Projections an applications In this lecture, we will talk more about fining the istribution in a set Π
More informationCalculus of Variations
Calculus of Variations Lagrangian formalism is the main tool of theoretical classical mechanics. Calculus of Variations is a part of Mathematics which Lagrangian formalism is base on. In this section,
More information7.1 Support Vector Machine
67577 Intro. to Machine Learning Fall semester, 006/7 Lecture 7: Support Vector Machines an Kernel Functions II Lecturer: Amnon Shashua Scribe: Amnon Shashua 7. Support Vector Machine We return now to
More informationTHE MONIC INTEGER TRANSFINITE DIAMETER
MATHEMATICS OF COMPUTATION Volume 00, Number 0, Pages 000 000 S 005-578(XX)0000-0 THE MONIC INTEGER TRANSFINITE DIAMETER K. G. HARE AND C. J. SMYTH ABSTRACT. We stuy the problem of fining nonconstant monic
More informationA Readable Introduction to Real Mathematics
Solutions to selected problems in the book A Readable Introduction to Real Mathematics D. Rosenthal, D. Rosenthal, P. Rosenthal Chapter 7: The Euclidean Algorithm and Applications 1. Find the greatest
More information1 Lecture 18: The chain rule
1 Lecture 18: The chain rule 1.1 Outline Comparing the graphs of sin(x) an sin(2x). The chain rule. The erivative of a x. Some examples. 1.2 Comparing the graphs of sin(x) an sin(2x) We graph f(x) = sin(x)
More informationUNDERSTANDING INTEGRATION
UNDERSTANDING INTEGRATION Dear Reaer The concept of Integration, mathematically speaking, is the "Inverse" of the concept of result, the integration of, woul give us back the function f(). This, in a way,
More information2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
More informationNotes on Lie Groups, Lie algebras, and the Exponentiation Map Mitchell Faulk
Notes on Lie Groups, Lie algebras, an the Exponentiation Map Mitchell Faulk 1. Preliminaries. In these notes, we concern ourselves with special objects calle matrix Lie groups an their corresponing Lie
More informationMultiplicative properties of sets of residues
Multiplicative properties of sets of resiues C. Pomerance Hanover an A. Schinzel Warszawa Abstract: We conjecture that for each natural number n, every set of resiues mo n of carinality at least n/2 contains
More informationPart V. Chapter 19. Congruence of integers
Part V. Chapter 19. Congruence of integers Congruence modulo m Let m be a positive integer. Definition. Integers a and b are congruent modulo m if and only if a b is divisible by m. For example, 1. 277
More informationReview of Differentiation and Integration for Ordinary Differential Equations
Schreyer Fall 208 Review of Differentiation an Integration for Orinary Differential Equations In this course you will be expecte to be able to ifferentiate an integrate quickly an accurately. Many stuents
More informationSOME DIVISIBILITY PROPERTIES OF BINOMIAL AND q-binomial COEFFICIENTS
SOME DIVISIBILITY PROPERTIES OF BINOMIAL AND -BINOMIAL COEFFICIENTS Victor J. W. Guo an C. Krattenthaler 2 Department of Mathematics East China Normal University Shanghai 200062 People s Republic of China
More informationSturm-Liouville Theory
LECTURE 5 Sturm-Liouville Theory In the three preceing lectures I emonstrate the utility of Fourier series in solving PDE/BVPs. As we ll now see, Fourier series are just the tip of the iceberg of the theory
More informationLenny Jones Department of Mathematics, Shippensburg University, Shippensburg, Pennsylvania Daniel White
#A10 INTEGERS 1A (01): John Selfrige Memorial Issue SIERPIŃSKI NUMBERS IN IMAGINARY QUADRATIC FIELDS Lenny Jones Deartment of Mathematics, Shiensburg University, Shiensburg, Pennsylvania lkjone@shi.eu
More informationIntegration Review. May 11, 2013
Integration Review May 11, 2013 Goals: Review the funamental theorem of calculus. Review u-substitution. Review integration by parts. Do lots of integration eamples. 1 Funamental Theorem of Calculus In
More informationay (t) + by (t) + cy(t) = 0 (2)
Solving ay + by + cy = 0 Without Characteristic Equations, Complex Numbers, or Hats John Tolle Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA 15213-3890 Some calculus courses
More informationCHAPTER 1 : DIFFERENTIABLE MANIFOLDS. 1.1 The definition of a differentiable manifold
CHAPTER 1 : DIFFERENTIABLE MANIFOLDS 1.1 The efinition of a ifferentiable manifol Let M be a topological space. This means that we have a family Ω of open sets efine on M. These satisfy (1), M Ω (2) the
More informationA Look at the ABC Conjecture via Elliptic Curves
A Look at the ABC Conjecture via Elliptic Curves Nicole Cleary Brittany DiPietro Alexaner Hill Gerar D.Koffi Beihua Yan Abstract We stuy the connection between elliptic curves an ABC triples. Two important
More informationx = c of N if the limit of f (x) = L and the right-handed limit lim f ( x)
Limit We say the limit of f () as approaches c equals L an write, lim L. One-Sie Limits (Left an Right-Hane Limits) Suppose a function f is efine near but not necessarily at We say that f has a left-hane
More informationSection 2.7 Derivatives of powers of functions
Section 2.7 Derivatives of powers of functions (3/19/08) Overview: In this section we iscuss the Chain Rule formula for the erivatives of composite functions that are forme by taking powers of other functions.
More informationVectors in two dimensions
Vectors in two imensions Until now, we have been working in one imension only The main reason for this is to become familiar with the main physical ieas like Newton s secon law, without the aitional complication
More informationDifferentiation Rules Derivatives of Polynomials and Exponential Functions
Derivatives of Polynomials an Exponential Functions Differentiation Rules Derivatives of Polynomials an Exponential Functions Let s start with the simplest of all functions, the constant function f(x)
More informationRamsey numbers of some bipartite graphs versus complete graphs
Ramsey numbers of some bipartite graphs versus complete graphs Tao Jiang, Michael Salerno Miami University, Oxfor, OH 45056, USA Abstract. The Ramsey number r(h, K n ) is the smallest positive integer
More informationSection 7.1: Integration by Parts
Section 7.1: Integration by Parts 1. Introuction to Integration Techniques Unlike ifferentiation where there are a large number of rules which allow you (in principle) to ifferentiate any function, the
More information2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
More informationUnit #6 - Families of Functions, Taylor Polynomials, l Hopital s Rule
Unit # - Families of Functions, Taylor Polynomials, l Hopital s Rule Some problems an solutions selecte or aapte from Hughes-Hallett Calculus. Critical Points. Consier the function f) = 54 +. b) a) Fin
More informationChapter 3 Notes, Applied Calculus, Tan
Contents 3.1 Basic Rules of Differentiation.............................. 2 3.2 The Prouct an Quotient Rules............................ 6 3.3 The Chain Rule...................................... 9 3.4
More informationf(x + h) f(x) f (x) = lim
Introuction 4.3 Some Very Basic Differentiation Formulas If a ifferentiable function f is quite simple, ten it is possible to fin f by using te efinition of erivative irectly: f () 0 f( + ) f() However,
More information1 Structure of Finite Fields
T-79.5501 Cryptology Additional material September 27, 2005 1 Structure of Finite Fields This section contains complementary material to Section 5.2.3 of the text-book. It is not entirely self-contained
More informationSOLUTIONS TO PROBLEM SET 1. Section = 2 3, 1. n n + 1. k(k + 1) k=1 k(k + 1) + 1 (n + 1)(n + 2) n + 2,
SOLUTIONS TO PROBLEM SET 1 Section 1.3 Exercise 4. We see that 1 1 2 = 1 2, 1 1 2 + 1 2 3 = 2 3, 1 1 2 + 1 2 3 + 1 3 4 = 3 4, and is reasonable to conjecture n k=1 We will prove this formula by induction.
More informationA Sketch of Menshikov s Theorem
A Sketch of Menshikov s Theorem Thomas Bao March 14, 2010 Abstract Let Λ be an infinite, locally finite oriente multi-graph with C Λ finite an strongly connecte, an let p
More informationSolutions to Practice Problems Tuesday, October 28, 2008
Solutions to Practice Problems Tuesay, October 28, 2008 1. The graph of the function f is shown below. Figure 1: The graph of f(x) What is x 1 + f(x)? What is x 1 f(x)? An oes x 1 f(x) exist? If so, what
More informationFirst Order Linear Differential Equations
LECTURE 8 First Orer Linear Differential Equations We now turn our attention to the problem of constructing analytic solutions of ifferential equations; that is to say,solutions that can be epresse in
More informationarxiv: v1 [quant-ph] 23 Aug 2016
Diagonal gates in the Cliffor hierarchy Shawn X. Cui, 1,2 Daniel Gottesman, 3,4 an Aniruh Krishna 3,5 1 University of California Santa Barbara, USA 2 Stanfor University, Palo Alto, USA 3 Perimeter Institute
More informationOn colour-blind distinguishing colour pallets in regular graphs
J Comb Optim (2014 28:348 357 DOI 10.1007/s10878-012-9556-x On colour-blin istinguishing colour pallets in regular graphs Jakub Przybyło Publishe online: 25 October 2012 The Author(s 2012. This article
More informationWJEC Core 2 Integration. Section 1: Introduction to integration
WJEC Core Integration Section : Introuction to integration Notes an Eamples These notes contain subsections on: Reversing ifferentiation The rule for integrating n Fining the arbitrary constant Reversing
More informationA New Vulnerable Class of Exponents in RSA
A ew Vulnerable Class of Exponents in RSA Aberrahmane itaj Laboratoire e Mathématiues icolas Oresme Campus II, Boulevar u Maréchal Juin BP 586, 4032 Caen Ceex, France. nitaj@math.unicaen.fr http://www.math.unicaen.fr/~nitaj
More informationThe primitive root theorem
The primitive root theorem Mar Steinberger First recall that if R is a ring, then a R is a unit if there exists b R with ab = ba = 1. The collection of all units in R is denoted R and forms a group under
More informationSummary: Differentiation
Techniques of Differentiation. Inverse Trigonometric functions The basic formulas (available in MF5 are: Summary: Differentiation ( sin ( cos The basic formula can be generalize as follows: Note: ( sin
More informationA Course in Machine Learning
A Course in Machine Learning Hal Daumé III 12 EFFICIENT LEARNING So far, our focus has been on moels of learning an basic algorithms for those moels. We have not place much emphasis on how to learn quickly.
More informationLIAISON OF MONOMIAL IDEALS
LIAISON OF MONOMIAL IDEALS CRAIG HUNEKE AND BERND ULRICH Abstract. We give a simple algorithm to ecie whether a monomial ieal of nite colength in a polynomial ring is licci, i.e., in the linkage class
More informationThe number of ways to choose r elements (without replacement) from an n-element set is. = r r!(n r)!.
The first exam will be on Friday, September 23, 2011. The syllabus will be sections 0.1 through 0.4 and 0.6 in Nagpaul and Jain, and the corresponding parts of the number theory handout found on the class
More informationLecture notes on Witt vectors
Lecture notes on Witt vectors Lars Hesselholt The purpose of these notes is to give a self-containe introuction to Witt vectors. We cover both the classical p-typical Witt vectors of Teichmüller an Witt
More information. Using a multinomial model gives us the following equation for P d. , with respect to same length term sequences.
S 63 Lecture 8 2/2/26 Lecturer Lillian Lee Scribes Peter Babinski, Davi Lin Basic Language Moeling Approach I. Special ase of LM-base Approach a. Recap of Formulas an Terms b. Fixing θ? c. About that Multinomial
More informationKramers Relation. Douglas H. Laurence. Department of Physical Sciences, Broward College, Davie, FL 33314
Kramers Relation Douglas H. Laurence Department of Physical Sciences, Browar College, Davie, FL 333 Introuction Kramers relation, name after the Dutch physicist Hans Kramers, is a relationship between
More informationStep 1. Analytic Properties of the Riemann zeta function [2 lectures]
Step. Analytic Properties of the Riemann zeta function [2 lectures] The Riemann zeta function is the infinite sum of terms /, n. For each n, the / is a continuous function of s, i.e. lim s s 0 n = s n,
More information3.6. Let s write out the sample space for this random experiment:
STAT 5 3 Let s write out the sample space for this ranom experiment: S = {(, 2), (, 3), (, 4), (, 5), (2, 3), (2, 4), (2, 5), (3, 4), (3, 5), (4, 5)} This sample space assumes the orering of the balls
More information1 Lecture 20: Implicit differentiation
Lecture 20: Implicit ifferentiation. Outline The technique of implicit ifferentiation Tangent lines to a circle Derivatives of inverse functions by implicit ifferentiation Examples.2 Implicit ifferentiation
More informationTutorial 1 Differentiation
Tutorial 1 Differentiation What is Calculus? Calculus 微積分 Differential calculus Differentiation 微分 y lim 0 f f The relation of very small changes of ifferent quantities f f y y Integral calculus Integration
More information