A Sequence of Modular Forms Associated with Higher-Order Derivatives of Weierstrass-Type Functions
|
|
- Lily McKenzie
- 7 years ago
- Views:
Transcription
1 Filomat 30:2 206, DOI /FIL62253A Published by Faculty of Sciences and Mathematics, University of iš, Serbia Available at: A Sequence of Modular Forms Associated with Higher-Order Derivatives of Weierstrass-Type Functions A. Ahmet Aygunes a, Yılmaz Simsek a, H. M. Srivastava b a Department of Mathematics, Faculty of Art and Science, University of Akdeniz, TR Antalya, Turkey b Department of Mathematics and Statistics, University of Victoria, Victoria, British Columbia V8W 3R4, Canada and China Medical University, Taichung 40402, Taiwan, Republic of China Abstract. In this article, we first determine a sequence { f n τ} n of modular forms with weight 2 n k + 42 n n ; k \ {}; := {, 2, 3, }. We then present some applications of this sequence which are related to the Eisenstein series and the cusp forms. We also prove that higher-order derivatives of the Weierstrass type -functions are related to the above-mentioned sequence { f n τ} n of modular forms.. Introduction, Definitions and Preliminaries Throughout this paper, we let := {, 2, 3, } and Z := {0, ±, ±2, }. We also let R and C denote the sets of real and complex numbers, respectively. We shall make use of the following definitions and notations. Let H denotes the right-half complex plane, that is, H := { z : z C and Iz > 0 }. Let z, z 2 C \ {0} with z z 2 R. Then Ω = Ωz, z 2 := {w : w = m z + m 2 z 2 m, m 2 Z} be a lattice in C, z z 2 H and Ω = Ω z, z 2 = Ωz, z 2 \ {0, 0}. 200 Mathematics Subject Classification. Primary B68, M06, 33B5; Secondary 33E99, 65D7 Keywords. Eisenstein series; Modular functions; Modular forms; Cusp forms; Weierstrass -function; Weierstrass type - functions; Laurent series; Mittag-Leffler meromorphic functions. Received: September 204; Accepted: 03 December 204 Communicated by Dragan S. Djordjević addresses: aygunes@akdeniz.edu.tr A. Ahmet Aygunes, ysimsek@akdeniz.edu.tr Yılmaz Simsek, harimsri@math.uvic.ca H. M. Srivastava
2 A. Ahmet Aygunes et al. / Filomat 30:2 206, Then the Weierstrass -function is defined by see, for example,, and 20 u; w = u + 2 u w.. 2 w 2 w Ω ext, if we define the Eisenstein series G2k, w of weight 2k by the series: G2k, w = k \ {},.2 w Ω w 2k the following relation involving Laurent series holds true between the Eisenstein series G2k, w and the Weierstrass -function u; w: u; w = u + 2k + G2k + 2, wu 2k.3 2 k= 0 < u < min{ w : w 0}. In Section 2, we shall find it to be convenient to recall a family of Weierstrass-type functions which were introduced and investigated by Chang et al. see, for details, 3 4; see also 2. The above-defined Weierstrass -function u; w will then turn out to be a special case of the Weierstrass-type functions. aturally, therefore, our aim will be to find a relationship between the r th derivative of the Weierstrasstype functions and the inhomogeneous Eisenstein series G,k,a for fixed a, which was defined by Schoeneberg. As a matter of fact, Simsek 5 already gave a special relation between the k 2th derivative of the Weierstass -function and the inhomogeneous Eisenstein series G,k,a see also 4. In Section 3, we derive a general formula involving functional sequences which consist of modular forms with weight 2 n+ k + 42 n n ; k \ {}. Finally, in Section 4, we consider an interesting special case of the formula derived in Section 4 which involves functional sequences consisting of modular forms with weight 4k + 4. By using this special case, we obtain Fourier series expansions of modular forms with weights 2 and The Derivatives of the Weierstrass-Type Functions Following the earlier investigations by Chang et al. 3 and 4 see also Wu et al. 2, the Weierstrasstype functions are defined by u; w = u + w Ω u w w n. The function u; w is a Mittag-Leffler meromorphic function in the complex u-plane and has poles of the second order at the points of Ω. Recently, Aygunes and Simsek 2 investigated the behavior of the Weierstrass-type functions under the Hecke operators. We now compute the first-, the second- and the third-order derivatives of u; w as follows: u; w = u + w Ω u w, + + u; w = + u +2 + w Ω u w +2
3 and u; w = u +3 A. Ahmet Aygunes et al. / Filomat 30:2 206, w Ω u w +3, respectively. Here, as usual, the rth derivative of u; w with respect to the argument u is denoted by u; w. By induction, we obtain the following theorem. r Theorem. Let n, r \ {}. Then r + r! u; w = r. 2.! +r w Ω u w Let and k be natural numbers with and k 3. Following the notations of Schoeneberg, suppose also that m, a and z are matrices given by where Also let m = m m 2, a = a a 2 and z = m, m 2, a, a 2 Z and z, z 2 C. m T = m m 2, so that, obviously, w = m T z = m m 2 z z 2 z = m z + m 2 z 2. z 2 Thus, as a function of u, the above definition of the Weierstrass-type function u; w can be rewritten as follows: u; w = u + u m T z, m T z where z z 2 H m,m 2 Z Z and the prime * on the above summation sign indicates that the term corresponding to, m T z = 0 is to be omitted. For a fixed a, the homogeneous Eisenstein-type series G,k,a can be defined by G,k,a z = m a m 0 m T z k ; k \ {, 2}, 2.2 where we have used the notation m a in the following sense: m m 2 a a 2 mod
4 A. Ahmet Aygunes et al. / Filomat 30:2 206, or, equivalently, m a mod and m 2 a 2 mod. Schoeneberg, p. 55, Theorem proved that, for natural numbers and k 3, the Eisenstein series G,k,a z defined by 2.2 is an entire modular form of level and weight k. Moreover, the series in 2.2 converges absolutely for all z see, for details,. If, in the equation 2., we replace u by at z with 0 a 0 0 :=, 0 then we find that r a T z ; w r + r! =! Hence we have r a T z ; w m,m 2 Z Z = r +r + r!! m,m 2 Z Z a z +a 2 z 2 m z + m 2 z 2. +r a + m z + a 2 + m 2 z 2 +r. The prime * on each of the above the above summation signs indicates that the term corresponding to is to be omitted. By setting l = a + m and l 2 = a 2 + m 2 a + m z + a 2 + m 2 z 2 = 0 in the above equation, we get r a T z ; w = r +r + r!! w, +r w Ω which readily yields r a T z ; w = r +r + r!! where, for convenience, L := l l 2 L a and L T = l l 2. We are thus led to the following theorem. Theorem 2. Let n, r \ {}. If L T z +r, then u = at z and a 0, r a T z ; w = r +r + r! G,+r,a z + r \ {, 2}. 2.3!
5 A. Ahmet Aygunes et al. / Filomat 30:2 206, Remark. If we take n = in the assertion 2.3 of Theorem 2, then we arrive at the following result cf., p. 57, Eq. 6; see also 5: a r T z ; w = r r +! r+2 G,r+2,a z. 3. The Set of Main Theorems By using the derivative of modular forms, it is possible to obtain several useful formulas which can then be applied in order to derive various other modular forms. In recent years, many authors have investigated and studied this subject-area see, for example, 7, 0 and 6. In particular, Koblitz 7 gave a formula which leads to the modular form of weight k + 2 for the following modular group: Γ = SL 2 Z as asserted by Theorem 3 below see 7 and 6. Theorem 3. Let f z be a modular form of weight k for the modular group If Γ = SL 2 Z. hz = 2πi d dz { f z} k 2 E 2z f z, then hz is a modular form of weight k + 2 for the modular group Γ, where E 2 z is an Eisenstein series. Rankin 0 proved the following result. Theorem 4. cf. 0, p. 4, Theorem 3 For an even integer k \ {}, k + 3 G k+2 τ = 2 d k + dτ {G kτ} + 2 k 2 k G 2v τg k+2 2v τ. 2v Remark 2. For even integer k 6, we get cf. and 0 k + 3 k 4 G k+2 τ = 2kk v= k 2 2 k 2 G 2v+2 τg k 2v τ, 3. 2v v= which can indeed be proven by means of the differential equation satisfied by the Weierstrass -function see, for details, and 0. Theorem 5. cf. 0, p. 4, Theorem 3 If the integer k is even and greater than 2, then G k + k τ + 4G 2τG k τ 2kG 2 τg kτ = 3 G k 2 τ + 2 <v< k 2 k 2v G 2v 2 τg k 2v+2τ 0<v< k 2 k G 2v 2v τg k 2v τ.
6 A. Ahmet Aygunes et al. / Filomat 30:2 206, Rankin s form of the normalized Eisenstein series can be written as follows see 0: G k τ = B k 2k E kτ k, 3.2 where B k denotes the Bernoulli number of order k see, for details, 9; see also the recent investigations 7 and 8. It is easily seen from 3.2 that E 2k τ = 2 k 2π 2k 2k! 2ζ2k G 2kτ k 3.3 in terms of the Riemann zeta function ζs given by see, for details, 9 n = Rs > s 2 s s and ζs := n= 2 s n= n= n n s Rs > 0; s k+ 2π 2k ζ2k = B 2k k k! It should be remarked in passing that the factor 2 k 2π 2k 2k! is dropped from the right-hand side of 3.3 in the normalization of the Eisenstein series used by many authors including for example Apostol, Eichler and Zagier 6, Koblitz 7 and Silverman 3. In this section, we need the following definitions and theorems which will be used to prove Theorem 6. Our Theorem 6 provides us with a general formula answering a question of Silverman 3, p. 90, Exercise.20 a. Definition. see 3, p. 24 Let k Z and let f τ be a function defined on H. We say that f is weakly modular of weight 2k for Γ if the following two conditions are satisfied: i The function f τ is meromorphic on H; ii The function f τ is such that f Aτ = 2k f τ, where a b A = c d Γ, τ H and Aτ =. Definition 2. see 3, p. 24 A weakly modular function that is meromorphic at is called a modular function. Furthermore, a modular function which is everywhere holomorphic on H including also at is called a modular form. If, in addition, f = 0, then the function f is called a cusp form. Remark 3. According to the work of Silverman 3, p. 24, Remark 3.3, one can see that f τ + = f τ and f = τ 2k f τ. τ
7 A. Ahmet Aygunes et al. / Filomat 30:2 206, Therefore, f is a function of q := e 2πiτ. This function f is meromorphic in { q : 0 < q < } and f has the following Fourier expansion: a n q n. n= Remark 4. If the function f is meromorphic at, then it has the following Fourier expansion: n= n 0 a n q n, where n 0 is a positive integer. If the function f is holomorphic at, then it has the following Fourier expansion: a n q n. n=0 In this section, we are interested in addressing the following question which is raised in the book of Silverman 3, p. 90, Exercise.20 a: Let f τ be a modular form of weight 2k. The prove that d { f 2 τ = 2k + f τ } 2 2k f τ d2 dτ dτ { f τ} is a modular form of weight 4k + 4. Motivated essentially by Silverman s question 3.5, we give our main result in this section, which is stated as Theorem 6 below. For some closely-related earlier works on this subject, the interested reader may be referred to the works by for example Cohen 5 and Rankin 8 and 9. Indeed, by suitably specializing Theorem 6 below, we deduce a number of interesting consequences including 3.2. We also give some examples and corollaries related to Theorem 6. The main theorem of our present investigation can now be stated as follows. Theorem 6. Let n and τ H. Suppose also that f τ be a modular form with weight 2k. Then the sequence fn τ n of modular forms satisfies the following recurrence relation: where f n+ τ = 2 n k + 42 n + f n τ 2 2 n k + 42 n f n τ f n τ, f nτ = d dτ { fn τ } and f n τ = d2 dτ 2 { fn τ }. Proof. Since f n τ is a modular form with weight 2 n k + 42 n n, we have f n = k+42 n f n τ.
8 A. Ahmet Aygunes et al. / Filomat 30:2 206, We now compute the derivative of each member of this last equation with respect to τ to prove that f n+ τ is a modular forms with the following weight: 2 n+ k + 42 n. We thus find that { } d f n dτ = a c 2 f n and { } d f n = 2 n k + 42 n c k+42 n f n τ dτ + k+42 n f nτ. ext, since ad bc =, we have f n = 2 n k + 42 n c k+42 n + f n τ On the other hand, we easily see that { } d 2 2c f dτ 2 n = f 3 n We thus obtain { } d 2 f dτ 2 n or, equivalently, + k+42 n +2 f nτ f 4 n. = 2 n k + 42 n 2 n k + 42 n c 2 k+42 n 2 f n τ 2c f n + 2c 2 n k + 42 n k+42 n f nτ + k+42 n f n τ. + f n = 2 n k + 42 n 2 n k + 42 n c 2 k+42 n +2 f n τ By using 3.6, we have f n + 2c 2 n k + 42 n k+42 n +3 f nτ + k+42 n +4 f n τ. = 2 n k + 42 n 2 n k + 42 n + c 2 k+42 n +2 f n τ + 2c 2 n k + 42 n + k+42 n +3 f nτ + k+42 n +4 f n τ. 3.7
9 Moreover, by using 3.6 and 3.7, we get 2 n k + 42 n + f n A. Ahmet Aygunes et al. / Filomat 30:2 206, = 2 n k + 42 n + { 2 n k + 42 n 2 c 2 + k+82 n +2 f n τ 2 + 2c 2 n k + 42 n + k+82 n +3 f n τ f nτ + + k+82 n +4 f nτ 2 } 3.8 and 2 n k + 42 n f n f n = 2 n k + 42 n { 2 n k + 42 n 2 n k + 42 n + c 2 + k+82 n +2 f n τ 2 + 2c 2 n k + 42 n + + k+82 n +3 f n τ f nτ + + k+82 n +4 f n τ f n τ }. 3.9 Consequently, by applying these last results 3.6 to 3.9, we arrive at the desired assertion given by f n+ = + k+82 n +4 { 2 n k + 42 n + f n τ 2 2 n k + 42 n f n τ f n τ } = + k+42 n f n+ τ. Remark 5. By replacing n by n + in the weight of the modular form f n τ in Theorem 6, we readily see that the modular form f n+ τ has the following weight: 2 n+ k + 42 n. 4. Applications of Theorem 6 Theorem 6 can be shown to have many applications in the theory of the elliptic modular forms. Here we give a few applications related to Theorem 6. Upon setting n = in Theorem 6, we get the following corollary, which was given by Silverman 3, p. 90 and more recently also by Sebbar and Sebbar 2, p Corollary. Let f τ be a modular form with weight 2k. Then f 2 τ defined by d f 2 τ = 2k + dτ is a modular form with weight 4k + 4. Remark 6. If we put f τ = E 4 τ in 4., we have { } 2 f τ 2k f τ d2 { f τ} 4. dτ2 f 2 τ = 5 d dτ {E 4τ} 2 4E 4 τ d2 dτ 2 {E 4τ}. 4.2
10 and A. Ahmet Aygunes et al. / Filomat 30:2 206, ext, by substituting the following well-known derivative formulas for E 4 τ cf. 6, 0 and 2 : d dτ {E 4τ} = 2πi 3 E 2τE 4 τ E 6 τ d 2 dτ {E 4τ} = 5π2 {E2 τ} 2 E 2 4 τ + {E 4 τ} 2 2E 2 τe 6 τ 9 into the equation 4.2, one can easily see that f 2 τ is a cusp form for the function f τ given by f τ = G 4 τ, that is, we have cf. 3, p. 90, Exercise.20 c and 2 f 2 τ = τ π 2. Similarly, if f 2 τ is a cusp form for the function f τ given by f τ = E 4 τ, then we can readily find that cf. 3, p. 90, Exercise.20 c and 2 f 2 τ = 5π τ. Thus, if f τ is a modular form, then f 2 τ is a cusp form cf. 3, p. 90, Exercise.20 b. If we set f τ = E 6 τ in the equation 4., we have d 2 f 2 τ = 7 dτ {E 6τ} 6E 6 τ d2 dτ {E 6τ} By substituting the following well-known derivative formulas for E 6 τ cf. 6, 0 and 2: d dτ {E 6τ} = πi E 2 τe 6 τ {E 4 τ} 2 and cf. 6 d 2 dτ {E 6τ} = 7π2 {E2 τ} 2 E 2 6 τ + E 4 τe 6 τ 2E 2 τ {E 4 τ} 2 6 into the equation 4.3, we arrive at the following results. Corollary 2. It is asserted that f 2 τ = 7π 2 {E 6 τ} 2 E 4 τ {E 4 τ} 4. Corollary 3. Let n, r and k \ {, 2}. Suppose also that If a 0 and \ {}. 2m + r = 2 n k + 42 n, then the sequence { r 2m } a T z ; w, m which is a modular form with weight 2m + r, satisfies Theorem 6.
11 A. Ahmet Aygunes et al. / Filomat 30:2 206, Acknowledgements The present investigation was supported by the Research Fund of the University of Akdeniz in Antalya Turkey. References T. M. Apostol, Modular Functions and Dirichlet Series in umber Theory, Second Edition, Springer-Verlag, Berlin, Heidelberg and ew York, A. A. Aygunes and Y. Simsek, The action of Hecke operators to families of Weierstrass-type functions and Weber-type functions and their applications, Appl. Math. Comput , C.-H. Chang and H. M. Srivastava, A note on Bernoulli identities associated with the Weierstrass -function, Integral Transforms Spec. Funct , C.-H. Chang, H. M. Srivastava and T.-C. Wu, Some families of Weierstrass-type functions and their applications, Integral Transforms Spec. Funct , H. Cohen, Sums involving the values at negative integers of L-functions of quadratic characters, Math. Ann , M. Eichler and D. Zagier, On the zeros of the Weierstrass -function, Math. Ann , I. Koblitz, Introduction to Elliptic Curves and Modular Forms, Graduate Texts in Mathematics, Springer-Verlag, Berlin, Heidelberg and ew York, R. A. Rankin, The construction of automorphic forms from the derivatives of a given form, J. Indian Math. Soc. ew Ser , R. A. Rankin, The construction of automorphic forms from the derivatives of given forms, Michigan Math. J , R. A. Rankin, Elementary proofs of relations between Eisenstein series, Proc. Royal Soc. Edinburgh Sect. A , B. Schoeneberg, Elliptic Modular Forms: An Introduction, Springer-Verlag, Berlin, Heidelberg and ew York, A. Sebbar and A. Sebbar, Eisenstein series and modular differential equations, Canad. Math. Bull , J. H. Silverman, Advanced Topics in the Arithmetic of Elliptic Curves, Graduate Texts in Mathematics, Springer-Verlag, Berlin, Heidelberg and ew York, Y. Simsek, Relations between theta-functions Hardy sums Eisenstein series and Lambert series in the transformation formula of log η,h z, J. umber Theory , Y. Simsek, On Weierstrass z-function, Hardy sums and Eisenstein series, Proc. Jangjeon Math. Soc , Y. Simsek, On normalized Eisenstein series and new theta functions, Proc. Jangjeon Math. Soc , H. M. Srivastava, Some generalizations and basic or q- extensions of the Bernoulli, Euler and Genocchi polynomials, Appl. Math. Inform. Sci. 5 20, H. M. Srivastava, Generating relations and other results associated with some families of the extended Hurwitz-Lerch Zeta functions, SpringerPlus 2 203, Article ID 2:67, 4. 9 H. M. Srivastava and J. Choi, Zeta and q-zeta Functions and Associated Series and Integrals, Elsevier Science Publishers, Amsterdam, London and ew York, E. T. Whittaker and G.. Watson, A Course of Modern Analysis: An Introduction to the General Theory of Infinite Processes and of Analytic Functions; with an Account of the Principal Transcendental Functions, Fourth Edition Reprinted, Cambridge University Press, Cambridge, London and ew York, T.-C. Wu, C.-H. Chang and H. M. Srivastava, A unified presentation of identities involving Weierstrass-type functions, Appl. Math. Lett ,
Sign changes of Hecke eigenvalues of Siegel cusp forms of degree 2
Sign changes of Hecke eigenvalues of Siegel cusp forms of degree 2 Ameya Pitale, Ralf Schmidt 2 Abstract Let µ(n), n > 0, be the sequence of Hecke eigenvalues of a cuspidal Siegel eigenform F of degree
More informationContinued Fractions. Darren C. Collins
Continued Fractions Darren C Collins Abstract In this paper, we discuss continued fractions First, we discuss the definition and notation Second, we discuss the development of the subject throughout history
More informationFACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z
FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z DANIEL BIRMAJER, JUAN B GIL, AND MICHAEL WEINER Abstract We consider polynomials with integer coefficients and discuss their factorization
More informationThe sum of digits of polynomial values in arithmetic progressions
The sum of digits of polynomial values in arithmetic progressions Thomas Stoll Institut de Mathématiques de Luminy, Université de la Méditerranée, 13288 Marseille Cedex 9, France E-mail: stoll@iml.univ-mrs.fr
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationA simple criterion on degree sequences of graphs
Discrete Applied Mathematics 156 (2008) 3513 3517 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Note A simple criterion on degree
More informationInternational Journal of Information Technology, Modeling and Computing (IJITMC) Vol.1, No.3,August 2013
FACTORING CRYPTOSYSTEM MODULI WHEN THE CO-FACTORS DIFFERENCE IS BOUNDED Omar Akchiche 1 and Omar Khadir 2 1,2 Laboratory of Mathematics, Cryptography and Mechanics, Fstm, University of Hassan II Mohammedia-Casablanca,
More informationk, then n = p2α 1 1 pα k
Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square
More informationOn Generalized Fermat Numbers 3 2n +1
Applied Mathematics & Information Sciences 4(3) (010), 307 313 An International Journal c 010 Dixie W Publishing Corporation, U. S. A. On Generalized Fermat Numbers 3 n +1 Amin Witno Department of Basic
More informationMATH10040 Chapter 2: Prime and relatively prime numbers
MATH10040 Chapter 2: Prime and relatively prime numbers Recall the basic definition: 1. Prime numbers Definition 1.1. Recall that a positive integer is said to be prime if it has precisely two positive
More informationDoug Ravenel. October 15, 2008
Doug Ravenel University of Rochester October 15, 2008 s about Euclid s Some s about primes that every mathematician should know (Euclid, 300 BC) There are infinitely numbers. is very elementary, and we
More information8 Primes and Modular Arithmetic
8 Primes and Modular Arithmetic 8.1 Primes and Factors Over two millennia ago already, people all over the world were considering the properties of numbers. One of the simplest concepts is prime numbers.
More informationEvery Positive Integer is the Sum of Four Squares! (and other exciting problems)
Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Sophex University of Texas at Austin October 18th, 00 Matilde N. Lalín 1. Lagrange s Theorem Theorem 1 Every positive integer
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationCounting Primes whose Sum of Digits is Prime
2 3 47 6 23 Journal of Integer Sequences, Vol. 5 (202), Article 2.2.2 Counting Primes whose Sum of Digits is Prime Glyn Harman Department of Mathematics Royal Holloway, University of London Egham Surrey
More informationCONTRIBUTIONS TO ZERO SUM PROBLEMS
CONTRIBUTIONS TO ZERO SUM PROBLEMS S. D. ADHIKARI, Y. G. CHEN, J. B. FRIEDLANDER, S. V. KONYAGIN AND F. PAPPALARDI Abstract. A prototype of zero sum theorems, the well known theorem of Erdős, Ginzburg
More informationF. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)
Journal of Algerian Mathematical Society Vol. 1, pp. 1 6 1 CONCERNING THE l p -CONJECTURE FOR DISCRETE SEMIGROUPS F. ABTAHI and M. ZARRIN (Communicated by J. Goldstein) Abstract. For 2 < p
More information9.2 Summation Notation
9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a
More informationAlex, I will take congruent numbers for one million dollars please
Alex, I will take congruent numbers for one million dollars please Jim L. Brown The Ohio State University Columbus, OH 4310 jimlb@math.ohio-state.edu One of the most alluring aspectives of number theory
More informationInteger roots of quadratic and cubic polynomials with integer coefficients
Integer roots of quadratic and cubic polynomials with integer coefficients Konstantine Zelator Mathematics, Computer Science and Statistics 212 Ben Franklin Hall Bloomsburg University 400 East Second Street
More informationMATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform
MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
More informationMath 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Spring 2012 Homework # 9, due Wednesday, April 11 8.1.5 How many ways are there to pay a bill of 17 pesos using a currency with coins of values of 1 peso, 2 pesos,
More informationMath 115 Spring 2011 Written Homework 5 Solutions
. Evaluate each series. a) 4 7 0... 55 Math 5 Spring 0 Written Homework 5 Solutions Solution: We note that the associated sequence, 4, 7, 0,..., 55 appears to be an arithmetic sequence. If the sequence
More informationPRIME FACTORS OF CONSECUTIVE INTEGERS
PRIME FACTORS OF CONSECUTIVE INTEGERS MARK BAUER AND MICHAEL A. BENNETT Abstract. This note contains a new algorithm for computing a function f(k) introduced by Erdős to measure the minimal gap size in
More informationCOMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS
Bull Austral Math Soc 77 (2008), 31 36 doi: 101017/S0004972708000038 COMMUTATIVITY DEGREES OF WREATH PRODUCTS OF FINITE ABELIAN GROUPS IGOR V EROVENKO and B SURY (Received 12 April 2007) Abstract We compute
More informationMath 55: Discrete Mathematics
Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What
More informationSUM OF TWO SQUARES JAHNAVI BHASKAR
SUM OF TWO SQUARES JAHNAVI BHASKAR Abstract. I will investigate which numbers can be written as the sum of two squares and in how many ways, providing enough basic number theory so even the unacquainted
More information8 Divisibility and prime numbers
8 Divisibility and prime numbers 8.1 Divisibility In this short section we extend the concept of a multiple from the natural numbers to the integers. We also summarize several other terms that express
More informationNotes on Determinant
ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without
More informationPYTHAGOREAN TRIPLES KEITH CONRAD
PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient
More informationON FIBONACCI NUMBERS WITH FEW PRIME DIVISORS
ON FIBONACCI NUMBERS WITH FEW PRIME DIVISORS YANN BUGEAUD, FLORIAN LUCA, MAURICE MIGNOTTE, SAMIR SIKSEK Abstract If n is a positive integer, write F n for the nth Fibonacci number, and ω(n) for the number
More informationTHE BIRCH AND SWINNERTON-DYER CONJECTURE
THE BIRCH AND SWINNERTON-DYER CONJECTURE ANDREW WILES A polynomial relation f(x, y) = 0 in two variables defines a curve C 0. If the coefficients of the polynomial are rational numbers, then one can ask
More informationJacobi s four squares identity Martin Klazar
Jacobi s four squares identity Martin Klazar (lecture on the 7-th PhD conference) Ostrava, September 10, 013 C. Jacobi [] in 189 proved that for any integer n 1, r (n) = #{(x 1, x, x 3, x ) Z ( i=1 x i
More informationSample Induction Proofs
Math 3 Worksheet: Induction Proofs III, Sample Proofs A.J. Hildebrand Sample Induction Proofs Below are model solutions to some of the practice problems on the induction worksheets. The solutions given
More information3. Mathematical Induction
3. MATHEMATICAL INDUCTION 83 3. Mathematical Induction 3.1. First Principle of Mathematical Induction. Let P (n) be a predicate with domain of discourse (over) the natural numbers N = {0, 1,,...}. If (1)
More informationOn the largest prime factor of x 2 1
On the largest prime factor of x 2 1 Florian Luca and Filip Najman Abstract In this paper, we find all integers x such that x 2 1 has only prime factors smaller than 100. This gives some interesting numerical
More informationMOP 2007 Black Group Integer Polynomials Yufei Zhao. Integer Polynomials. June 29, 2007 Yufei Zhao yufeiz@mit.edu
Integer Polynomials June 9, 007 Yufei Zhao yufeiz@mit.edu We will use Z[x] to denote the ring of polynomials with integer coefficients. We begin by summarizing some of the common approaches used in dealing
More informationFive fundamental operations. mathematics: addition, subtraction, multiplication, division, and modular forms
The five fundamental operations of mathematics: addition, subtraction, multiplication, division, and modular forms UC Berkeley Trinity University March 31, 2008 This talk is about counting, and it s about
More information6. Define log(z) so that π < I log(z) π. Discuss the identities e log(z) = z and log(e w ) = w.
hapter omplex integration. omplex number quiz. Simplify 3+4i. 2. Simplify 3+4i. 3. Find the cube roots of. 4. Here are some identities for complex conjugate. Which ones need correction? z + w = z + w,
More informationSECTION 10-2 Mathematical Induction
73 0 Sequences and Series 6. Approximate e 0. using the first five terms of the series. Compare this approximation with your calculator evaluation of e 0.. 6. Approximate e 0.5 using the first five terms
More informationTaylor and Maclaurin Series
Taylor and Maclaurin Series In the preceding section we were able to find power series representations for a certain restricted class of functions. Here we investigate more general problems: Which functions
More informationRIGIDITY OF HOLOMORPHIC MAPS BETWEEN FIBER SPACES
RIGIDITY OF HOLOMORPHIC MAPS BETWEEN FIBER SPACES GAUTAM BHARALI AND INDRANIL BISWAS Abstract. In the study of holomorphic maps, the term rigidity refers to certain types of results that give us very specific
More informationAlgebraic and Transcendental Numbers
Pondicherry University July 2000 Algebraic and Transcendental Numbers Stéphane Fischler This text is meant to be an introduction to algebraic and transcendental numbers. For a detailed (though elementary)
More informationIRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction
IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL R. DRNOVŠEK, T. KOŠIR Dedicated to Prof. Heydar Radjavi on the occasion of his seventieth birthday. Abstract. Let S be an irreducible
More informationAbout the Gamma Function
About the Gamma Function Notes for Honors Calculus II, Originally Prepared in Spring 995 Basic Facts about the Gamma Function The Gamma function is defined by the improper integral Γ) = The integral is
More informationMathematical Induction
Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,
More informationHOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!
Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following
More information5.3 The Cross Product in R 3
53 The Cross Product in R 3 Definition 531 Let u = [u 1, u 2, u 3 ] and v = [v 1, v 2, v 3 ] Then the vector given by [u 2 v 3 u 3 v 2, u 3 v 1 u 1 v 3, u 1 v 2 u 2 v 1 ] is called the cross product (or
More informationRow Ideals and Fibers of Morphisms
Michigan Math. J. 57 (2008) Row Ideals and Fibers of Morphisms David Eisenbud & Bernd Ulrich Affectionately dedicated to Mel Hochster, who has been an inspiration to us for many years, on the occasion
More informationWinter Camp 2011 Polynomials Alexander Remorov. Polynomials. Alexander Remorov alexanderrem@gmail.com
Polynomials Alexander Remorov alexanderrem@gmail.com Warm-up Problem 1: Let f(x) be a quadratic polynomial. Prove that there exist quadratic polynomials g(x) and h(x) such that f(x)f(x + 1) = g(h(x)).
More informationSettling a Question about Pythagorean Triples
Settling a Question about Pythagorean Triples TOM VERHOEFF Department of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, The Netherlands E-Mail address:
More informationby Ben Brubaker, Solomon Friedberg, and Jeffrey Hoffstein Stanford University Boston College Brown University
CUBIC TWISTS OF GL(2) AUTOMORPHIC L-FUNCTIONS by Ben Brubaker, Solomon Friedberg, and Jeffrey Hoffstein Stanford University Boston College Brown University Draft, November 5, 2003 Abstract. Let K = Q(
More informationOn the number-theoretic functions ν(n) and Ω(n)
ACTA ARITHMETICA LXXVIII.1 (1996) On the number-theoretic functions ν(n) and Ω(n) by Jiahai Kan (Nanjing) 1. Introduction. Let d(n) denote the divisor function, ν(n) the number of distinct prime factors,
More information2 Primality and Compositeness Tests
Int. J. Contemp. Math. Sciences, Vol. 3, 2008, no. 33, 1635-1642 On Factoring R. A. Mollin Department of Mathematics and Statistics University of Calgary, Calgary, Alberta, Canada, T2N 1N4 http://www.math.ucalgary.ca/
More informationShort Programs for functions on Curves
Short Programs for functions on Curves Victor S. Miller Exploratory Computer Science IBM, Thomas J. Watson Research Center Yorktown Heights, NY 10598 May 6, 1986 Abstract The problem of deducing a function
More informationSection 4.2: The Division Algorithm and Greatest Common Divisors
Section 4.2: The Division Algorithm and Greatest Common Divisors The Division Algorithm The Division Algorithm is merely long division restated as an equation. For example, the division 29 r. 20 32 948
More informationLOW-DEGREE PLANAR MONOMIALS IN CHARACTERISTIC TWO
LOW-DEGREE PLANAR MONOMIALS IN CHARACTERISTIC TWO PETER MÜLLER AND MICHAEL E. ZIEVE Abstract. Planar functions over finite fields give rise to finite projective planes and other combinatorial objects.
More informationRow Echelon Form and Reduced Row Echelon Form
These notes closely follow the presentation of the material given in David C Lay s textbook Linear Algebra and its Applications (3rd edition) These notes are intended primarily for in-class presentation
More informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More informationANALYTIC NUMBER THEORY LECTURE NOTES BASED ON DAVENPORT S BOOK
ANALYTIC NUMBER THEORY LECTURE NOTES BASED ON DAVENPORT S BOOK ANDREAS STRÖMBERGSSON These lecture notes follow to a large extent Davenport s book [5], but with things reordered and often expanded. The
More informationLecture 13 - Basic Number Theory.
Lecture 13 - Basic Number Theory. Boaz Barak March 22, 2010 Divisibility and primes Unless mentioned otherwise throughout this lecture all numbers are non-negative integers. We say that A divides B, denoted
More informationIntroduction. Appendix D Mathematical Induction D1
Appendix D Mathematical Induction D D Mathematical Induction Use mathematical induction to prove a formula. Find a sum of powers of integers. Find a formula for a finite sum. Use finite differences to
More informationON THE COEFFICIENTS OF THE LINKING POLYNOMIAL
ADSS, Volume 3, Number 3, 2013, Pages 45-56 2013 Aditi International ON THE COEFFICIENTS OF THE LINKING POLYNOMIAL KOKO KALAMBAY KAYIBI Abstract Let i j T( M; = tijx y be the Tutte polynomial of the matroid
More informationChapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.
Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm. We begin by defining the ring of polynomials with coefficients in a ring R. After some preliminary results, we specialize
More informationFINITE DIMENSIONAL ORDERED VECTOR SPACES WITH RIESZ INTERPOLATION AND EFFROS-SHEN S UNIMODULARITY CONJECTURE AARON TIKUISIS
FINITE DIMENSIONAL ORDERED VECTOR SPACES WITH RIESZ INTERPOLATION AND EFFROS-SHEN S UNIMODULARITY CONJECTURE AARON TIKUISIS Abstract. It is shown that, for any field F R, any ordered vector space structure
More informationThe Mean Value Theorem
The Mean Value Theorem THEOREM (The Extreme Value Theorem): If f is continuous on a closed interval [a, b], then f attains an absolute maximum value f(c) and an absolute minimum value f(d) at some numbers
More informationCHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY
January 10, 2010 CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY The set of polynomials over a field F is a ring, whose structure shares with the ring of integers many characteristics.
More informationThe Characteristic Polynomial
Physics 116A Winter 2011 The Characteristic Polynomial 1 Coefficients of the characteristic polynomial Consider the eigenvalue problem for an n n matrix A, A v = λ v, v 0 (1) The solution to this problem
More informationU.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra
U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory
More informationThe Space of Binary Theta Series
The Space of Binary Theta Series 1 Introduction Ernst Kani The purpose of this paper is to study the space Θ D generated by the binary theta series ϑ f attached to the primitive, positive-definite binary
More informationIn memory of Lars Hörmander
ON HÖRMANDER S SOLUTION OF THE -EQUATION. I HAAKAN HEDENMALM ABSTRAT. We explain how Hörmander s classical solution of the -equation in the plane with a weight which permits growth near infinity carries
More informationPROPERTIES OF ELLIPTIC CURVES AND THEIR USE IN FACTORING LARGE NUMBERS
PROPERTIES OF ELLIPTIC CURVES AND THEIR USE IN FACTORING LARGE NUMBERS A ver important set of curves which has received considerabl attention in recent ears in connection with the factoring of large numbers
More informationFactoring Polynomials
Factoring Polynomials Sue Geller June 19, 2006 Factoring polynomials over the rational numbers, real numbers, and complex numbers has long been a standard topic of high school algebra. With the advent
More information88 CHAPTER 2. VECTOR FUNCTIONS. . First, we need to compute T (s). a By definition, r (s) T (s) = 1 a sin s a. sin s a, cos s a
88 CHAPTER. VECTOR FUNCTIONS.4 Curvature.4.1 Definitions and Examples The notion of curvature measures how sharply a curve bends. We would expect the curvature to be 0 for a straight line, to be very small
More informationProbability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur
Probability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur Module No. #01 Lecture No. #15 Special Distributions-VI Today, I am going to introduce
More informationStanford Math Circle: Sunday, May 9, 2010 Square-Triangular Numbers, Pell s Equation, and Continued Fractions
Stanford Math Circle: Sunday, May 9, 00 Square-Triangular Numbers, Pell s Equation, and Continued Fractions Recall that triangular numbers are numbers of the form T m = numbers that can be arranged in
More informationCONTENTS 1. Peter Kahn. Spring 2007
CONTENTS 1 MATH 304: CONSTRUCTING THE REAL NUMBERS Peter Kahn Spring 2007 Contents 2 The Integers 1 2.1 The basic construction.......................... 1 2.2 Adding integers..............................
More informationWHEN DOES A CROSS PRODUCT ON R n EXIST?
WHEN DOES A CROSS PRODUCT ON R n EXIST? PETER F. MCLOUGHLIN It is probably safe to say that just about everyone reading this article is familiar with the cross product and the dot product. However, what
More informationELLIPTIC CURVES AND LENSTRA S FACTORIZATION ALGORITHM
ELLIPTIC CURVES AND LENSTRA S FACTORIZATION ALGORITHM DANIEL PARKER Abstract. This paper provides a foundation for understanding Lenstra s Elliptic Curve Algorithm for factoring large numbers. We give
More informationMath 319 Problem Set #3 Solution 21 February 2002
Math 319 Problem Set #3 Solution 21 February 2002 1. ( 2.1, problem 15) Find integers a 1, a 2, a 3, a 4, a 5 such that every integer x satisfies at least one of the congruences x a 1 (mod 2), x a 2 (mod
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationStupid Divisibility Tricks
Stupid Divisibility Tricks 101 Ways to Stupefy Your Friends Appeared in Math Horizons November, 2006 Marc Renault Shippensburg University Mathematics Department 1871 Old Main Road Shippensburg, PA 17013
More informationCONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12
CONTINUED FRACTIONS AND PELL S EQUATION SEUNG HYUN YANG Abstract. In this REU paper, I will use some important characteristics of continued fractions to give the complete set of solutions to Pell s equation.
More informationFurther Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1
Further Study on Strong Lagrangian Duality Property for Invex Programs via Penalty Functions 1 J. Zhang Institute of Applied Mathematics, Chongqing University of Posts and Telecommunications, Chongqing
More informationON HENSEL S ROOTS AND A FACTORIZATION FORMULA IN Z[[X]]
#A47 INTEGERS 4 (204) ON HENSEL S ROOTS AND A FACTORIZATION FORMULA IN Z[[X]] Daniel Birmaer Department of Mathematics, Nazareth College, Rochester, New Yor abirma6@naz.edu Juan B. Gil Penn State Altoona,
More informationThe Relation between Two Present Value Formulae
James Ciecka, Gary Skoog, and Gerald Martin. 009. The Relation between Two Present Value Formulae. Journal of Legal Economics 15(): pp. 61-74. The Relation between Two Present Value Formulae James E. Ciecka,
More informationPrime Numbers and Irreducible Polynomials
Prime Numbers and Irreducible Polynomials M. Ram Murty The similarity between prime numbers and irreducible polynomials has been a dominant theme in the development of number theory and algebraic geometry.
More informationMATH 289 PROBLEM SET 4: NUMBER THEORY
MATH 289 PROBLEM SET 4: NUMBER THEORY 1. The greatest common divisor If d and n are integers, then we say that d divides n if and only if there exists an integer q such that n = qd. Notice that if d divides
More informationRESULTANT AND DISCRIMINANT OF POLYNOMIALS
RESULTANT AND DISCRIMINANT OF POLYNOMIALS SVANTE JANSON Abstract. This is a collection of classical results about resultants and discriminants for polynomials, compiled mainly for my own use. All results
More informationOn one-factorizations of replacement products
Filomat 27:1 (2013), 57 63 DOI 10.2298/FIL1301057A Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat On one-factorizations of replacement
More informationIncreasing for all. Convex for all. ( ) Increasing for all (remember that the log function is only defined for ). ( ) Concave for all.
1. Differentiation The first derivative of a function measures by how much changes in reaction to an infinitesimal shift in its argument. The largest the derivative (in absolute value), the faster is evolving.
More informationNote on some explicit formulae for twin prime counting function
Notes on Number Theory and Discrete Mathematics Vol. 9, 03, No., 43 48 Note on some explicit formulae for twin prime counting function Mladen Vassilev-Missana 5 V. Hugo Str., 4 Sofia, Bulgaria e-mail:
More informationBasic Proof Techniques
Basic Proof Techniques David Ferry dsf43@truman.edu September 13, 010 1 Four Fundamental Proof Techniques When one wishes to prove the statement P Q there are four fundamental approaches. This document
More informationSOME PROPERTIES OF SYMBOL ALGEBRAS OF DEGREE THREE
SOME PROPERTIES OF SYMBOL ALGEBRAS OF DEGREE THREE CRISTINA FLAUT and DIANA SAVIN Communicated by the former editorial board In this paper, we study some properties of the matrix representations of the
More informationOn Chebyshev interpolation of analytic functions
On Chebyshev interpolation of analytic functions Laurent Demanet Department of Mathematics Massachusetts Institute of Technology Lexing Ying Department of Mathematics University of Texas at Austin March
More information5 Numerical Differentiation
D. Levy 5 Numerical Differentiation 5. Basic Concepts This chapter deals with numerical approximations of derivatives. The first questions that comes up to mind is: why do we need to approximate derivatives
More information4)(x) du(x) = n-' E?(zi(x)) du(x),
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 98, Number 1, September 1986 ORTHOGONALITY AND THE HAUSDORFF DIMENSION OF THE MAXIMAL MEASURE ARTUR OSCAR LOPES ABSTRACT. In this paper the orthogonality
More informationSHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH
31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,
More information1 Sets and Set Notation.
LINEAR ALGEBRA MATH 27.6 SPRING 23 (COHEN) LECTURE NOTES Sets and Set Notation. Definition (Naive Definition of a Set). A set is any collection of objects, called the elements of that set. We will most
More information