DOCSLIB.ORG

PHD THESIS a Class of Equivalent Problems Related to the Riemann

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
PHD THESIS a Class of Equivalent Problems Related to the Riemann PHDTHESIS Sadegh Nazardonyavi A Class of Equivalent Problems Related to the Riemann Hypothesis Tese submetida `aFaculdade de Ci^enciasda Universidade do Porto para obten¸c~ao do grau de Doutor em Matem´atica Departamento de Matem´atica Faculdade de Ci^enciasda Universidade do Porto 2013 To My Parents Acknowledgments I would like to thank my supervisor Prof. Semyon Yakubovich for all the guidance and support he provided for me during my studies at the University of Porto. I would also like to thank Professors: Bagher Nashvadian-Bakhsh, Abdolhamid Ri- azi, Abdolrasoul Pourabbas, Jos´eFerreira Alves for their teaching and supporting me in academic stuffs. Also I would like to thank Professors: Ana Paula Dias, Jos´eMiguel Urbano, Marc Baboulin, Jos´ePeter Gothen and Augusto Ferreira for the nice courses I had with them. I thank Professors J. C. Lagarias, C. Calderon, J. Stopple, and M. Wolf for useful discussions and sending us some relevant references. My sincere thanks to Profes- sor Jean-Louis Nicolas for careful reading some parts of the manuscript, helpful comments and suggestions which rather improved the presentation of the last chap- ter. Also I sincerely would like to thank Professor Paulo Eduardo Oliveira for his kindly assistances and advices as a coordinator of this PhD program. My thanks goes to all my friends which made a friendly environment, in particular Mohammad Soufi Neyestani for what he did before I came to Portugal until now. My gratitude goes to Funda¸c~aoCalouste Gulbenkian for the financial support dur- ing my PhD. I would like to thank all people who taught me something which are useful in my life but I have not mentioned their names. I thank to the members of the juries of my thesis especially Jos´eAssis Azevedo and Ant´onioMachiavelo for their careful reading the thesis and their useful comments. Last but no means least, I would like to thank my family, for their love and en- couragement. ii The scientific work was carried out in 2009-2012 at Department of Mathematics - University of Porto Supervisor Semyon Yakubovich Resumo Durante um estudo da fun¸c~aozeta de Riemann, analizando alguns gr´aficoscom ela rela¸cionadise procurando rela¸c~oesentre a hip´otesede Riemann e o tamanho (valor absoluto) da fun¸c~ao-zeta,observamos uma rela¸c~aointeressante entre esses valores, nomeadamente, que na faixa 0 < σ < 1=2 com jtj ≥ 6:5, se tem (onde, como ´eusual, s = σ + it): jζ(1 − s)j ≤ jζ(s)j Mais tarde, apercebemo-nos que este resultado tinha j´asido demonstrado por Dixon-Schoenfeld e Spira na d´ecada de 1960. No entanto, a nossa demonstra¸c~ao´e diferente e tem a vantagem de envolver, em vez da f´ormula assimpt´oticade Stirling, algumas desigualdades relacionadas com um produto infinito de π e a fun¸c~aoΓ de Euler. O resultado principal do primeiro cap´ıtulo´e,pois, que 1 jζ(1 − s)j ≤ jζ(s)j; for 0 < σ < ; 2 onde a igualdade ocorre s´ose ζ(s) = 0. No segundo cap´ıtulod´a-seum refinamento de estimativas de algumas fun¸c~oes relacionadas com a distribui¸c~aodos n´umerosprimos, tais como as fun¸c~oes e # de Chebyshev, usando uma nova regi~aolivre de zeros e o c´alculode novos zeros da fun¸c~aozeta, obtidas por Kadiri e Gourdon, respectivamente. No terceiro cap´ıtulointroduzimos e investigamos algumas sequ^enciasrelacionadas com um teorema de Robin, que afirma que, a hip´otesede Riemann ´eequivalente `adesigualdade σ(n) < eγn log log n para todos n > 5040, onde σ(n) ´ea soma dos divisores de n e γ ´ea constante de Euler. Com base nesta desigualdade, introduz- imos uma sequ^enciade n´umeros,que apelidamos de extremamente abundantes, e mostramos que a hip´otesede Riemann ´everdadeira se e s´ose existe uma infinidade destes n´umeros.Investigamos ainda algumas das suas propriedades e a estrutura dos n´umerosextremamente abundantes, assim como algumas propriedades dos os n´umerossuperabundantes e colossalmente abundantes. Finalmente apresentamos dois outros conjuntos de n´umeros,relacionados com os n´umerosextremamente abundantes, que mostram o quanto subtil ´ea hip´otesede Riemann. iv Abstract While studying the Riemann zeta-function, observing some graphs related to it and looking for some relation between the Riemann hypothesis and the absolute value of the Riemann zeta function, we noted an interesting relationship between those values, namely, that in the strip 0 < σ < 1=2 with jtj ≥ 6:5, one has (as usual s = σ + it): jζ(1 − s)j ≤ jζ(s)j Later we found that this result had been proved by Dixon-Schoenfeld and Spira in 1960's. Nevertheless, our proof was different and has the advantages of involving, instead of Stirling's asymptotic formula, some inequalities related to an infinite product for π and Euler's Γ-function. The main result of the first chapter is, thus, that 1 jζ(1 − s)j ≤ jζ(s)j; for 0 < σ < ; (0.1) 2 where the equality takes place only if ζ(s) = 0. In the second chapter, we give an improvement for estimates of some functions related to the distribution of primes, such as Chebyshev's and # functions, using some new zero-free region and computations of new zeros of the zeta-function, obtained by Kadiri and Gourdon respectively. In the third chapter, we introduce and investigate some sequences related to Robin's theorem, which states that, the Riemann hypothesis is equivalent to the inequality σ(n) < eγn log log n for all n > 5040, where γ is Euler's constant. Inspired by this inequality, we introduce a sequence of numbers, that we call ex- tremely abundant, and show that the Riemann hypothesis is true if and only if there are infinitely many of these numbers. Moreover, we investigate some of their properties and structure, as well as some properties of superabundant and colos- sally abundant numbers. Finally we introduce two other sets of numbers, related to extremely abundant numbers, that show how subtle the Riemann hypothesis is. v Contents 0 Introduction 1 0.1 A Note About the Riemann Hypothesis . .1 0.2 Equivalent Statements to RH . .4 0.3 Brief Description of the Chapters . .5 0.4 Own papers . .7 1 Riemann Zeta-Function, Its size in Critical Strip and the RH 9 1.1 Preliminaries About the Riemann Zeta Function . 10 1.1.1 Complex-Valued Functions . 10 1.1.2 Representations of Entire Functions . 10 1.1.3 Gamma Function . 11 1.1.4 The Riemann Zeta Function . 12 1.1.5 The Functional Equation . 13 1.1.6 Values of ζ(s) in the Integers . 13 1.1.7 Zeros of the Riemann Zeta Function . 14 1.1.8 Bounds of ζ(s)......................... 16 1.2 On an Inequality for the Riemann Zeta Function in the Critical Strip 16 1.2.1 Auxiliary Lemmas . 17 1.2.2 Proof of the Main Result . 19 1.2.3 An Application to the RH . 23 2 Chebyshev's Functions, Improved Bounds and the RH 26 2.1 Introduction and Preliminary Results . 26 2.1.1 Explicit Bounds for Distribution of Primes . 29 2.1.2 Irregularities of the Distribution of Primes . 33 2.2 A Sufficient Condition for the RH . 34 2.3 Improved Explicit Bounds for Chebyshev's Functions . 35 2.3.1 Improved Explicit Bounds for Large Values of x ....... 35 vi 2.3.2 Improved Explicit Bounds for Moderate Values of x ..... 38 2.4 Improved Explicit Bounds and Distribution of Primes . 39 Y 2.5 Explicit Estimates for (1 + 1=p).................. 42 p≤x 3 Extremely Abundant Numbers and the RH 47 3.1 Introduction and Background . 47 3.2 Extremely Abundant Numbers: Definition and Motivations . 50 3.3 Auxiliary Lemmas . 53 3.4 Some Properties of SA, CA and XA Numbers . 56 3.4.1 SA Numbers . 57 3.4.2 CA Numbers . 68 3.4.3 XA Numbers . 71 3.5 Delicacy of the RH . 75 3.6 Numerical Experiments . 77 vii List of Tables 1 Numerical verification of zeros of the zeta function ([6], p. 39) . .2 2.1 Prime counting function and logarithmic integral[23, p. 2] . 27 Qk 3.1 First 10 extremely abundant numbers (pk] = j=1 pj is primorial of p)................................... 79 ∗ b 3.2 j (x) − xj < x"0; (x ≥ e ), for Theorem 2.20 . 85 ∗ 3.3 ηk for the case j (x) − xj < x"0 .................... 86 ∗ 3.4 ηk for the case j (x) − xj < x"0 .................... 87 ∗ 3.5 ηk for the case j (x) − xj < x"0 .................... 88 viii Notations f(x) = Ω+(g(x)) f(x) > Cg(x) for a suitable constant C > 0 and a sequence x = xn s.t. xn ! 1 f(x) = Ω−(g(x)) f(x) < −Cg(x) for a suitable constant C > 0 and a sequence x = xn s.t. xn ! 1 f(x) = Ω±(g(x)) Both f(x) = Ω+(g(x)) and f(x) = Ω−(g(x)) hold f(x) = Ω(g(x)) jf(x)j = Ω+(g(x)) f(x) = O(g(x)) jf(x)j ≤ Ajg(x)j for some constant A and all values of x > x0 for some x0 f(x) f(x) = o(g(x)) limx!1 g(x) = 0 f(x) f ∼ g limx!1 g(x) = 1 π(x) the number of prime numbers p ≤ x Π(x) Riemann prime counting function; i.e. P 1 1 1=2 1 1=3 pm≤x m = π(x) + 2 π(x ) + 3 π(x ) + ··· Z 1−" dt Z x dt li(x) lim + "!0 0 log t 1+" log t R x dt Li(x) 2 log t ix bxc the integral part of x σ(n) sum of divisors of a positive integer n d(n) number of divisors of a positive integer n φ(n) Euler's totient function: the number of positive integers not exceeding n which are relatively prime to n P #(x) Chebyshev's first function: p≤x log p P (x) Chebyshev's second function: pm≤x log p Q Ψ(n) Dedekind's arithmetical function: n pjn(1 + 1=p) SA Set of superabundant numbers, also abbreviation for superabundant CA Set of colossally abundant numbers, also abbreviation for colossally abundant XA Set of extremely abundant numbers, also abbreviation for extremely abundant x Chapter 0 Introduction Contents 0.1 A Note About the Riemann Hypothesis .
Load more

Recommended publications
  • Generalizations of Euler Numbers and Polynomials 1
    GENERALIZATIONS OF EULER NUMBERS AND POLYNOMIALS QIU-MING LUO AND FENG QI Abstract. In this paper, the concepts of Euler numbers and Euler polyno- mials are generalized, and some basic properties are investigated. 1. Introduction It is well-known that the Euler numbers and polynomials can be defined by the following definitions. Definition 1.1 ([1]). The Euler numbers Ek are defined by the following expansion t ∞ 2e X Ek = tk, |t| ≤ π. (1.1) e2t + 1 k! k=0 In [4, p. 5], the Euler numbers is defined by t/2 ∞ n 2n 2e t X (−1) En t = sech = , |t| ≤ π. (1.2) et + 1 2 (2n)! 2 n=0 Definition 1.2 ([1, 4]). The Euler polynomials Ek(x) for x ∈ R are defined by xt ∞ 2e X Ek(x) = tk, |t| ≤ π. (1.3) et + 1 k! k=0 It can also be shown that the polynomials Ei(t), i ∈ N, are uniquely determined by the following two properties 0 Ei(t) = iEi−1(t),E0(t) = 1; (1.4) i Ei(t + 1) + Ei(t) = 2t . (1.5) 2000 Mathematics Subject Classification. 11B68. Key words and phrases. Euler numbers, Euler polynomials, generalization. The authors were supported in part by NNSF (#10001016) of China, SF for the Prominent Youth of Henan Province, SF of Henan Innovation Talents at Universities, NSF of Henan Province (#004051800), Doctor Fund of Jiaozuo Institute of Technology, China. This paper was typeset using AMS-LATEX. 1 2 Q.-M. LUO AND F. QI Euler polynomials are related to the Bernoulli numbers. For information about Bernoulli numbers and polynomials, please refer to [1, 2, 3, 4].
    [Show full text]
  • An Identity for Generalized Bernoulli Polynomials
    1 2 Journal of Integer Sequences, Vol. 23 (2020), 3 Article 20.11.2 47 6 23 11 An Identity for Generalized Bernoulli Polynomials Redha Chellal1 and Farid Bencherif LA3C, Faculty of Mathematics USTHB Algiers Algeria [email protected] [email protected] [email protected] Mohamed Mehbali Centre for Research Informed Teaching London South Bank University London United Kingdom [email protected] Abstract Recognizing the great importance of Bernoulli numbers and Bernoulli polynomials in various branches of mathematics, the present paper develops two results dealing with these objects. The first one proposes an identity for the generalized Bernoulli poly- nomials, which leads to further generalizations for several relations involving classical Bernoulli numbers and Bernoulli polynomials. In particular, it generalizes a recent identity suggested by Gessel. The second result allows the deduction of similar identi- ties for Fibonacci, Lucas, and Chebyshev polynomials, as well as for generalized Euler polynomials, Genocchi polynomials, and generalized numbers of Stirling. 1Corresponding author. 1 1 Introduction Let N and C denote, respectively, the set of positive integers and the set of complex numbers. (α) In his book, Roman [41, p. 93] defined generalized Bernoulli polynomials Bn (x) as follows: for all n ∈ N and α ∈ C, we have ∞ tn t α B(α)(x) = etx. (1) n n! et − 1 Xn=0 The Bernoulli numbers Bn, classical Bernoulli polynomials Bn(x), and generalized Bernoulli (α) numbers Bn are, respectively, defined by (1) (α) (α) Bn = Bn(0), Bn(x)= Bn (x), and Bn = Bn (0). (2) The Bernoulli numbers and the Bernoulli polynomials play a fundamental role in various branches of mathematics, such as combinatorics, number theory, mathematical analysis, and topology.
    [Show full text]
  • Sums of Powers and the Bernoulli Numbers Laura Elizabeth S
    Eastern Illinois University The Keep Masters Theses Student Theses & Publications 1996 Sums of Powers and the Bernoulli Numbers Laura Elizabeth S. Coen Eastern Illinois University This research is a product of the graduate program in Mathematics and Computer Science at Eastern Illinois University. Find out more about the program. Recommended Citation Coen, Laura Elizabeth S., "Sums of Powers and the Bernoulli Numbers" (1996). Masters Theses. 1896. https://thekeep.eiu.edu/theses/1896 This is brought to you for free and open access by the Student Theses & Publications at The Keep. It has been accepted for inclusion in Masters Theses by an authorized administrator of The Keep. For more information, please contact [email protected]. THESIS REPRODUCTION CERTIFICATE TO: Graduate Degree Candidates (who have written formal theses) SUBJECT: Permission to Reproduce Theses The University Library is rece1v1ng a number of requests from other institutions asking permission to reproduce dissertations for inclusion in their library holdings. Although no copyright laws are involved, we feel that professional courtesy demands that permission be obtained from the author before we allow theses to be copied. PLEASE SIGN ONE OF THE FOLLOWING STATEMENTS: Booth Library of Eastern Illinois University has my permission to lend my thesis to a reputable college or university for the purpose of copying it for inclusion in that institution's library or research holdings. u Author uate I respectfully request Booth Library of Eastern Illinois University not allow my thesis
    [Show full text]
  • Higher Order Bernoulli and Euler Numbers
    David Vella, Skidmore College [email protected] Generating Functions and Exponential Generating Functions • Given a sequence {푎푛} we can associate to it two functions determined by power series: • Its (ordinary) generating function is ∞ 풏 푓 풙 = 풂풏풙 풏=ퟏ • Its exponential generating function is ∞ 풂 품 풙 = 풏 풙풏 풏! 풏=ퟏ Examples • The o.g.f and the e.g.f of {1,1,1,1,...} are: 1 • f(x) = 1 + 푥 + 푥2 + 푥3 + ⋯ = , and 1−푥 푥 푥2 푥3 • g(x) = 1 + + + + ⋯ = 푒푥, respectively. 1! 2! 3! The second one explains the name... Operations on the functions correspond to manipulations on the sequence. For example, adding two sequences corresponds to adding the ogf’s, while to shift the index of a sequence, we multiply the ogf by x, or differentiate the egf. Thus, the functions provide a convenient way of studying the sequences. Here are a few more famous examples: Bernoulli & Euler Numbers • The Bernoulli Numbers Bn are defined by the following egf: x Bn n x x e 1 n1 n! • The Euler Numbers En are defined by the following egf: x 2e En n Sech(x) 2x x e 1 n0 n! Catalan and Bell Numbers • The Catalan Numbers Cn are known to have the ogf: ∞ 푛 1 − 1 − 4푥 2 퐶 푥 = 퐶푛푥 = = 2푥 1 + 1 − 4푥 푛=1 • Let Sn denote the number of different ways of partitioning a set with n elements into nonempty subsets. It is called a Bell number. It is known to have the egf: ∞ 푆 푥 푛 푥푛 = 푒 푒 −1 푛! 푛=1 Higher Order Bernoulli and Euler Numbers th w • The n Bernoulli Number of order w, B n is defined for positive integer w by: w x B w n xn x e 1 n1 n! th w • The n Euler Number of
    [Show full text]
  • Handbook of Number Theory Ii
    HANDBOOK OF NUMBER THEORY II by J. Sändor Babes-Bolyai University ofCluj Department of Mathematics and Computer Science Cluj-Napoca, Romania and B. Crstici formerly the Technical University of Timisoara Timisoara Romania KLUWER ACADEMIC PUBLISHERS DORDRECHT / BOSTON / LONDON Contents PREFACE 7 BASIC SYMBOLS 9 BASIC NOTATIONS 10 1 PERFECT NUMBERS: OLD AND NEW ISSUES; PERSPECTIVES 15 1.1 Introduction 15 1.2 Some historical facts 16 1.3 Even perfect numbers 20 1.4 Odd perfect numbers 23 1.5 Perfect, multiperfect and multiply perfect numbers 32 1.6 Quasiperfect, almost perfect, and pseudoperfect numbers 36 1.7 Superperfect and related numbers 38 1.8 Pseudoperfect, weird and harmonic numbers 42 1.9 Unitary, bi-unitary, infinitary-perfect and related numbers 45 1.10 Hyperperfect, exponentially perfect, integer-perfect and y-perfect numbers 50 1.11 Multiplicatively perfect numbers 55 1.12 Practical numbers 58 1.13 Amicable numbers 60 1.14 Sociable numbers 72 References 77 2 GENERALIZATIONS AND EXTENSIONS OF THE MÖBIUS FUNCTION 99 2.1 Introduction 99 1 CONTENTS 2.2 Möbius functions generated by arithmetical products (or convolutions) 106 1 Möbius functions defined by Dirichlet products 106 2 Unitary Möbius functions 110 3 Bi-unitary Möbius function 111 4 Möbius functions generated by regulär convolutions .... 112 5 K-convolutions and Möbius functions. B convolution . ... 114 6 Exponential Möbius functions 117 7 l.c.m.-product (von Sterneck-Lehmer) 119 8 Golomb-Guerin convolution and Möbius function 121 9 max-product (Lehmer-Buschman) 122 10 Infinitary
    [Show full text]
  • Mathematical Constants and Sequences
    Mathematical Constants and Sequences a selection compiled by Stanislav Sýkora, Extra Byte, Castano Primo, Italy. Stan's Library, ISSN 2421-1230, Vol.II. First release March 31, 2008. Permalink via DOI: 10.3247/SL2Math08.001 This page is dedicated to my late math teacher Jaroslav Bayer who, back in 1955-8, kindled my passion for Mathematics. Math BOOKS | SI Units | SI Dimensions PHYSICS Constants (on a separate page) Mathematics LINKS | Stan's Library | Stan's HUB This is a constant-at-a-glance list. You can also download a PDF version for off-line use. But keep coming back, the list is growing! When a value is followed by #t, it should be a proven transcendental number (but I only did my best to find out, which need not suffice). Bold dots after a value are a link to the ••• OEIS ••• database. This website does not use any cookies, nor does it collect any information about its visitors (not even anonymous statistics). However, we decline any legal liability for typos, editing errors, and for the content of linked-to external web pages. Basic math constants Binary sequences Constants of number-theory functions More constants useful in Sciences Derived from the basic ones Combinatorial numbers, including Riemann zeta ζ(s) Planck's radiation law ... from 0 and 1 Binomial coefficients Dirichlet eta η(s) Functions sinc(z) and hsinc(z) ... from i Lah numbers Dedekind eta η(τ) Functions sinc(n,x) ... from 1 and i Stirling numbers Constants related to functions in C Ideal gas statistics ... from π Enumerations on sets Exponential exp Peak functions (spectral) ..
    [Show full text]
  • MASON V(Irtual) Mid-Atlantic Seminar on Numbers March 27–28, 2021
    MASON V(irtual) Mid-Atlantic Seminar On Numbers March 27{28, 2021 Abstracts Amod Agashe, Florida State University A generalization of Kronecker's first limit formula with application to zeta functions of number fields The classical Kronecker's first limit formula gives the polar and constant term in the Laurent expansion of a certain two variable Eisenstein series, which in turn gives the polar and constant term in the Laurent expansion of the zeta function of a quadratic imaginary field. We will recall this formula and give its generalization to more general Eisenstein series and to zeta functions of arbitrary number fields. Max Alekseyev, George Washington University Enumeration of Payphone Permutations People's desire for privacy drives many aspects of their social behavior. One such aspect can be seen at rows of payphones, where people often pick an available payphone most distant from already occupied ones.Assuming that there are n payphones in a row and that n people pick payphones one after another as privately as possible, the resulting assignment of people to payphones defines a permutation, which we will refer to as a payphone permutation. It can be easily seen that not every permutation can be obtained this way. In the present study, we consider different variations of payphone permutations and enumerate them. Kisan Bhoi, Sambalpur University Narayana numbers as sum of two repdigits Repdigits are natural numbers formed by the repetition of a single digit. Diophantine equations involving repdigits and the terms of linear recurrence sequences have been well studied in literature. In this talk we consider Narayana's cows sequence which is a third order liner recurrence sequence originated from a herd of cows and calves problem.
    [Show full text]
  • Multiplication Modulo N Along the Primorials with Its Differences And
    Multiplication Modulo n Along The Primorials With Its Differences And Variations Applied To The Study Of The Distributions Of Prime Number Gaps A.K.A. Introduction To The S Model Russell Letkeman r. letkeman@ gmail. com Dedicated to my son Panha May 19, 2013 Abstract The sequence of sets of Zn on multiplication where n is a primorial gives us a surprisingly simple and elegant tool to investigate many properties of the prime numbers and their distributions through analysis of their gaps. A natural reason to study multiplication on these boundaries is a construction exists which evolves these sets from one primorial boundary to the next, via the sieve of Eratosthenes, giving us Just In Time prime sieving. To this we add a parallel study of gap sets of various lengths and their evolution all of which together informs what we call the S model. We show by construction there exists for each prime number P a local finite probability distribution and it is surprisingly well behaved. That is we show the vacuum; ie the gaps, has deep structure. We use this framework to prove conjectured distributional properties of the prime numbers by Legendre, Hardy and Littlewood and others. We also demonstrate a novel proof of the Green-Tao theorem. Furthermore we prove the Riemann hypoth- esis and show the results are perhaps surprising. We go on to use the S model to predict novel structure within the prime gaps which leads to a new Chebyshev type bias we honorifically name the Chebyshev gap bias. We also probe deeper behavior of the distribution of prime numbers via ultra long scale oscillations about the scale of numbers known as Skewes numbers∗.
    [Show full text]
  • A New Extension of Q-Euler Numbers and Polynomials Related to Their Interpolation Functions
    CORE Metadata, citation and similar papers at core.ac.uk Provided by Elsevier - Publisher Connector Applied Mathematics Letters 21 (2008) 934–939 www.elsevier.com/locate/aml A new extension of q-Euler numbers and polynomials related to their interpolation functions Hacer Ozdena,∗, Yilmaz Simsekb a University of Uludag, Faculty of Arts and Science, Department of Mathematics, Bursa, Turkey b University of Akdeniz, Faculty of Arts and Science, Department of Mathematics, Antalya, Turkey Received 9 March 2007; received in revised form 30 July 2007; accepted 18 October 2007 Abstract In this work, by using a p-adic q-Volkenborn integral, we construct a new approach to generating functions of the (h, q)-Euler numbers and polynomials attached to a Dirichlet character χ. By applying the Mellin transformation and a derivative operator to these functions, we define (h, q)-extensions of zeta functions and l-functions, which interpolate (h, q)-extensions of Euler numbers at negative integers. c 2007 Elsevier Ltd. All rights reserved. Keywords: p-adic Volkenborn integral; Twisted q-Euler numbers and polynomials; Zeta and l-functions 1. Introduction, definitions and notation Let p be a fixed odd prime number. Throughout this work, Zp, Qp, C and Cp respectively denote the ring of p- adic rational integers, the field of p-adic rational numbers, the complex numbers field and the completion of algebraic | | = −vp(p) = 1 closure of Qp. Let vp be the normalized exponential valuation of Cp with p p p p . When one talks of q-extension, q is considered in many ways, e.g. as an indeterminate, a complex number q ∈ C, or a p-adic number − 1 p−1 x q ∈ Cp.
    [Show full text]
  • Integer Sequences
    UHX6PF65ITVK Book > Integer sequences Integer sequences Filesize: 5.04 MB Reviews A very wonderful book with lucid and perfect answers. It is probably the most incredible book i have study. Its been designed in an exceptionally simple way and is particularly just after i finished reading through this publication by which in fact transformed me, alter the way in my opinion. (Macey Schneider) DISCLAIMER | DMCA 4VUBA9SJ1UP6 PDF > Integer sequences INTEGER SEQUENCES Reference Series Books LLC Dez 2011, 2011. Taschenbuch. Book Condition: Neu. 247x192x7 mm. This item is printed on demand - Print on Demand Neuware - Source: Wikipedia. Pages: 141. Chapters: Prime number, Factorial, Binomial coeicient, Perfect number, Carmichael number, Integer sequence, Mersenne prime, Bernoulli number, Euler numbers, Fermat number, Square-free integer, Amicable number, Stirling number, Partition, Lah number, Super-Poulet number, Arithmetic progression, Derangement, Composite number, On-Line Encyclopedia of Integer Sequences, Catalan number, Pell number, Power of two, Sylvester's sequence, Regular number, Polite number, Ménage problem, Greedy algorithm for Egyptian fractions, Practical number, Bell number, Dedekind number, Hofstadter sequence, Beatty sequence, Hyperperfect number, Elliptic divisibility sequence, Powerful number, Znám's problem, Eulerian number, Singly and doubly even, Highly composite number, Strict weak ordering, Calkin Wilf tree, Lucas sequence, Padovan sequence, Triangular number, Squared triangular number, Figurate number, Cube, Square triangular
    [Show full text]
  • Exact Formulas for the Generalized Sum-Of-Divisors Functions)
    Exact Formulas for the Generalized Sum-of-Divisors Functions Maxie D. Schmidt School of Mathematics Georgia Institute of Technology Atlanta, GA 30332 USA [email protected] [email protected] Abstract We prove new exact formulas for the generalized sum-of-divisors functions, σα(x) := dα. The formulas for σ (x) when α C is fixed and x 1 involves a finite sum d x α ∈ ≥ over| all of the prime factors n x and terms involving the r-order harmonic number P ≤ sequences and the Ramanujan sums cd(x). The generalized harmonic number sequences correspond to the partial sums of the Riemann zeta function when r > 1 and are related to the generalized Bernoulli numbers when r 0 is integer-valued. ≤ A key part of our new expansions of the Lambert series generating functions for the generalized divisor functions is formed by taking logarithmic derivatives of the cyclotomic polynomials, Φ (q), which completely factorize the Lambert series terms (1 qn) 1 into n − − irreducible polynomials in q. We focus on the computational aspects of these exact ex- pressions, including their interplay with experimental mathematics, and comparisons of the new formulas for σα(n) and the summatory functions n x σα(n). ≤ 2010 Mathematics Subject Classification: Primary 30B50; SecondaryP 11N64, 11B83. Keywords: Divisor function; sum-of-divisors function; Lambert series; cyclotomic polynomial. Revised: April 23, 2019 arXiv:1705.03488v5 [math.NT] 19 Apr 2019 1 Introduction 1.1 Lambert series generating functions We begin our search for interesting formulas for the generalized sum-of-divisors functions, σα(n) for α C, by expanding the partial sums of the Lambert series which generate these functions in the∈ form of [5, 17.10] [13, 27.7] § § nαqn L (q) := = σ (m)qm, q < 1.
    [Show full text]
  • The Riemann Hypothesis Frank Vega
    The Riemann Hypothesis Frank Vega To cite this version: Frank Vega. The Riemann Hypothesis. 2021. hal-02501243v11 HAL Id: hal-02501243 https://hal.archives-ouvertes.fr/hal-02501243v11 Preprint submitted on 17 May 2021 (v11), last revised 14 Jul 2021 (v14) HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. The Riemann Hypothesis Frank Vega P 1 Abstract. Let's define δ(x) = ( q≤x q − log log x − B), where B ≈ 0:2614972128 is the Meissel-Mertens constant. The Robin theorem states that δ(x) changes sign infinitely often. Let's also define S(x) = θ(x) − x, where θ(x) is the Chebyshev function. A theorem due to Erhard Schmidt implies that S(x) changes sign infinitely often. Using the Nicolas theorem, we prove that when the inequalities δ(x) ≤ 0 and S(x) ≥ 0 are satisfied for some x ≥ 127, then the Riemann Hypothesis should be false. However, the Mertens second theorem states that limx!1 δ(x) = 0. Moreover, a result from the Gr¨onwall paper could be restated as limx!1 S(x) = 0. In this way, this work could mean a new step forward in the direction for finally solving the Riemann Hypothesis.
    [Show full text]