Study of some equivalence classes of primes
|
|
- Hester Wade
- 5 years ago
- Views:
Transcription
1 Notes on Number Theory and Discrete Mathematics Print ISSN 3-532, Online ISSN Vol 23, 27, No 2, 2 29 Study of some equivalence classes of primes Sadani Idir Department of Mathematics University of Mouloud Mammeri 5 Tizi-Ouzou, Algeria sadaniidir@yahoofr Received: 3 April 26 Accepted: 3 March 27 Abstract: In this paper, we introduce an equivalence relation on P for studying some specific classes of prime numbers This relation and the famous prime number theorem allows us to estimate the number of prime numbers of each equivalence class, the number of the different equivalence classes and to show some other results Keywords: Equivalence relation, Prime number theorem, Recurrence relation AMS Classification: A4 Introduction Let P be the set of prime numbers, and for all x R, let πx be the prime-counting function The prime number theorem which was proved independently by de la Vallée Poussin [], and Hadamard [2] in 896, states that: πx x, as x + ln x We can give an equivalent statement for this theorem as, for example, let p n denote the n-th prime number Then π n = p n n ln n as n + 2 We define the following functions: f n x = n times n times {}}{{}}{ f f fx and f n y = f f f y, 2
2 with f x = x and o is the composition operator The aim of this paper is to construct an equivalence relation on the set of primes, using the restriction of the prime-counting function π to P, for studying some classes of primes The following results illustrate asymptotic distribution of a number of functions that we have proposed 2 Main results We start with the following obvious lemma: Lemma 2 Let π be a restriction of π to P Then, π : P N is a bijection and its inverse is π : N P Remark Throughout this paper, we simply use the notation π to designate the restriction of π to the set P instead of using π The proof of the following theorem is obvious Theorem 2 We define the relation on the set of prime numbers P defined by: if p and q are two prime numbers, p q if and only if there exists n Z such that p = π n q Then, is an equivalence relation The elements of the equivalence class ṗ are defined by: ṗ = {, π 2 p, πp, p, π p, π 2 p, } 2 The smallest element p of ṗ is the prime number which verify πp is not prime and it is called origin of the class ṗ Example 3 = {2, 3, 5,, 3, 27, 79, 538, 527, } with origin the number 2 since π2 = is not a prime 7 = {7, 7, 59, 277, 787, } with origin the number 7 since π7 = 4 is not a prime Notation We denote by P x the set of all origins p x defined by: P x = {2, 7, 3, 9, 23, 29, 37, 43, 47, } And we denote simply by P the set of all origins p Theorem 22 Let A be a finite set of increasing sequence of consecutive primes defined by: A = {p i, i n and p = 5} Then, there exists at least one class ṗ A, p A, such that ṗ = {p} 22
3 Before giving the proof of this result, we give an illustrative example Example 2 Let A be a set which defined by A = {5, 7,, 3, 7} The class of the integer 5 is 5 = {5, } and its cardinality is greater than We notice that 7 / 5, therefore the integer 7 constitutes the origin of a new class which is 7 = {7, 7} and its cardinality is greater than It only remains to see that the prime number 3 does not belong to the classes 2 and 7 Thus the prime number 3 constitutes the origin of a new class 3 and clearly its cardinality is Proof of theorem 22 Assuming that each class p i, i n, containing at least two elements, and supposing that πp n is prime According to the prime number theorem, the interval [πp n, p n ] contains πp n π 2 p n = k prime numbers This leads to the two following cases: If k =, ie, there exists only one prime number in [πp n, p n ], namely q Therefore, we obtain π q / A and πq is not a prime number since πq and πp n are consecutive Then q contains only one element in A which is the prime number q If k >, ie, there exist at least two prime numbers in [πp n, p n ], namely q,, q k We suppose that q t, t {,, k}, is a prime number Then q t+ is not prime and since π q t+ / A, then, the unique element of q t+ is q t+ Finally, in both cases, there exist at least one class ṗ, p A, such that p is a unique element of this class in A, ie, ṗ = {p} The proof now is completed We have the following definition Definition Let A be the set defined as in the Theorem 22 and p is a prime number belonging to A We say that ṗ is an outside class of A, if πp is not prime in A and π p / A ie, ṗ = in A In the case where ṗ 2, we say that ṗ is an inside class of A Lemma 22 Let x n be a sequence defined by the recursive relation: x n+ = px n = xn ln x n, x e Proof Then px = e ln px i = e ln p i+ x, 3 We set ln ln x = ln 2 x and we have x = px = x ln x = ln x = ln x ln 2 x x 2 = px = x ln x = ln x 2 = ln x ln 2 x x n+ = px n = x n = ln x n+ = ln x n ln 2 x n ln x n 23
4 And combining all these, we obtain which is equivalent to Then, passing to the limit, we obtain lim n + Consequently, ln x n+ = ln px n = ln x x x = lim x n+ n px n = x x x n+ = n ln x i lim n + and since lim x n = e n + The formula 4 is obviously equivalent to px = e ln px i, which is the desired result n n ln 2 x i, n ln x i = lim ln x ln px i n e = ln x i = ln x ln px i, 4 Lemma 23 Let x > We define the number of prime numbers belonging to the class p less than or equal to x as follows π iter x, p = = p p x p p x p=π l p, l N Then, π iter x, p is approximately equal to the number of iterations n of the sequence x n+ = px n with x = x and the value of n verify x n p and x n+ < p, as x + Proof From the prime number theorem, we have πx px = x lnx, x πn x p n x, x Next, we can choose an integer n such that π n x = p with πp not a prime number, it follows that p p n x, x And, π iter x, p = = p p x p p x p=π l p p p x p p l p = nx,p l= = nx, p as x, such that nx, p is the number of iterations n which depends obviously on x and p 24
5 Theorem 23 Let x > We define the function ηx, p as follows: Then, we have ηx, p = ln ln p p p x, ηx, p ln x + oln x Proof In view of the proof of Lemma 23, we have, p = π n x p n x implies that, ln x which is equivalent to n ln ln x + ln ln πx i = ln ln x + n ln πx i ln x n ln ln πx i = Finally, for all fixed p and x, we have ln p / ln x, then ln ln p ln x + oln x ie, ηx, p ln x + oln x Theorem 24 We have, 2 Proof p p x, p p π iter x, p π iter x π iter x, p ηx, p ln ln x, x n ln px i x p = x p, ln ln p ln x ln p p p x, ln x ln x ln ln x + o, x ln ln x For the proof of the first formula, we have, on the one hand ηx, p = ln ln p ln ln x p p x, p p = π iterx, p ln ln x p p x, Then we obtain π iter x, p ηx, p ln ln x On the other hand, for all x > e, x δ > p with < δ <, we have ηx, p ln ln x δ x δ <p x, = ln δ + ln ln x x δ <p x, = ln δ + ln ln xπ iter x, p π iter x δ, p ln δ + ln ln xπ iter x, p ln x δ 25
6 Then π iter x, p ln x δ + ηx, p ln δ + ln ln x Now, according to Lemma 23, ln x δ = oπ iter x, p, and then for x sufficiently large depending on δ, ln x δ δπ iter x, p, and thus π iter x, p ηx, p δln δ + ln ln x Now, for all ɛ >, we can choose δ more near to, for this δ, so that /δ = + ɛ, and for x sufficiently large, we have 2 According to Theorem 23, we have π iter x, p ηx, p ln ln x ηx, p ln ln x π iter x, p < + ɛ ηx, p ln ln x ln x ln x ln ln x + o π iter x, x ln ln x Definition 2 Let x be a positive real number We denote by π c x the number of different classes ṗ such that 2 p x Precisely, π c x :=, p P p x 2 We denote by θ x the function defined by θ x = p x ln p Example 3 In the interval [2, ], the value 2 represents the origin of the class 2 but the values 3, 5, do not, since they belong to the same class 2 The value 7 represent the origin of the class 7 Thus in this case, we have π c x = 2 We have the following result: Theorem 25 We have, lim π cx = + x 2 Let p [2, x] Then π c x = πx ππx = πx π 2 x 5 Proof Suppose that the number of different classes is finite as x We know that 26 p i = 6
7 Next, let p k i p k, where k is finite by hypothesis We obtain = p i p k k< i Therefore, we have we deduce p k i which contradicts formula 6 <, and since the second sum has a finite number of terms, p k k< i <, 2 To find the value of π c x means that we estimate the number of origins p Clearly, the prime number p is an origin that means πp is not a prime number Then, let p be between 2 and x, and let p,x P be the greatest prime number in [2, x], therefore πp,x is not a prime number and for all integer l, π l πp,x + > p,x So, we only have to search the numbers which are not primes and less than πp,x Thus, we have The number of the even numbers less than or equal to p,x equal to πp,x 2 the number of the odd numbers less than or equal to p,x equal to πp,x ππp 2,x such that ππp,x is the number of the prime numbers less than or equal to p,x Next, we add the two quantities, we obtain, since p,x x, the quantity π c x which is equal to π c x = πx ππx We easily obtain the following consequence Corollary 2 Let p be a prime and suppose that p = π n p be an origin Then Proof We have n 2 p = πp π c π i p π c x = πx ππx π c πx = ππx ππ 2 x π c π n 2 x = ππ n x ππ n x Now, we add these equations together, we obtain the desired result For all initial value y e, we define the following sequence: y n+ = y n ln y n 7 This sequence is stationary for y = e and increasing divergent to infinite for y > e and as n It is clear that, inductively, y n y ln y ln y ln y = y ln y n, then we have the following consequence: 27
8 Lemma 24 We have, π c x ln 2 x + p x ln p = ln x where p represents the origin of the classes ṗ ln 2 x + θ x ln x, Proof Since for all p = p n, n >, we have p > p ln n p, then ln x ln p ln ln p ln ln p = ln ln p = ln ln p ln ln p p x p ln n p x,n p,n ln x ln p p x ln ln p p x According to the following formula we have ln x ln p = ln xπ iter x p x p x fp n x ln ln p p x fn x ln n 2 ln x, therefore, the inequality is obtained directly by substitution Proposition 2 We have, 2 x ln ln x θ x x ln x ln ln x ln x θ x x as x ln p ft dt 8 ln t ln x ln ln x 9 Proof We have πx ππx ln 2 x + p x ln p ln x p x ln p πx ππx ln x ln x Moreover, since And recalling that we obtain ln p p x p x x ln x ln p ln x = π c x ln x p x p x πx x ln x, x ln x = x ln xln x ln ln x ln x The second inequality is obtained in the same way, x ln p ln x ln x x ln xln x ln ln x 2 It is enough to tend x to + in the inequality 9 = x ln ln x ln x ln ln x ln x ln x ln ln x 28
9 3 Future work Our future work is to generalize this equivalence relation by introducing a new function with φ a bijection defined in N to N φ π : P N, 2 Study of the following hypothesis: let p P Suppose that the 2-tuple p, p + h are primes infinitely often for all h 2N Then, there exists at least an integer h among these integers h verify the following equation: πp + h πp = c infinitely often, such that πp + h and πp are primes and c < h fixed References [] De la Vallée Poussin, C J 896 Recherche analytique sur la théorie des nombres, Ann Soc Sci Bruxelle, 2, [2] Hadamard, J 896 Sur la distribution des zéros de la fonction ζs et ses conséquences arithmétiques, Bull Soc Math France, 24,
Section 11.1 Sequences
Math 152 c Lynch 1 of 8 Section 11.1 Sequences A sequence is a list of numbers written in a definite order: a 1, a 2, a 3,..., a n,... Notation. The sequence {a 1, a 2, a 3,...} can also be written {a
More informationarxiv: v1 [math.gm] 19 Jan 2017
ON THE PRIME COUNTING FUNCTION AND THE PARTIAL SUM OF RECIPROCALS OF ODD PRIMES MADIEYNA DIOUF arxiv:170105591v1 [mathgm] 19 Jan 017 Abstract We present a function that tests for primality, factorizes
More informationInduction. Induction. Induction. Induction. Induction. Induction 2/22/2018
The principle of mathematical induction is a useful tool for proving that a certain predicate is true for all natural numbers. It cannot be used to discover theorems, but only to prove them. If we have
More informationMATH 324 Summer 2011 Elementary Number Theory. Notes on Mathematical Induction. Recall the following axiom for the set of integers.
MATH 4 Summer 011 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
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 informationAn Asymptotic Formula for Goldbach s Conjecture with Monic Polynomials in Z[x]
An Asymptotic Formula for Goldbach s Conjecture with Monic Polynomials in Z[x] Mark Kozek 1 Introduction. In a recent Monthly note, Saidak [6], improving on a result of Hayes [1], gave Chebyshev-type estimates
More informationMath 324 Summer 2012 Elementary Number Theory Notes on Mathematical Induction
Math 4 Summer 01 Elementary Number Theory Notes on Mathematical Induction Principle of Mathematical Induction Recall the following axiom for the set of integers. Well-Ordering Axiom for the Integers If
More informationA Few New Facts about the EKG Sequence
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 11 (2008), Article 08.4.2 A Few New Facts about the EKG Sequence Piotr Hofman and Marcin Pilipczuk Department of Mathematics, Computer Science and Mechanics
More informationarxiv:math-ph/ v1 23 May 2000
arxiv:math-ph/0005024v1 23 May 2000 CERN TH/2000 146 THE SO-CALLED RENORMALIZATION GROUP METHOD APPLIED TO THE SPECIFIC PRIME NUMBERS LOGARITHMIC DECREASE A. Petermann TH Division, CERN CH - 1211 Geneva
More informationNotes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr.
Notes for Math 290 using Introduction to Mathematical Proofs by Charles E. Roberts, Jr. Chapter : Logic Topics:. Statements, Negation, and Compound Statements.2 Truth Tables and Logical Equivalences.3
More informationMATH FINAL EXAM REVIEW HINTS
MATH 109 - FINAL EXAM REVIEW HINTS Answer: Answer: 1. Cardinality (1) Let a < b be two real numbers and define f : (0, 1) (a, b) by f(t) = (1 t)a + tb. (a) Prove that f is a bijection. (b) Prove that any
More informationUpper Bounds for Partitions into k-th Powers Elementary Methods
Int. J. Contemp. Math. Sciences, Vol. 4, 2009, no. 9, 433-438 Upper Bounds for Partitions into -th Powers Elementary Methods Rafael Jaimczu División Matemática, Universidad Nacional de Luján Buenos Aires,
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 information(n = 0, 1, 2,... ). (2)
Bull. Austral. Math. Soc. 84(2011), no. 1, 153 158. ON A CURIOUS PROPERTY OF BELL NUMBERS Zhi-Wei Sun and Don Zagier Abstract. In this paper we derive congruences expressing Bell numbers and derangement
More informationAbelian and Tauberian Theorems: Philosophy
: Philosophy Bent E. Petersen Math 515 Fall 1998 Next quarter, in Mth 516, we will discuss the Tauberian theorem of Ikehara and Landau and its connection with the prime number theorem (among other things).
More informationarxiv: v1 [math.pr] 6 Jan 2014
Recurrence for vertex-reinforced random walks on Z with weak reinforcements. Arvind Singh arxiv:40.034v [math.pr] 6 Jan 04 Abstract We prove that any vertex-reinforced random walk on the integer lattice
More informationON THE POSSIBLE QUANTITIES OF FIBONACCI NUMBERS THAT OCCUR IN SOME TYPES OF INTERVALS
Acta Math. Univ. Comenianae Vol. LXXXVII, 2 (2018), pp. 291 299 291 ON THE POSSIBLE QUANTITIES OF FIBONACCI NUMBERS THAT OCCUR IN SOME TYPES OF INTERVALS B. FARHI Abstract. In this paper, we show that
More information#A87 INTEGERS 18 (2018) A NOTE ON FIBONACCI NUMBERS OF EVEN INDEX
#A87 INTEGERS 8 (208) A NOTE ON FIBONACCI NUMBERS OF EVEN INDEX Achille Frigeri Dipartimento di Matematica, Politecnico di Milano, Milan, Italy achille.frigeri@polimi.it Received: 3/2/8, Accepted: 0/8/8,
More informationPRIME-REPRESENTING FUNCTIONS
Acta Math. Hungar., 128 (4) (2010), 307 314. DOI: 10.1007/s10474-010-9191-x First published online March 18, 2010 PRIME-REPRESENTING FUNCTIONS K. MATOMÄKI Department of Mathematics, University of Turu,
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 informationThus f is continuous at x 0. Matthew Straughn Math 402 Homework 6
Matthew Straughn Math 402 Homework 6 Homework 6 (p. 452) 14.3.3, 14.3.4, 14.3.5, 14.3.8 (p. 455) 14.4.3* (p. 458) 14.5.3 (p. 460) 14.6.1 (p. 472) 14.7.2* Lemma 1. If (f (n) ) converges uniformly to some
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 informationVerbatim copying and redistribution of this document. are permitted in any medium provided this notice and. the copyright notice are preserved.
New Results on Primes from an Old Proof of Euler s by Charles W. Neville CWN Research 55 Maplewood Ave. West Hartford, CT 06119, U.S.A. cwneville@cwnresearch.com September 25, 2002 Revision 1, April, 2003
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 informationMATH 3300 Test 1. Name: Student Id:
Name: Student Id: There are nine problems (check that you have 9 pages). Solutions are expected to be short. In the case of proofs, one or two short paragraphs should be the average length. Write your
More informationMath 141: Lecture 19
Math 141: Lecture 19 Convergence of infinite series Bob Hough November 16, 2016 Bob Hough Math 141: Lecture 19 November 16, 2016 1 / 44 Series of positive terms Recall that, given a sequence {a n } n=1,
More informationYunhi Cho and Young-One Kim
Bull. Korean Math. Soc. 41 (2004), No. 1, pp. 27 43 ANALYTIC PROPERTIES OF THE LIMITS OF THE EVEN AND ODD HYPERPOWER SEQUENCES Yunhi Cho Young-One Kim Dedicated to the memory of the late professor Eulyong
More informationDivisibility in the Fibonacci Numbers. Stefan Erickson Colorado College January 27, 2006
Divisibility in the Fibonacci Numbers Stefan Erickson Colorado College January 27, 2006 Fibonacci Numbers F n+2 = F n+1 + F n n 1 2 3 4 6 7 8 9 10 11 12 F n 1 1 2 3 8 13 21 34 89 144 n 13 14 1 16 17 18
More informationPUTNAM PROBLEMS SEQUENCES, SERIES AND RECURRENCES. Notes
PUTNAM PROBLEMS SEQUENCES, SERIES AND RECURRENCES Notes. x n+ = ax n has the general solution x n = x a n. 2. x n+ = x n + b has the general solution x n = x + (n )b. 3. x n+ = ax n + b (with a ) can be
More informationMath 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 8 Solutions Please write neatly, and in complete sentences when possible.
Math 320: Real Analysis MWF pm, Campion Hall 302 Homework 8 Solutions Please write neatly, and in complete sentences when possible. Do the following problems from the book: 4.3.5, 4.3.7, 4.3.8, 4.3.9,
More information1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =
Chapter 5 Sequences and series 5. Sequences Definition 5. (Sequence). A sequence is a function which is defined on the set N of natural numbers. Since such a function is uniquely determined by its values
More informationTHE STRUCTURE OF A RING OF FORMAL SERIES AMS Subject Classification : 13J05, 13J10.
THE STRUCTURE OF A RING OF FORMAL SERIES GHIOCEL GROZA 1, AZEEM HAIDER 2 AND S. M. ALI KHAN 3 If K is a field, by means of a sequence S of elements of K is defined a K-algebra K S [[X]] of formal series
More informationADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS
ADVANCED CALCULUS - MTH433 LECTURE 4 - FINITE AND INFINITE SETS 1. Cardinal number of a set The cardinal number (or simply cardinal) of a set is a generalization of the concept of the number of elements
More informationThe 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 informationHomework #2 Solutions Due: September 5, for all n N n 3 = n2 (n + 1) 2 4
Do the following exercises from the text: Chapter (Section 3):, 1, 17(a)-(b), 3 Prove that 1 3 + 3 + + n 3 n (n + 1) for all n N Proof The proof is by induction on n For n N, let S(n) be the statement
More informationThe Degree of the Splitting Field of a Random Polynomial over a Finite Field
The Degree of the Splitting Field of a Random Polynomial over a Finite Field John D. Dixon and Daniel Panario School of Mathematics and Statistics Carleton University, Ottawa, Canada {jdixon,daniel}@math.carleton.ca
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 informationNOTES ON ZHANG S PRIME GAPS PAPER
NOTES ON ZHANG S PRIME GAPS PAPER TERENCE TAO. Zhang s results For any natural number H, let P (H) denote the assertion that there are infinitely many pairs of distinct primes p, q with p q H; thus for
More information. As the binomial coefficients are integers we have that. 2 n(n 1).
Math 580 Homework. 1. Divisibility. Definition 1. Let a, b be integers with a 0. Then b divides b iff there is an integer k such that b = ka. In the case we write a b. In this case we also say a is a factor
More informationSolutions to Homework 2
Solutions to Homewor Due Tuesday, July 6,. Chapter. Problem solution. If the series for ln+z and ln z both converge, +z then we can find the series for ln z by term-by-term subtraction of the two series:
More informationCourse 212: Academic Year Section 1: Metric Spaces
Course 212: Academic Year 1991-2 Section 1: Metric Spaces D. R. Wilkins Contents 1 Metric Spaces 3 1.1 Distance Functions and Metric Spaces............. 3 1.2 Convergence and Continuity in Metric Spaces.........
More informationChapter 5: The Integers
c Dr Oksana Shatalov, Fall 2014 1 Chapter 5: The Integers 5.1: Axioms and Basic Properties Operations on the set of integers, Z: addition and multiplication with the following properties: A1. Addition
More informationDiscrete dynamics on the real line
Chapter 2 Discrete dynamics on the real line We consider the discrete time dynamical system x n+1 = f(x n ) for a continuous map f : R R. Definitions The forward orbit of x 0 is: O + (x 0 ) = {x 0, f(x
More informationMATH 102 INTRODUCTION TO MATHEMATICAL ANALYSIS. 1. Some Fundamentals
MATH 02 INTRODUCTION TO MATHEMATICAL ANALYSIS Properties of Real Numbers Some Fundamentals The whole course will be based entirely on the study of sequence of numbers and functions defined on the real
More informationResults and conjectures related to a conjecture of Erdős concerning primitive sequences
Results and conjectures related to a conjecture of Erdős concerning primitive sequences arxiv:709.08708v2 [math.nt] 26 Nov 207 Bakir FARHI Laboratoire de Mathématiques appliquées Faculté des Sciences Exactes
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 informationFourier Series. 1. Review of Linear Algebra
Fourier Series In this section we give a short introduction to Fourier Analysis. If you are interested in Fourier analysis and would like to know more detail, I highly recommend the following book: Fourier
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 informationLecture 7. µ(x)f(x). When µ is a probability measure, we say µ is a stationary distribution.
Lecture 7 1 Stationary measures of a Markov chain We now study the long time behavior of a Markov Chain: in particular, the existence and uniqueness of stationary measures, and the convergence of the distribution
More informationarxiv: v1 [math.mg] 15 Jul 2013
INVERSE BERNSTEIN INEQUALITIES AND MIN-MAX-MIN PROBLEMS ON THE UNIT CIRCLE arxiv:1307.4056v1 [math.mg] 15 Jul 013 TAMÁS ERDÉLYI, DOUGLAS P. HARDIN, AND EDWARD B. SAFF Abstract. We give a short and elementary
More informationArithmetic Statistics Lecture 1
Arithmetic Statistics Lecture 1 Álvaro Lozano-Robledo Department of Mathematics University of Connecticut May 28 th CTNT 2018 Connecticut Summer School in Number Theory Question What is Arithmetic Statistics?
More informationFRESHMAN PRIZE EXAM 2017
FRESHMAN PRIZE EXAM 27 Full reasoning is expected. Please write your netid on your paper so we can let you know of your result. You have 9 minutes. Problem. In Extracurricula all of the high school students
More informationPM functions, their characteristic intervals and iterative roots
ANNALES POLONICI MATHEMATICI LXV.2(1997) PM functions, their characteristic intervals and iterative roots by Weinian Zhang (Chengdu) Abstract. The concept of characteristic interval for piecewise monotone
More informationSolutions to Assignment-11
Solutions to Assignment-. (a) For any sequence { } of positive numbers, show that lim inf + lim inf an lim sup an lim sup +. Show from this, that the root test is stronger than the ratio test. That is,
More information#A42 INTEGERS 10 (2010), ON THE ITERATION OF A FUNCTION RELATED TO EULER S
#A42 INTEGERS 10 (2010), 497-515 ON THE ITERATION OF A FUNCTION RELATED TO EULER S φ-function Joshua Harrington Department of Mathematics, University of South Carolina, Columbia, SC 29208 jh3293@yahoo.com
More informationExact formulae for the prime counting function
Notes on Number Theory and Discrete Mathematics Vol. 19, 013, No. 4, 77 85 Exact formulae for the prime counting function Mladen Vassilev Missana 5 V. Hugo Str, 114 Sofia, Bulgaria e-mail: missana@abv.bg
More informationFormulae for Computing Logarithmic Integral Function ( )!
Formulae for Computing Logarithmic Integral Function x 2 ln t Li(x) dt Amrik Singh Nimbran 6, Polo Road, Patna, INDIA Email: simnimas@yahoo.co.in Abstract: The prime number theorem states that the number
More informationPart II. Number Theory. Year
Part II Year 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2017 Paper 3, Section I 1G 70 Explain what is meant by an Euler pseudoprime and a strong pseudoprime. Show that 65 is an Euler
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 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 informationSubsequences and the Bolzano-Weierstrass Theorem
Subsequences and the Bolzano-Weierstrass Theorem A subsequence of a sequence x n ) n N is a particular sequence whose terms are selected among those of the mother sequence x n ) n N The study of subsequences
More informationSection 7.5: Cardinality
Section 7: Cardinality In this section, we shall consider extend some of the ideas we have developed to infinite sets One interesting consequence of this discussion is that we shall see there are as many
More informationON A PROBLEM OF PILLAI AND ITS GENERALIZATIONS
ON A PROBLEM OF PILLAI AND ITS GENERALIZATIONS L. HAJDU 1 AND N. SARADHA Abstract. We study some generalizations of a problem of Pillai. We investigate the existence of an integer M such that for m M,
More informationCopyright 2010 Pearson Education, Inc. Publishing as Prentice Hall.
.1 Limits of Sequences. CHAPTER.1.0. a) True. If converges, then there is an M > 0 such that M. Choose by Archimedes an N N such that N > M/ε. Then n N implies /n M/n M/N < ε. b) False. = n does not converge,
More informationAlgebra for error control codes
Algebra for error control codes EE 387, Notes 5, Handout #7 EE 387 concentrates on block codes that are linear: Codewords components are linear combinations of message symbols. g 11 g 12 g 1n g 21 g 22
More informationNotes on Systems of Linear Congruences
MATH 324 Summer 2012 Elementary Number Theory Notes on Systems of Linear Congruences In this note we will discuss systems of linear congruences where the moduli are all different. Definition. Given the
More informationSection II.1. Free Abelian Groups
II.1. Free Abelian Groups 1 Section II.1. Free Abelian Groups Note. This section and the next, are independent of the rest of this chapter. The primary use of the results of this chapter is in the proof
More informationANSWER TO A QUESTION BY BURR AND ERDŐS ON RESTRICTED ADDITION, AND RELATED RESULTS Mathematics Subject Classification: 11B05, 11B13, 11P99
ANSWER TO A QUESTION BY BURR AND ERDŐS ON RESTRICTED ADDITION, AND RELATED RESULTS N. HEGYVÁRI, F. HENNECART AND A. PLAGNE Abstract. We study the gaps in the sequence of sums of h pairwise distinct elements
More informationON THE CONTINUED FRACTION EXPANSION OF THE UNIQUE ROOT IN F(p) OF THE EQUATION x 4 + x 2 T x 1/12 = 0 AND OTHER RELATED HYPERQUADRATIC EXPANSIONS
ON THE CONTINUED FRACTION EXPANSION OF THE UNIQUE ROOT IN F(p) OF THE EQUATION x 4 + x 2 T x 1/12 = 0 AND OTHER RELATED HYPERQUADRATIC EXPANSIONS by A. Lasjaunias Abstract.In 1986, Mills and Robbins observed
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 informationGENERALIZED CANTOR SETS AND SETS OF SUMS OF CONVERGENT ALTERNATING SERIES
Journal of Applied Analysis Vol. 7, No. 1 (2001), pp. 131 150 GENERALIZED CANTOR SETS AND SETS OF SUMS OF CONVERGENT ALTERNATING SERIES M. DINDOŠ Received September 7, 2000 and, in revised form, February
More informationk-protected VERTICES IN BINARY SEARCH TREES
k-protected VERTICES IN BINARY SEARCH TREES MIKLÓS BÓNA Abstract. We show that for every k, the probability that a randomly selected vertex of a random binary search tree on n nodes is at distance k from
More informationMATH115. Sequences and Infinite Series. Paolo Lorenzo Bautista. June 29, De La Salle University. PLBautista (DLSU) MATH115 June 29, / 16
MATH115 Sequences and Infinite Series Paolo Lorenzo Bautista De La Salle University June 29, 2014 PLBautista (DLSU) MATH115 June 29, 2014 1 / 16 Definition A sequence function is a function whose domain
More informationInfinite Continued Fractions
Infinite Continued Fractions 8-5-200 The value of an infinite continued fraction [a 0 ; a, a 2, ] is lim c k, where c k is the k-th convergent k If [a 0 ; a, a 2, ] is an infinite continued fraction with
More informationOn the Composite Terms in Sequence Generated from Mersenne-type Recurrence Relations
On the Composite Terms in Sequence Generated from Mersenne-type Recurrence Relations Pingyuan Zhou E-mail:zhoupingyuan49@hotmail.com Abstract We conjecture that there is at least one composite term in
More information2017 HSC Mathematics Extension 1 Marking Guidelines
07 HSC Mathematics Extension Marking Guidelines Section I Multiple-choice Answer Key Question Answer A B 3 B 4 C 5 D 6 D 7 A 8 C 9 C 0 B NESA 07 HSC Mathematics Extension Marking Guidelines Section II
More informationMath 118B Solutions. Charles Martin. March 6, d i (x i, y i ) + d i (y i, z i ) = d(x, y) + d(y, z). i=1
Math 8B Solutions Charles Martin March 6, Homework Problems. Let (X i, d i ), i n, be finitely many metric spaces. Construct a metric on the product space X = X X n. Proof. Denote points in X as x = (x,
More informationContribution of Problems
Exam topics 1. Basic structures: sets, lists, functions (a) Sets { }: write all elements, or define by condition (b) Set operations: A B, A B, A\B, A c (c) Lists ( ): Cartesian product A B (d) Functions
More informationConsider an infinite row of dominoes, labeled by 1, 2, 3,, where each domino is standing up. What should one do to knock over all dominoes?
1 Section 4.1 Mathematical Induction Consider an infinite row of dominoes, labeled by 1,, 3,, where each domino is standing up. What should one do to knock over all dominoes? Principle of Mathematical
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More informationMathematical Reasoning Rules of Inference & Mathematical Induction. 1. Assign propositional variables to the component propositional argument.
Mathematical Reasoning Rules of Inference & Mathematical Induction Example. If I take the day off it either rains or snows 2. When It rains, my basement floods 3. When the basement floods or it snows,
More informationCSCE 222 Discrete Structures for Computing. Dr. Hyunyoung Lee
CSCE 222 Discrete Structures for Computing Sequences and Summations Dr. Hyunyoung Lee Based on slides by Andreas Klappenecker 1 Sequences 2 Sequences A sequence is a function from a subset of the set of
More informationOscillation Criteria for Delay Neutral Difference Equations with Positive and Negative Coefficients. Contents
Bol. Soc. Paran. Mat. (3s.) v. 21 1/2 (2003): 1 12. c SPM Oscillation Criteria for Delay Neutral Difference Equations with Positive and Negative Coefficients Chuan-Jun Tian and Sui Sun Cheng abstract:
More informationHomework 4, 5, 6 Solutions. > 0, and so a n 0 = n + 1 n = ( n+1 n)( n+1+ n) 1 if n is odd 1/n if n is even diverges.
2..2(a) lim a n = 0. Homework 4, 5, 6 Solutions Proof. Let ɛ > 0. Then for n n = 2+ 2ɛ we have 2n 3 4+ ɛ 3 > ɛ > 0, so 0 < 2n 3 < ɛ, and thus a n 0 = 2n 3 < ɛ. 2..2(g) lim ( n + n) = 0. Proof. Let ɛ >
More informationMULTIPLICATIVE SEMIGROUPS RELATED TO THE 3x +1 PROBLEM. 1. Introduction The 3x +1iteration is given by the function on the integers for x even 3x+1
MULTIPLICATIVE SEMIGROUPS RELATED TO THE 3x + PROBLEM ANA CARAIANI Abstract. Recently Lagarias introduced the Wild semigroup, which is intimately connected to the 3x + Conjecture. Applegate and Lagarias
More informationThe Fundamental Theorem of Arithmetic
Chapter 1 The Fundamental Theorem of Arithmetic 1.1 Primes Definition 1.1. We say that p N is prime if it has just two factors in N, 1 and p itself. Number theory might be described as the study of the
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 informationLegendre s Equation. PHYS Southern Illinois University. October 18, 2016
Legendre s Equation PHYS 500 - Southern Illinois University October 18, 2016 PHYS 500 - Southern Illinois University Legendre s Equation October 18, 2016 1 / 11 Legendre s Equation Recall We are trying
More informationMath 127 Homework. Mary Radcliffe. Due 29 March Complete the following problems. Fully justify each response.
Math 17 Homework Mary Radcliffe Due 9 March 018 Complete the following problems Fully justify each response NOTE: due to the Spring Break, this homework set is a bit longer than is typical You only need
More informationA prospect proof of the Goldbach s conjecture
A prospect proof of the Goldbach s conjecture Douadi MIHOUBI LMPA, the University of M sila, 28000 M sila, Algeria mihoubi_douadi@yahoofr March 21, 2015 Abstract Based on, the well-ordering (N;
More informationMATH 301 INTRO TO ANALYSIS FALL 2016
MATH 301 INTRO TO ANALYSIS FALL 016 Homework 04 Professional Problem Consider the recursive sequence defined by x 1 = 3 and +1 = 1 4 for n 1. (a) Prove that ( ) converges. (Hint: show that ( ) is decreasing
More informationIntroduction to Dynamical Systems
Introduction to Dynamical Systems France-Kosovo Undergraduate Research School of Mathematics March 2017 This introduction to dynamical systems was a course given at the march 2017 edition of the France
More informationCtanujit Classes Of Mathematics Statistics & Economics. Study Notes On Number Theory
Ctanujit Classes Of Mathematics Statistics & Economics Study Notes On Number Theory 1 DIVISIBILITY 1 1 Divisibility Definition 1.1 An integer b is divisible by an integer a, written a b, if there is an
More informationMATH 117 LECTURE NOTES
MATH 117 LECTURE NOTES XIN ZHOU Abstract. This is the set of lecture notes for Math 117 during Fall quarter of 2017 at UC Santa Barbara. The lectures follow closely the textbook [1]. Contents 1. The set
More information,... We would like to compare this with the sequence y n = 1 n
Example 2.0 Let (x n ) n= be the sequence given by x n = 2, i.e. n 2, 4, 8, 6,.... We would like to compare this with the sequence = n (which we know converges to zero). We claim that 2 n n, n N. Proof.
More informationBulletin of the Iranian Mathematical Society
ISSN: 117-6X (Print) ISSN: 1735-8515 (Online) Bulletin of the Iranian Mathematical Society Vol. 4 (14), No. 6, pp. 1491 154. Title: The locating chromatic number of the join of graphs Author(s): A. Behtoei
More informationMATH 56A: STOCHASTIC PROCESSES CHAPTER 2
MATH 56A: STOCHASTIC PROCESSES CHAPTER 2 2. Countable Markov Chains I started Chapter 2 which talks about Markov chains with a countably infinite number of states. I did my favorite example which is on
More informationSome Results Concerning Uniqueness of Triangle Sequences
Some Results Concerning Uniqueness of Triangle Sequences T. Cheslack-Postava A. Diesl M. Lepinski A. Schuyler August 12 1999 Abstract In this paper we will begin by reviewing the triangle iteration. We
More informationCHAPTER 8: EXPLORING R
CHAPTER 8: EXPLORING R LECTURE NOTES FOR MATH 378 (CSUSM, SPRING 2009). WAYNE AITKEN In the previous chapter we discussed the need for a complete ordered field. The field Q is not complete, so we constructed
More informationCalculus II : Prime suspect
Calculus II : Prime suspect January 31, 2007 TEAM MEMBERS An integer p > 1 is prime if its only positive divisors are 1 and p. In his 300 BC masterpiece Elements Euclid proved that there are infinitely
More information