Formulae for Computing Logarithmic Integral Function ( )!
|
|
- Cecily Reynolds
- 6 years ago
- Views:
Transcription
1 Formulae for Computing Logarithmic Integral Function x 2 ln t Li(x) dt Amrik Singh Nimbran 6, Polo Road, Patna, INDIA simnimas@yahoo.co.in Abstract: The prime number theorem states that the number of primes up to a given number is approximated by the logarithmic integral function. To compute the value of this function, the author offers two formulae deduced from truncated series one convergent and the other divergent. He also gives a table of values computed by him for this function. Key words: Prime numbers, prime counting function, logarithmic integral function. AMS Classification: 11A41, 26A Introduction: Hadamard and de la Vallée Poussin independently showed in 1896 that if π(x) denotes the number of primes up to a given number x, then for some positive constant c π(x) Li(x) O(xe ). Here Li(x) is the logarithmic integral function. Some books on number theory record the values of Li(x) for certain x without giving any clue to the method by which these values have been arrived at. We find the following expansion at some places [1]: Li(x) ()! O (1) In this paper, I offer two alternative series for computing Li(x). Let us take the identity: 1!!!!! (2) Term-by-term integration of the right hand side and repeated integration by parts of the left hand side lead to: RHS ln u u (3) LHS! ()! (4) Putting u ln t, du, e t, we obtain from (2), (3) and (4): 1
2 ln ln t ln t (5)!! ()! (6) Now taking the definite integral: Li(x), we obtain two alternative expansions while (5) gives a convergent series, (6) results in a difference of two divergent series. I have found on close examination that we may usefully employ truncated versions of these expansions for computing Li(x). Let me first introduce two theorems which analyse the behaviour of the terms in (5) and (6). Theorem 1: a all x 91. attains the maximum value at n [ln x] 1 or at n [lnx] 2 for Proof: If we show that a < a and a >a at n [ln x] 1 for x 91, this will suffice. Now [ln x] (ln x) d, 0 d<1. () () {( )} {( )} and for denominator to be non-zero and positive, it is necessary that ln x > d 3, i.e., ln x 4, i.e., x 55. Now numerator denominator (d 2) (d 1) ln x. Thus () () < ln x which implies that < 1, i.e., if ln x, or x 91, a < a. Similarly, () ( ) {( )} for the denominator to be non-zero and positive, it is necessary that ln x d 1, i.e., ln x 2, or x 8. Again, numerator denominator d (1 d), lnx > 0 as d < 1. Hence for x 8, a >a. We have thus shown that for x 91 and n [ln x] 1, a < a, a >a. Thus either a or a is the largest term, i.e., a attains the maximum value at n [ln x] 1 or at n [ln x] 2 for x 91. Generally, it is at n [ln x] 1 that x10 2
3 attains the maximum value but occasionally as is the case for m3 and m10, it may be at n [ln x] 2. It is thus clear that the terms in (5) first increase, attain the maximum value and then begin decreasing to approach zero. Theorem 2: a ()! attains the minimum value at [ln x] 1, where [ln x] denotes the greatest integer contained in ln x. Proof: ;. Putting n[ln x] 1, [ ] 1 ; [ ] <1. i.e.,a a < a, i.e., a attains the least possible value at n [ln x] 1. This theorem thus shows that the terms in (6) first decrease, attain the minimum value and then start increasing to approach. According to (4), Li(x) ln ln t 1 x 2 i.e., Li(x) ln ln x ln ln 2 (7) < ln 2 We can see that ln 2 ln 2 /(1- ) Actually, ; ln ln Consequently, the second (-) quantity comes to (correct to 6 decimal places!). The third quantity (.468) may be ignored by leaving out infinitely many smaller terms (whose sum approximately equals this quantity) of the second quantity. If Li(x) ln ln x, then denoting the remainder by R(x), we have R(x) < () ().()! ().()! ). ().()! ().()! 1 () () If k > ln x, then R(x) ().()! 1/ (1 () ) ().()! {(k 1) ln x }. 3
4 So if k e ln x 1, R(x) <.633. Hence both quantities then cancel almost out each other (with error <.165). Hence I take k [2.72 (ln x)] 1 which gives the approximation formula: [2.72(ln x)]1 Li(x) ln ln x lnn x 1 (7a) n.n! Now according to (5), Li(x) x dt 2 ()! x 1 2 i.,e., Li(x) ( ()! ) ( ()! ) (8) Both quantities tend to here. The terms in first series initially decrease before they start increasing; the second is (strictly) monotonically increasing series. I have found that, except for some smaller values of x(<1000), (8) can be truncated, without any significant loss in accuracy, to this approximation formula: [ln x]1 (n1)!x Li(x) n1 (8a) ln n x Though the formula (7a) is slightly more accurate than (8a) for smaller values of x (< 1000), it requires roughly (2.7) times the number of terms needed in the latter, which is more convenient for larger values of x. I give an illustrative example here: Let x10. According to formula (7a): Li(10 [.( ) ln lnx )] Here 20 terms were needed for the computation. Since ln(10 ) 6.9, [ln x] 1 7. Thus only 7 terms would be required for computation with formula (8a). ()! Li (10 ) The following table contain certain values of Li(x) computed by me with the help of formulae (7a) and (8a). These values compare very well with the values of Li(x) borrowed from various sources [2] to [7] and thereby validate my formulae. 4
5 Table of values [2.72(ln x)]1 x Li(x) ln ln x lnn x [ln x]1 (n1)!x 1 n.n! n1 ln n x ? Note: My calculations were done on Microsoft Excel for x< 10. But the Program gives only rounded figures (inexact calculations) for x 10. So I had to use Scientific Calculator manually for x 10. References: 1. Apostol, Tom M. Introduction to Analytic Number Theory, Springer International Student Edition, Narosa Publishing House, New Delhi, 1995 reprint, Exercises for Chapter4,19, pp Burton, David M. Elementary Number Theory, Tata Mcraw-Hill,2007, New Delhi, 6 th ed., p.374 & Caldwell, Chris K. Prime Pages, 4. Richard Crandall & Carl Pomerance, Prime Numbers: A Computational Perspective, 2 nd ed., Springer (2005), New York, pp Hua Loo Keng, Introduction to Number Theory, Springer-Verlag, Berlin, 1982, p Ore, Oystein, Number Theory and Its History, McGraw Hill Book Company, New York, 1948, p USpensky, J.V. & Heaselet, M.A. Elementary Number Theory, McGraw Hill Book Company, New York, 1939, pp ****** 5
The Prime Number Theorem
The Prime Number Theorem We study the distribution of primes via the function π(x) = the number of primes x 6 5 4 3 2 2 3 4 5 6 7 8 9 0 2 3 4 5 2 It s easier to draw this way: π(x) = the number of primes
More informationPrime Sieve and Factorization Using Multiplication Table
Journal of Mathematics Research; Vol. 4, No. 3; 2012 ISSN 1916-9795 E-ISSN 1916-9809 Published by Canadian Center of Science and Education Prime Sieve and Factorization Using Multiplication Table Jongsoo
More informationAnalytic Number Theory Solutions
Analytic Number Theory Solutions Sean Li Cornell University sxl6@cornell.edu Jan. 03 Introduction This document is a work-in-progress solution manual for Tom Apostol s Introduction to Analytic Number Theory.
More informationMath 0230 Calculus 2 Lectures
Math 00 Calculus Lectures Chapter 8 Series Numeration of sections corresponds to the text James Stewart, Essential Calculus, Early Transcendentals, Second edition. Section 8. Sequences A sequence is a
More information8.1 Sequences. Example: A sequence is a function f(n) whose domain is a subset of the integers. Notation: *Note: n = 0 vs. n = 1.
8. Sequences Example: A sequence is a function f(n) whose domain is a subset of the integers. Notation: *Note: n = 0 vs. n = Examples: 6. Find a formula for the general term a n of the sequence, assuming
More information1 Euler s idea: revisiting the infinitude of primes
8.785: Analytic Number Theory, MIT, spring 27 (K.S. Kedlaya) The prime number theorem Most of my handouts will come with exercises attached; see the web site for the due dates. (For example, these are
More informationA Simple Counterexample to Havil s Reformulation of the Riemann Hypothesis
A Simple Counterexample to Havil s Reformulation of the Riemann Hypothesis Jonathan Sondow 209 West 97th Street New York, NY 0025 jsondow@alumni.princeton.edu The Riemann Hypothesis (RH) is the greatest
More information10.1 Sequences. Example: A sequence is a function f(n) whose domain is a subset of the integers. Notation: *Note: n = 0 vs. n = 1.
10.1 Sequences Example: A sequence is a function f(n) whose domain is a subset of the integers. Notation: *Note: n = 0 vs. n = 1 Examples: EX1: Find a formula for the general term a n of the sequence,
More informationPrimes. Rational, Gaussian, Industrial Strength, etc. Robert Campbell 11/29/2010 1
Primes Rational, Gaussian, Industrial Strength, etc Robert Campbell 11/29/2010 1 Primes and Theory Number Theory to Abstract Algebra History Euclid to Wiles Computation pencil to supercomputer Practical
More informationRiemann Hypothesis Elementary Discussion
Progress in Applied Mathematics Vol. 6, No., 03, pp. [74 80] DOI: 0.3968/j.pam.955803060.58 ISSN 95-5X [Print] ISSN 95-58 [Online] www.cscanada.net www.cscanada.org Riemann Hypothesis Elementary Discussion
More informationStudy of some equivalence classes of primes
Notes on Number Theory and Discrete Mathematics Print ISSN 3-532, Online ISSN 2367-8275 Vol 23, 27, No 2, 2 29 Study of some equivalence classes of primes Sadani Idir Department of Mathematics University
More informationFINAL EXAM Math 25 Temple-F06
FINAL EXAM Math 25 Temple-F06 Write solutions on the paper provided. Put your name on this exam sheet, and staple it to the front of your finished exam. Do Not Write On This Exam Sheet. Problem 1. (Short
More informationOn Conditionally Convergent Series
On Conditionally Convergent Series Werner Horn and Madjiguene Ndiaye Abstract We prove conditions of convergence for rearrangements of conditionally convergent series. The main results are a comparison
More informationSection 11.1: Sequences
Section 11.1: Sequences In this section, we shall study something of which is conceptually simple mathematically, but has far reaching results in so many different areas of mathematics - sequences. 1.
More information11.6: Ratio and Root Tests Page 1. absolutely convergent, conditionally convergent, or divergent?
.6: Ratio and Root Tests Page Questions ( 3) n n 3 ( 3) n ( ) n 5 + n ( ) n e n ( ) n+ n2 2 n Example Show that ( ) n n ln n ( n 2 ) n + 2n 2 + converges for all x. Deduce that = 0 for all x. Solutions
More informationPoints at Which Continuous Functions Have the Same Height
GENERAL ARTICLE Points at Which Continuous Functions Have the Same Height Parth Prashant Karnawat As an easy application of the intermediate value theorem, one can show that for any continuous function
More informationA) A simple way to know which reduction has a number is as follows.
Title: Prime numbers and composite numbers congruent to 1,4,7,2,5,8 (mod 9) Author: Zeolla, Gabriel Martin Comments: 27 pages, 6 graphics tables Subj-class: Theory number, Prime numbers. gabrielzvirgo@hotmail.com,
More informationWorksheet 9. Topics: Taylor series; using Taylor polynomials for approximate computations. Polar coordinates.
ATH 57H Spring 0 Worksheet 9 Topics: Taylor series; using Taylor polynomials for approximate computations. Polar coordinates.. Let f(x) = +x. Find f (00) (0) - the 00th derivative of f at point x = 0.
More informationSyllabus For II nd Semester Courses in MATHEMATICS
St. Xavier s College Autonomous Mumbai Syllabus For II nd Semester Courses in MATHEMATICS Contents: (November 2016 onwards) Theory Syllabus for Courses: S.MAT.2.01 : Calculus II. S.MAT.2.02 : Linear Algebra.
More informationHeuristics for Prime Statistics Brown Univ. Feb. 11, K. Conrad, UConn
Heuristics for Prime Statistics Brown Univ. Feb., 2006 K. Conrad, UConn Two quotes about prime numbers Mathematicians have tried in vain to this day to discover some order in the sequence of prime numbers,
More informationSYLLABUS UNDER AUTONOMY MATHEMATICS
SYLLABUS UNDER AUTONOMY SEMESTER III Calculus and Analysis MATHEMATICS COURSE: A.MAT.3.01 [45 LECTURES] LEARNING OBJECTIVES : To learn about i) lub axiom of R and its consequences ii) Convergence of sequences
More informationMath 126 Enhanced 10.3 Series with positive terms The University of Kansas 1 / 12
Section 10.3 Convergence of series with positive terms 1. Integral test 2. Error estimates for the integral test 3. Comparison test 4. Limit comparison test (LCT) Math 126 Enhanced 10.3 Series with positive
More informationSeries. richard/math230 These notes are taken from Calculus Vol I, by Tom M. Apostol,
Series Professor Richard Blecksmith richard@math.niu.edu Dept. of Mathematical Sciences Northern Illinois University http://math.niu.edu/ richard/math230 These notes are taken from Calculus Vol I, by Tom
More informationGod may not play dice with the universe, but something strange is going on with the prime numbers.
Primes: Definitions God may not play dice with the universe, but something strange is going on with the prime numbers. P. Erdös (attributed by Carl Pomerance) Def: A prime integer is a number whose only
More informationThe Prime Number Theorem
Chapter 3 The Prime Number Theorem This chapter gives without proof the two basic results of analytic number theory. 3.1 The Theorem Recall that if f(x), g(x) are two real-valued functions, we write to
More informationCMSC Discrete Mathematics SOLUTIONS TO SECOND MIDTERM EXAM November, 2005
CMSC-37110 Discrete Mathematics SOLUTIONS TO SECOND MIDTERM EXAM November, 2005 Instructor: László Babai Ryerson 164 e-mail: laci@cs This exam contributes 20% to your course grade. 1. (6 points) Let a
More informationMinimal Number of Steps in the Euclidean Algorithm and its Application to Rational Tangles
Rose-Hulman Undergraduate Mathematics Journal Volume 16 Issue 1 Article 3 Minimal Number of Steps in the Euclidean Algorithm and its Application to Rational Tangles M. Syafiq Johar University of Oxford
More informationarxiv: v1 [math.nt] 19 May 2011
FUN WITH VERY LARGE NUMBERS ROBERT BAILLIE Dedicated to Professor Jon Borwein on the occasion of his sixtieth birthday. arxiv:5.3943v [math.nt] 9 May 2 Abstract. We give an example of a formula involving
More informationChapter 1. Introduction to prime number theory. 1.1 The Prime Number Theorem
Chapter 1 Introduction to prime number theory 1.1 The Prime Number Theorem In the first part of this course, we focus on the theory of prime numbers. We use the following notation: we write f g as if lim
More informationPRIME NUMBERS YANKI LEKILI
PRIME NUMBERS YANKI LEKILI We denote by N the set of natural numbers: 1,2,..., These are constructed using Peano axioms. We will not get into the philosophical questions related to this and simply assume
More informationBlock-Wise Density Distribution of Primes Less Than A Trillion in Arithmetical Progressions 11n + k
Block-Wise Density Distribution of Primes Less Than A Trillion in Arithmetical Progressions k Neeraj Anant Pande Associate Professor, Department of Mathematics & Statistics, Yeshwant Mahavidyalaya (College),
More informationALGEBRA+NUMBER THEORY +COMBINATORICS
ALGEBRA+NUMBER THEORY +COMBINATORICS COMP 321 McGill University These slides are mainly compiled from the following resources. - Professor Jaehyun Park slides CS 97SI - Top-coder tutorials. - Programming
More informationJUST THE MATHS UNIT NUMBER DIFFERENTIATION APPLICATIONS 5 (Maclaurin s and Taylor s series) A.J.Hobson
JUST THE MATHS UNIT NUMBER.5 DIFFERENTIATION APPLICATIONS 5 (Maclaurin s and Taylor s series) by A.J.Hobson.5. Maclaurin s series.5. Standard series.5.3 Taylor s series.5.4 Exercises.5.5 Answers to exercises
More information8.5 Taylor Polynomials and Taylor Series
8.5. TAYLOR POLYNOMIALS AND TAYLOR SERIES 50 8.5 Taylor Polynomials and Taylor Series Motivating Questions In this section, we strive to understand the ideas generated by the following important questions:
More informationHere is another characterization of prime numbers.
Here is another characterization of prime numbers. Theorem p is prime it has no divisors d that satisfy < d p. Proof [ ] If p is prime then it has no divisors d that satisfy < d < p, so clearly no divisor
More informationLogarithmic Functions
Metropolitan Community College The Natural Logarithmic Function The natural logarithmic function is defined on (0, ) as ln x = x 1 1 t dt. Example 1. Evaluate ln 1. Example 1. Evaluate ln 1. Solution.
More informationPrime Number Diffeomorphisms, Diophantine Equations and the Riemann Hypothesis
Prime Number Diffeomorphisms, Diophantine Equations and the Riemann Hypothesis arxiv:math-ph/0411071v1 Nov 004 Lubomir Alexandrov and Lachezar Georgiev Institute for Nuclear Research and Nuclear Energy
More informationAnalysis of Primes Less Than a Trillion
Analysis of Less Than a Trillion Neeraj Anant Pande Department of Mathematics & Statistics, Yeshwant Mahavidyalaya (College), Nanded 43162, Maharashtra, INDIA Abstract An exhaustive analysis of the highly
More informationTheorem 1.1 (Prime Number Theorem, Hadamard, de la Vallée Poussin, 1896). let π(x) denote the number of primes x. Then x as x. log x.
Chapter 1 Introduction 1.1 The Prime Number Theorem In this course, we focus on the theory of prime numbers. We use the following notation: we write f( g( as if lim f(/g( = 1, and denote by log the natural
More informationVEER NARMAD SOUTH GUJARAT UNIVERSITY, SURAT
VEER NARMAD SOUTH GUJARAT UNIVERSITY, SURAT Syllabus for M.Sc. (Mathematics) Scheme of Teaching and Examination Semester II Subject Code Subject Scheme Of Teaching Scheme Of Examination PGMTH L P Total
More informationChapter 11 - Sequences and Series
Calculus and Analytic Geometry II Chapter - Sequences and Series. Sequences Definition. A sequence is a list of numbers written in a definite order, We call a n the general term of the sequence. {a, a
More informationA CONSTRUCTION OF ARITHMETIC PROGRESSION-FREE SEQUENCES AND ITS ANALYSIS
A CONSTRUCTION OF ARITHMETIC PROGRESSION-FREE SEQUENCES AND ITS ANALYSIS BRIAN L MILLER & CHRIS MONICO TEXAS TECH UNIVERSITY Abstract We describe a particular greedy construction of an arithmetic progression-free
More informationPrimes and Factorization
Primes and Factorization 1 A prime number is an integer greater than 1 with no proper divisors. The list begins 2, 3, 5, 7, 11, 13, 19,... See http://primes.utm.edu/ for a wealth of information about primes.
More informationOn the Infinitude of Twin-Primes Bao Qi Feng
On the Infinitude of Twin-Primes Bao Qi Feng Department of Mathematical Sciences, Kent State University at Tuscarawas 330 University Dr. NE, New Philadelphia, OH 44663, USA. Abstract In this article, we
More informationReview of Power Series
Review of Power Series MATH 365 Ordinary Differential Equations J. Robert Buchanan Department of Mathematics Fall 2018 Introduction In addition to the techniques we have studied so far, we may use power
More informationOptimal primitive sets with restricted primes
Optimal primitive sets with restricted primes arxiv:30.0948v [math.nt] 5 Jan 203 William D. Banks Department of Mathematics University of Missouri Columbia, MO 652 USA bankswd@missouri.edu Greg Martin
More informationPower series and Taylor series
Power series and Taylor series D. DeTurck University of Pennsylvania March 29, 2018 D. DeTurck Math 104 002 2018A: Series 1 / 42 Series First... a review of what we have done so far: 1 We examined series
More informationAssignment 16 Solution. Please do not copy and paste my answer. You will get similar questions but with different numbers!
Assignment 6 Solution Please do not copy and paste my answer. You will get similar questions but with different numbers! Suppose f is a continuous, positive, decreasing function on [, ) and let a n = f
More information3.4 Introduction to power series
3.4 Introduction to power series Definition 3.4.. A polynomial in the variable x is an expression of the form n a i x i = a 0 + a x + a 2 x 2 + + a n x n + a n x n i=0 or a n x n + a n x n + + a 2 x 2
More informationMathematics 136 Calculus 2 Everything You Need Or Want To Know About Partial Fractions (and maybe more!) October 19 and 21, 2016
Mathematics 36 Calculus 2 Everything You Need Or Want To Know About Partial Fractions (and maybe more!) October 9 and 2, 206 Every rational function (quotient of polynomials) can be written as a polynomial
More informationThe theory of continued fractions and the approximations of irrational numbers
교육학석사학위청구논문 연분수이론과무리수의근사 The theory of continued fractions and the approximations of irrational numbers 202 년 2 월 인하대학교교육대학원 수학교육전공 정미라 교육학석사학위청구논문 연분수이론과무리수의근사 The theory of continued fractions and the
More informationPrime Number Theory and the Riemann Zeta-Function
5262589 - Recent Perspectives in Random Matrix Theory and Number Theory Prime Number Theory and the Riemann Zeta-Function D.R. Heath-Brown Primes An integer p N is said to be prime if p and there is no
More informationPUTNAM TRAINING NUMBER THEORY. Exercises 1. Show that the sum of two consecutive primes is never twice a prime.
PUTNAM TRAINING NUMBER THEORY (Last updated: December 11, 2017) Remark. This is a list of exercises on Number Theory. Miguel A. Lerma Exercises 1. Show that the sum of two consecutive primes is never twice
More information#A69 INTEGERS 13 (2013) OPTIMAL PRIMITIVE SETS WITH RESTRICTED PRIMES
#A69 INTEGERS 3 (203) OPTIMAL PRIMITIVE SETS WITH RESTRICTED PRIMES William D. Banks Department of Mathematics, University of Missouri, Columbia, Missouri bankswd@missouri.edu Greg Martin Department of
More informationMathematics 324 Riemann Zeta Function August 5, 2005
Mathematics 324 Riemann Zeta Function August 5, 25 In this note we give an introduction to the Riemann zeta function, which connects the ideas of real analysis with the arithmetic of the integers. Define
More informationTwin primes (seem to be) more random than primes
Twin primes (seem to be) more random than primes Richard P. Brent Australian National University and University of Newcastle 25 October 2014 Primes and twin primes Abstract Cramér s probabilistic model
More information16.4. Power Series. Introduction. Prerequisites. Learning Outcomes
Power Series 6.4 Introduction In this Section we consider power series. These are examples of infinite series where each term contains a variable, x, raised to a positive integer power. We use the ratio
More informationGiven a sequence a 1, a 2,...of numbers, the finite sum a 1 + a 2 + +a n,wheren is an nonnegative integer, can be written
A Summations When an algorithm contains an iterative control construct such as a while or for loop, its running time can be expressed as the sum of the times spent on each execution of the body of the
More informationMath 5330 Spring Notes Prime Numbers
Math 5330 Sring 208 Notes Prime Numbers The study of rime numbers is as old as mathematics itself. This set of notes has a bunch of facts about rimes, or related to rimes. Much of this stuff is old dating
More informationChapter 1. Numerical Errors. Module No. 1. Errors in Numerical Computations
Numerical Analysis by Dr. Anita Pal Assistant Professor Department of Mathematics National Institute of Technology Durgapur Durgapur-73209 email: anita.buie@gmail.com . Chapter Numerical Errors Module
More informationSUMMATION TECHNIQUES
SUMMATION TECHNIQUES MATH 53, SECTION 55 (VIPUL NAIK) Corresponding material in the book: Scattered around, but the most cutting-edge parts are in Sections 2.8 and 2.9. What students should definitely
More informationAs f and g are differentiable functions such that. f (x) = 20e 2x, g (x) = 4e 2x + 4xe 2x,
srinivasan (rs7) Sample Midterm srinivasan (690) This print-out should have 0 questions. Multiple-choice questions may continue on the next column or page find all choices before answering. Determine if
More informationIntroduction Integers. Discrete Mathematics Andrei Bulatov
Introduction Integers Discrete Mathematics Andrei Bulatov Discrete Mathematics - Integers 9- Integers God made the integers; all else is the work of man Leopold Kroenecker Discrete Mathematics - Integers
More informationNeedles and Numbers. The Buffon Needle Experiment
eedles and umbers This excursion into analytic number theory is intended to complement the approach of our textbook, which emphasizes the algebraic theory of numbers. At some points, our presentation lacks
More informationFebruary 13, Option 9 Overview. Mind Map
Option 9 Overview Mind Map Return tests - will discuss Wed..1.1 J.1: #1def,2,3,6,7 (Sequences) 1. Develop and understand basic ideas about sequences. J.2: #1,3,4,6 (Monotonic convergence) A quick review:
More informationMath Test #3 Info and Review Exercises
Math 181 - Test #3 Info and Review Exercises Fall 2018, Prof. Beydler Test Info Date: Wednesday, November 28, 2018 Will cover sections 10.1-10.4, 11.1-11.7. You ll have the entire class to finish the test.
More informationPrimes, queues and random matrices
Primes, queues and random matrices Peter Forrester, M&S, University of Melbourne Outline Counting primes Counting Riemann zeros Random matrices and their predictive powers Queues 1 / 25 INI Programme RMA
More informationA group of figures, representing a number, is called a numeral. Numbers are divided into the following types.
1. Number System Quantitative Aptitude deals mainly with the different topics in Arithmetic, which is the science which deals with the relations of numbers to one another. It includes all the methods that
More informationarxiv:math/ v1 [math.nt] 9 Aug 2004
arxiv:math/0408107v1 [math.nt] 9 Aug 2004 ELEMENTARY RESULTS ON THE BINARY QUADRATIC FORM a 2 + ab + b 2 UMESH P. NAIR Abstract. This paper examines with elementary proofs some interesting properties of
More informationPythagorean Triples with a Fixed Difference between a Leg and the Hypotenuse
Pythagorean Triples with a Fixed Difference between a Leg and the Hypotenuse Anna Little Advisor: Michael Spivey April, 005 Abstract This project examines sets of Pythagorean triples with a fixed difference
More informationRiemann s ζ-function
Int. J. Contemp. Math. Sciences, Vol. 4, 9, no. 9, 45-44 Riemann s ζ-function R. A. Mollin Department of Mathematics and Statistics University of Calgary, Calgary, Alberta, Canada, TN N4 URL: http://www.math.ucalgary.ca/
More informationChapter 1. Introduction to prime number theory. 1.1 The Prime Number Theorem
Chapter 1 Introduction to prime number theory 1.1 The Prime Number Theorem In the first part of this course, we focus on the theory of prime numbers. We use the following notation: we write f( g( as if
More informationHomework and Computer Problems for Math*2130 (W17).
Homework and Computer Problems for Math*2130 (W17). MARCUS R. GARVIE 1 December 21, 2016 1 Department of Mathematics & Statistics, University of Guelph NOTES: These questions are a bare minimum. You should
More informationPolynomial Interpolation
Polynomial Interpolation (Com S 477/577 Notes) Yan-Bin Jia Sep 1, 017 1 Interpolation Problem In practice, often we can measure a physical process or quantity (e.g., temperature) at a number of points
More informationConstructing Taylor Series
Constructing Taylor Series 8-8-200 The Taylor series for fx at x = c is fc + f cx c + f c 2! x c 2 + f c x c 3 + = 3! f n c x c n. By convention, f 0 = f. When c = 0, the series is called a Maclaurin series.
More informationEvidence for the Riemann Hypothesis
Evidence for the Riemann Hypothesis Léo Agélas September 0, 014 Abstract Riemann Hypothesis (that all non-trivial zeros of the zeta function have real part one-half) is arguably the most important unsolved
More informationDivergent Series wear White Hats, too
Divergent Series wear White Hats, too J. B. Thoo 1 Department of Mathematics University of California Davis, CA 95616-8633 USA jb2@math.ucdavis.edu October 6, 1993 1 Student. Abstract Using divergent series,
More informationON THE TAYLOR COEFFICIENTS OF THE HURWITZ ZETA FUNCTION
ON THE TAYLOR COEFFICIENTS OF THE HURWITZ ZETA FUNCTION Khristo N. Boyadzhiev Department of Mathematics, Ohio Northern University, Ada, Ohio, 45810 k-boyadzhiev@onu.edu Abstract. We find a representation
More informationA number that can be written as, where p and q are integers and q Number.
RATIONAL NUMBERS 1.1 Definition of Rational Numbers: What are rational numbers? A number that can be written as, where p and q are integers and q Number. 0, is known as Rational Example:, 12, -18 etc.
More informationFirst, let me recall the formula I want to prove. Again, ψ is the function. ψ(x) = n<x
8.785: Analytic Number heory, MI, spring 007 (K.S. Kedlaya) von Mangoldt s formula In this unit, we derive von Mangoldt s formula estimating ψ(x) x in terms of the critical zeroes of the Riemann zeta function.
More informationarxiv: v1 [math.ho] 12 Sep 2008
arxiv:0809.2139v1 [math.ho] 12 Sep 2008 Constructing the Primitive Roots of Prime Powers Nathan Jolly September 12, 2008 Abstract We use only addition and multiplication to construct the primitive roots
More informationEstimates for probabilities of independent events and infinite series
Estimates for probabilities of independent events and infinite series Jürgen Grahl and Shahar evo September 9, 06 arxiv:609.0894v [math.pr] 8 Sep 06 Abstract This paper deals with finite or infinite sequences
More informationClassnotes - MA Series and Matrices
Classnotes - MA-2 Series and Matrices Department of Mathematics Indian Institute of Technology Madras This classnote is only meant for academic use. It is not to be used for commercial purposes. For suggestions
More informationClosed-form Second Solution to the Confluent Hypergeometric Difference Equation in the Degenerate Case
International Journal of Difference Equations ISS 973-669, Volume 11, umber 2, pp. 23 214 (216) http://campus.mst.edu/ijde Closed-form Second Solution to the Confluent Hypergeometric Difference Equation
More informationA Local-Global Principle for Diophantine Equations
A Local-Global Principle for Diophantine Equations (Extended Abstract) Richard J. Lipton and Nisheeth Vishnoi {rjl,nkv}@cc.gatech.edu Georgia Institute of Technology, Atlanta, GA 30332, USA. Abstract.
More information[Part 2] Asymmetric-Key Encipherment. Chapter 9. Mathematics of Cryptography. Objectives. Contents. Objectives
[Part 2] Asymmetric-Key Encipherment Mathematics of Cryptography Forouzan, B.A. Cryptography and Network Security (International Edition). United States: McGraw Hill, 2008. Objectives To introduce prime
More informationPELL S EQUATION NATIONAL INSTITUTE OF TECHNOLOGY ROURKELA, ODISHA
PELL S EQUATION A Project Report Submitted by PANKAJ KUMAR SHARMA In partial fulfillment of the requirements For award of the degree Of MASTER OF SCIENCE IN MATHEMATICS UNDER GUIDANCE OF Prof GKPANDA DEPARTMENT
More informationSection 6.3: Exponential Equations and Inequalities, from College Algebra: Corrected Edition by Carl Stitz, Ph.D. and Jeff Zeager, Ph.D.
Section 6.3: Exponential Equations and Inequalities, from College Algebra: Corrected Edition by Carl Stitz, Ph.D. and Jeff Zeager, Ph.D. is available under a Creative Commons Attribution-NonCommercial-
More informationMATH115. Infinite Series. Paolo Lorenzo Bautista. July 17, De La Salle University. PLBautista (DLSU) MATH115 July 17, / 43
MATH115 Infinite Series Paolo Lorenzo Bautista De La Salle University July 17, 2014 PLBautista (DLSU) MATH115 July 17, 2014 1 / 43 Infinite Series Definition If {u n } is a sequence and s n = u 1 + u 2
More informationName. Instructor K. Pernell 1. Berkeley City College Due: HW 4 - Chapter 11 - Infinite Sequences and Series. Write the first four terms of {an}.
Berkeley City College Due: HW 4 - Chapter 11 - Infinite Sequences and Series Name Write the first four terms of {an}. 1) an = (-1)n n 2) an = n + 1 3n - 1 3) an = sin n! 3 Determine whether the sequence
More informationOn Legendre s formula and distribution of prime numbers
On Legendre s formula and distribution of prime numbers To Hiroshi, Akiko, and Yuko Kazuo AKIYAMA Tatsuhiko NAGASAWA 1 Abstract The conclusion in this paper is based on the several idea obtained in recherché
More informationTHE HYPERBOLIC METRIC OF A RECTANGLE
Annales Academiæ Scientiarum Fennicæ Mathematica Volumen 26, 2001, 401 407 THE HYPERBOLIC METRIC OF A RECTANGLE A. F. Beardon University of Cambridge, DPMMS, Centre for Mathematical Sciences Wilberforce
More informationPostulate 2 [Order Axioms] in WRW the usual rules for inequalities
Number Systems N 1,2,3,... the positive integers Z 3, 2, 1,0,1,2,3,... the integers Q p q : p,q Z with q 0 the rational numbers R {numbers expressible by finite or unending decimal expansions} makes sense
More informationMath 160 Final Exam Info and Review Exercises
Math 160 Final Exam Info and Review Exercises Fall 2018, Prof. Beydler Test Info Will cover almost all sections in this class. This will be a 2-part test. Part 1 will be no calculator. Part 2 will be scientific
More informationGCE. Mathematics. Mark Scheme for June Advanced GCE Unit 4723: Core Mathematics 3. Oxford Cambridge and RSA Examinations
GCE Mathematics Advanced GCE Unit 7: Core Mathematics Mark Scheme for June 0 Oxford Cambridge and RSA Examinations OCR (Oxford Cambridge and RSA) is a leading UK awarding body, providing a wide range of
More informationNumerical Methods of Approximation
Contents 31 Numerical Methods of Approximation 31.1 Polynomial Approximations 2 31.2 Numerical Integration 28 31.3 Numerical Differentiation 58 31.4 Nonlinear Equations 67 Learning outcomes In this Workbook
More informationSemester 3 MULTIVARIATE CALCULUS AND INTEGRAL TRANSFORMS
PC 11 Semester 3 MT03C11 MULTIVARIATE CALCULUS AND INTEGRAL TRANSFORMS Text 1: Tom APOSTOL, Mathematical Analysis, Second edition, Narosa Publishing House. Text 2: WALTER RUDIN, Principles of Mathematical
More informationx arctan x = x x x x2 9 +
Math 1B Project 3 Continued Fractions. Many of the special functions that occur in the applications of mathematics are defined by infinite processes, such as series, integrals, and iterations. The continued
More informationA Geometric Proof that e is Irrational and a New Measure of its Irrationality
A Geometric Proof that e is Irrational and a New Measure of its Irrationality Jonathan Sondow. INTRODUCTION. While there exist geometric proofs of irrationality for 2 [2], [27], no such proof for e, π,
More information