Exact formulae for the prime counting function
|
|
- Ronald Snow
- 6 years ago
- Views:
Transcription
1 Notes on Number Theory and Discrete Mathematics Vol. 19, 013, No. 4, Exact formulae for the prime counting function Mladen Vassilev Missana 5 V. Hugo Str, 114 Sofia, Bulgaria missana@abv.bg Abstract: In the paper the following explicit formulae for the prime counting function π are proposed and proved: n = ( ) θ() ; n = ( ) 1, where τ is the number-of-divisors function, θ is either the sum-of-divisors function σ or Dedeind function ψ and is the floor function. Also an important general theorem (see Theorem 5) which gives an exact formula (depending on an arbitrary arithmetic function with strictly positive values, satisfying certain condition) for the prime counting function π is formulated and proved. This theorem generalizes all other main results in the paper. Keywords: Prime number, Composite number, Arithmetic function. AMS Classification: 11A5, 11A41. Used denotations denotes the floor function, i.e. x denotes the largest integer that is not greater than the real non-negative number x; σ denotes the so-called sum-of-divisor function, i.e. σ(1) = 1 and for integer n > 1 σ(n) = d, d n where d n means that the sum is taen over all divisors d of n; τ denotes the number-of-divisors function, i.e. τ(1) = 1 and for integer n > 1 τ(n) = d n 1; 77
2 ψ denotes Dedeind s function, i.e. ψ(1) = 1 and for integer n > 1 ψ(n) = n p n ( 1 1 ), p where p n means that the product is taen over all prime divisors p of n; π denotes the prime counting function, i.e. for any integer n, π(n) denotes the number of primes p, satisfying the inequality p n. 1 Preliminary results First, we need some results. Lemma 1. Let > 1 be a composite number. Then the inequality ψ() (1) Equality is only possible when = p, with p prime number. Proof. Let p be the minimal prime divisor of. Then p and from the obvious inequality ( ψ() 1 1 ) p we obtain ψ() p =. Hence (1) is proved. Equality is possible only for p =, i.e. for = p. Lemma 1 is proved. Since for composite 1 we have ψ() and for = p (p prime) we have > ψ(), the following result is obtained from Lemma 1: Lemma ( [1, p.180, Exercise 4]). Let > 1 be a composite number. Then the inequality > Lemma 3 ( [, p. 51, Problem 3.58]). Let > 6 be a composite number. Then the inequality > 78
3 From the above inequality we obtain Lemma 4. Let > 6 be a composite number. Then the inequality Further we need Lemma 5. Let > 1 be integer. Then the inequality e Proof. Let f(x) def = ( 1 x) 1 x. Then f is strictly monotonously increasing function in the interval (1, ) and lim f(x) = e 1. x ( ) def Let b = 1 1, =, 3, 4,.... From the mentioned above: b e 1. Hence, for any integer > 1 we have: and the lemma is proved. = ( ) = 1 = b e As a corollary from Lemma, Lemma 4 and Lemma 5 we obtain Lemma 6. Let > 6 be a composite number. Then the inequality Lemma 4 and Lemma 5 yield e Lemma 7. Let 8 be a composite number. Then the inequality From this we obtain () e (3) 79
4 Lemma 8. Let 8 be a composite number. Then the inequality Proof. The inequality ψ() implies: Hence ψ() e ψ() (4) 1 ψ() 1. ψ() ψ(). From (3) and from the last inequality, (4) follows and the lemma is proved. From Lemma 1 (see (1)) and from Lemma 8 (see (4)) we obtain Lemma 9. Let 8 be a composite number. Then the inequality e Lemma 9 suggests that the following assertion is true. Lemma 10. Let 4 be a composite number. Then the inequality e Proof. Let 4 be a composite number. Then ψ() (5) 1 1 (6) 3 = 0.(6) = e 1 41 e 1 1 and the proof of Lemma 10 is finished. 80
5 Main results Now we are ready to formulate and prove the first main result of the paper. Theorem 1. For any integer n the formula n = ( ) (7) is valid. Proof. Let n =, 3, 4, 5, 6, 7. Then the direct chec shows that (7) is true. Let n 8 be an integer. Since for prime we have = 1, we obtain n = ( ) ( ) σ(4) ( ) σ(6) = π(n) ( ). (8) 8 n From (8) it is seen that to prove the theorem it remains only to establish that: From () it follows that ( ) σ(4) ( ) σ(6) ( ) 1. (9) 8 n ( ) σ(4) ( ) σ(6) ( ) ( ) σ(4) ( ) σ(6) 8 n Therefore, to prove (9) it is enough to prove the inequality From the obvious relations e =8 7 ( ) σ(4) ( ) σ(6) e. =8 e 1. (10) =8 e d = t e t dt = ( 7)e 7 = , (11) 7 it follows that (10) will be proved if we establish that ( ) σ(4) ( ) σ(6) (1) But the left hand-side of (1) after computation yields Therefore (1) is proved. Hence, Theorem 1 is proved. As a Corollary from Lemma 9 we obtain the second main result of the paper 81
6 Theorem. For any integer n the formula n = ( ) ψ() (13) is valid. Proof. It uses the same ideas as the proof of Theorem 1. Let n =, 3, 4, 5, 6, 7. Then the direct chec shows that (13) is true. Let n 8 be an integer. Since for prime = 1, we obtain n = ( ) ψ() ( ) ψ(4) ( ) ψ(6) = π(n) ( ) ψ(). (14) 8 n Since (5) is true, (13) follows from (14) after establishing the inequality ( ) ψ(4) ( ) ψ(6) 8 n e 1. (15) Instead of (15) it is enough to prove that the inequality ( ) ψ(4) ( ) ψ(6) But (16) is certainly true if we establish the validity of the inequality: i.e. from (11), the validity of the inequality e 1 (16) =8 ( ) ψ(4) ( ) ψ(6) e d 1, 7 ( ) ψ(4) ( ) ψ(6) The direct computation shows that the left hand-side of the above inequality equals to Therefore, Theorem is proved. Let θ be either of the functions σ and ψ. Then Theorem 1 and Theorem may be rewritten in the following form. Theorem 3. For any integer n the formula n = ( ) θ() (17) is valid. 8
7 Since for integer 1 we have θ() > 1, then Theorem 3 is corollary from the following result: Theorem 4. For any integer n the formula is valid. n = ( ) 1 Proof. Let n =,..., 14. Then the direct chec shows that (18) is valid. Let an integer n satisfy the inequality n 15. Since for prime = 1, we obtain n = ( ) 1 ( =π(n) ) 3 ( ) 5 ( ) 7 ( ) 8 τ(8) τ(9) ( ) 13 ( ) 1. τ(14) ( ) 11 τ(1) Because of Lemma 10 (see (6)), we have: 15 n = ( ) 1 e ( 1) = e =15 =15 e e =15 = ( ) 1 14 e d = e On the other hand we have (after calculation): 4 14 Therefore, (0) and (1) yield: Now (19) and () yield (18) and Theorem 3 is proved. 15 n =15 e e d = =15 ( ) 9 τ(10) e 1 1 = (18) (19) ( 1 ) 14 e 1 14 = (0) ( ) 1 = (1) ( ) () As a generalization of all previous results we propose the following general theorem the forth main result of the paper which gives an exact formula (depending on an arbitrary arithmetic function with strictly positive values, satisfying certain condition) for the prime counting function π. 83
8 Theorem 5. Let f be an arithmetic function with strictly positive values and let there exist a composite number T (f) 4, such that the inequality 4 T (f) 1 Then for any integer n ( ) f() n = =T (f) e f() 1 1 (3) ( ) f(). (4) Remar 1. Further we suppose that T (f) is the minimal composite number satisfying (3). Remar. For T (f) = 4, (3) is reduced to the condition =T (f) e f() 1 1. Proof of the theorem. Let the integer n be arbitrarily chosen. We have n = ( ) f() = ( ) f() ( ) f(), (5) n - prime where the second sum in the right hand-side exists if and only if n 4. = 1 for prime, (5) becomes Since n = ( ) f() = π(n) ( ) f(). (6) Obviously for n 3 (4) is true. Let n 4 and T (f) is the number from condition (3) of Theorem 5 (see also Remar 1 and ). If n T (f), then (3) implies Therefore, (6) yields (4). Let n T (f). Then: ( ) f() 1. 84
9 4 T (f) 1 4 T (f) 1 ( ) f() = 4 T (f) 1 ( ) f() ( ) f() From the above relations the inequality T (f)= =T (f) ( ) f() T (f) n ( e f() 1. holds, because of (3). Now (6) and (7) imply (4) and Theorem 5 is proved. ( ) f() ) f() (because of Lemma 10) ( ) f() 1 (7) In conclusion we note that the present investigation is inspired by the formula: n =. The validity of the above formula is guaranteed by the fact that: References { 1 if is prime = 0 otherwise. [1] Sierpińsi, W. Elementary Number Theory, nd Edition, North Holland, Amsterdam, [] Mitrinović, D., M. Popadić. Inequalities in Number Theory. University of Niš,
MODIFICATIONS OF THE CONCEPT OF PERFECT NUMBER * Mladen Vassilev Vassilev-Missana, Krassimir Todorov Atanassov
МАТЕМАТИКА И МАТЕМАТИЧЕСКО ОБРАЗОВАНИЕ, 2002 MATHEMATICS AND EDUCATION IN MATHEMATICS, 2002 Proceedings of Thirty First Spring Conference of the Union of Bulgarian Mathematicians Borovets, April 3 6, 2002
More information2.2 Some Consequences of the Completeness Axiom
60 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.2 Some Consequences of the Completeness Axiom In this section, we use the fact that R is complete to establish some important results. First, we will prove that
More informationSOME RESULTS ON INFINITE POWER TOWERS
NNTDM 16 2010) 3, 18-24 SOME RESULTS ON INFINITE POWER TOWERS Mladen Vailev - Miana 5, V. Hugo Str., Sofia 1124, Bulgaria E-mail:miana@abv.bg Abtract To my friend Kratyu Gumnerov In the paper the infinite
More informationSection 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 informationOn the Iyengar Madhava Rao Nanjundiah inequality and its hyperbolic version
Notes on Number Theory and Discrete Mathematics Print ISSN 110 51, Online ISSN 67 875 Vol. 4, 018, No., 14 19 DOI: 10.7546/nntdm.018.4..14-19 On the Iyengar Madhava Rao Nanjundiah inequality and its hyperbolic
More informationThe Greatest Common Divisor of k Positive Integers
International Mathematical Forum, Vol. 3, 208, no. 5, 25-223 HIKARI Ltd, www.m-hiari.com https://doi.org/0.2988/imf.208.822 The Greatest Common Divisor of Positive Integers Rafael Jaimczu División Matemática,
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 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 informationCollatz cycles with few descents
ACTA ARITHMETICA XCII.2 (2000) Collatz cycles with few descents by T. Brox (Stuttgart) 1. Introduction. Let T : Z Z be the function defined by T (x) = x/2 if x is even, T (x) = (3x + 1)/2 if x is odd.
More informationInfinite Sequences of Real Numbers (AKA ordered lists) DEF. An infinite sequence of real numbers is a function f : N R.
Infinite Sequences of Real Numbers (AKA ordered lists) DEF. An infinite sequence of real numbers is a function f : N R. Usually (infinite) sequences are written as lists, such as, x n n 1, x n, x 1,x 2,x
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 informationSmol Results on the Möbius Function
Karen Ge August 3, 207 Introduction We will address how Möbius function relates to other arithmetic functions, multiplicative number theory, the primitive complex roots of unity, and the Riemann zeta function.
More informationNumerical Sequences and Series
Numerical Sequences and Series Written by Men-Gen Tsai email: b89902089@ntu.edu.tw. Prove that the convergence of {s n } implies convergence of { s n }. Is the converse true? Solution: Since {s n } is
More informationON THE SUM OF ELEMENT ORDERS OF FINITE ABELIAN GROUPS
ANALELE ŞTIINŢIFICE ALE UNIVERSITĂŢII AL.I. CUZA DIN IAŞI (S.N.) MATEMATICĂ, Tomul...,..., f... DOI: 10.2478/aicu-2013-0013 ON THE SUM OF ELEMENT ORDERS OF FINITE ABELIAN GROUPS BY MARIUS TĂRNĂUCEANU and
More informationApproximation of the attractor of a countable iterated function system 1
General Mathematics Vol. 17, No. 3 (2009), 221 231 Approximation of the attractor of a countable iterated function system 1 Nicolae-Adrian Secelean Abstract In this paper we will describe a construction
More informationOUTER MEASURES ON A COMMUTATIVE RING INDUCED BY MEASURES ON ITS SPECTRUM. Dariusz Dudzik, Marcin Skrzyński. 1. Preliminaries and introduction
Annales Mathematicae Silesianae 31 (2017), 63 70 DOI: 10.1515/amsil-2016-0020 OUTER MEASURES ON A COMMUTATIVE RING INDUCED BY MEASURES ON ITS SPECTRUM Dariusz Dudzik, Marcin Skrzyński Abstract. On a commutative
More informationTHE RELATION AMONG EULER S PHI FUNCTION, TAU FUNCTION, AND SIGMA FUNCTION
International Journal of Pure and Applied Mathematics Volume 118 No. 3 018, 675-684 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu doi: 10.173/ijpam.v118i3.15
More informationAnalysis III. Exam 1
Analysis III Math 414 Spring 27 Professor Ben Richert Exam 1 Solutions Problem 1 Let X be the set of all continuous real valued functions on [, 1], and let ρ : X X R be the function ρ(f, g) = sup f g (1)
More informationSums of distinct divisors
Oberlin College February 3, 2017 1 / 50 The anatomy of integers 2 / 50 What does it mean to study the anatomy of integers? Some natural problems/goals: Study the prime factors of integers, their size and
More information2. The Concept of Convergence: Ultrafilters and Nets
2. The Concept of Convergence: Ultrafilters and Nets NOTE: AS OF 2008, SOME OF THIS STUFF IS A BIT OUT- DATED AND HAS A FEW TYPOS. I WILL REVISE THIS MATE- RIAL SOMETIME. In this lecture we discuss two
More informationAdvanced Number Theory Note #6: Reformulation of the prime number theorem using the Möbius function 7 August 2012 at 00:43
Advanced Number Theory Note #6: Reformulation of the prime number theorem using the Möbius function 7 August 2012 at 00:43 Public One of the more intricate and tricky proofs concerning reformulations of
More information3.3 Accumulation Sequences
3.3. ACCUMULATION SEQUENCES 25 3.3 Accumulation Sequences Overview. One of the most important mathematical ideas in calculus is that of an accumulation of change for physical quantities. As we have been
More informationOn Descents in Standard Young Tableaux arxiv:math/ v1 [math.co] 3 Jul 2000
On Descents in Standard Young Tableaux arxiv:math/0007016v1 [math.co] 3 Jul 000 Peter A. Hästö Department of Mathematics, University of Helsinki, P.O. Box 4, 00014, Helsinki, Finland, E-mail: peter.hasto@helsinki.fi.
More informationFinite groups determined by an inequality of the orders of their subgroups
Finite groups determined by an inequality of the orders of their subgroups Tom De Medts Marius Tărnăuceanu November 5, 2007 Abstract In this article we introduce and study two classes of finite groups
More informationOn some inequalities between prime numbers
On some inequalities between prime numbers Martin Maulhardt July 204 ABSTRACT. In 948 Erdős and Turán proved that in the set of prime numbers the inequality p n+2 p n+ < p n+ p n is satisfied infinitely
More informationCYCLES AND FIXED POINTS OF HAPPY FUNCTIONS
Journal of Combinatorics and Number Theory Volume 2, Issue 3, pp. 65-77 ISSN 1942-5600 c 2010 Nova Science Publishers, Inc. CYCLES AND FIXED POINTS OF HAPPY FUNCTIONS Kathryn Hargreaves and Samir Siksek
More information2. Two binary operations (addition, denoted + and multiplication, denoted
Chapter 2 The Structure of R The purpose of this chapter is to explain to the reader why the set of real numbers is so special. By the end of this chapter, the reader should understand the difference between
More informationThe Chinese Remainder Theorem
The Chinese Remainder Theorem R. C. Daileda February 19, 2018 1 The Chinese Remainder Theorem We begin with an example. Example 1. Consider the system of simultaneous congruences x 3 (mod 5), x 2 (mod
More informationf(n) = f(p e 1 1 )...f(p e k k ).
3. Arithmetic functions 3.. Arithmetic functions. These are functions f : N N or Z or maybe C, usually having some arithmetic significance. An important subclass of such functions are the multiplicative
More informationNATIONAL UNIVERSITY OF SINGAPORE Department of Mathematics MA4247 Complex Analysis II Lecture Notes Part II
NATIONAL UNIVERSITY OF SINGAPORE Department of Mathematics MA4247 Complex Analysis II Lecture Notes Part II Chapter 2 Further properties of analytic functions 21 Local/Global behavior of analytic functions;
More informationMath 324, Fall 2011 Assignment 6 Solutions
Math 324, Fall 2011 Assignment 6 Solutions Exercise 1. (a) Find all positive integers n such that φ(n) = 12. (b) Show that there is no positive integer n such that φ(n) = 14. (c) Let be a positive integer.
More informationOn the distribution of consecutive square-free
On the distribution of consecutive square-free numbers of the form [n],[n]+ S. I. Dimitrov Faculty of Applied Mathematics and Informatics, Technical University of Sofia 8, St.Kliment Ohridsi Blvd. 756
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 informationON THE SUM OF DIVISORS FUNCTION
Annales Univ. Sci. Budapest., Sect. Comp. 40 2013) 129 134 ON THE SUM OF DIVISORS FUNCTION N.L. Bassily Cairo, Egypt) Dedicated to Professors Zoltán Daróczy and Imre Kátai on their 75th anniversary Communicated
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 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 informationOn the Partitions of a Number into Arithmetic Progressions
1 3 47 6 3 11 Journal of Integer Sequences, Vol 11 (008), Article 0854 On the Partitions of a Number into Arithmetic Progressions Augustine O Munagi and Temba Shonhiwa The John Knopfmacher Centre for Applicable
More informationELEMENTARY NUMBER THEORY AND METHODS OF PROOF
CHAPTER 4 ELEMENTARY NUMBER THEORY AND METHODS OF PROOF Copyright Cengage Learning. All rights reserved. SECTION 4.3 Direct Proof and Counterexample III: Divisibility Copyright Cengage Learning. All rights
More informationStandard forms for writing numbers
Standard forms for writing numbers In order to relate the abstract mathematical descriptions of familiar number systems to the everyday descriptions of numbers by decimal expansions and similar means,
More informationConvex Optimization Notes
Convex Optimization Notes Jonathan Siegel January 2017 1 Convex Analysis This section is devoted to the study of convex functions f : B R {+ } and convex sets U B, for B a Banach space. The case of B =
More informationGap Between Consecutive Primes By Using A New Approach
Gap Between Consecutive Primes By Using A New Approach Hassan Kamal hassanamal.edu@gmail.com Abstract It is nown from Bertrand s postulate, whose proof was first given by Chebyshev, that the interval [x,
More informationAny real-valued function on the integers f:n R (or complex-valued function f:n C) is called an arithmetic function.
Arithmetic Functions Any real-valued function on the integers f:n R (or complex-valued function f:n C) is called an arithmetic function. Examples: τ(n) = number of divisors of n; ϕ(n) = number of invertible
More informationAdditive Combinatorics Lecture 12
Additive Combinatorics Lecture 12 Leo Goldmakher Scribe: Gal Gross April 4th, 2014 Last lecture we proved the Bohr-to-gAP proposition, but the final step was a bit mysterious we invoked Minkowski s second
More informationNOTES ON EXISTENCE AND UNIQUENESS THEOREMS FOR ODES
NOTES ON EXISTENCE AND UNIQUENESS THEOREMS FOR ODES JONATHAN LUK These notes discuss theorems on the existence, uniqueness and extension of solutions for ODEs. None of these results are original. The proofs
More informationPRACTICE PROBLEMS: SET 1
PRACTICE PROBLEMS: SET MATH 437/537: PROF. DRAGOS GHIOCA. Problems Problem. Let a, b N. Show that if gcd(a, b) = lcm[a, b], then a = b. Problem. Let n, k N with n. Prove that (n ) (n k ) if and only if
More information2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
More informationEC9A0: Pre-sessional Advanced Mathematics Course. Lecture Notes: Unconstrained Optimisation By Pablo F. Beker 1
EC9A0: Pre-sessional Advanced Mathematics Course Lecture Notes: Unconstrained Optimisation By Pablo F. Beker 1 1 Infimum and Supremum Definition 1. Fix a set Y R. A number α R is an upper bound of Y if
More informationWeek 2: Sequences and Series
QF0: Quantitative Finance August 29, 207 Week 2: Sequences and Series Facilitator: Christopher Ting AY 207/208 Mathematicians have tried in vain to this day to discover some order in the sequence of prime
More informationD-MATH Algebra I HS18 Prof. Rahul Pandharipande. Solution 1. Arithmetic, Zorn s Lemma.
D-MATH Algebra I HS18 Prof. Rahul Pandharipande Solution 1 Arithmetic, Zorn s Lemma. 1. (a) Using the Euclidean division, determine gcd(160, 399). (b) Find m 0, n 0 Z such that gcd(160, 399) = 160m 0 +
More informationPart IX. Factorization
IX.45. Unique Factorization Domains 1 Part IX. Factorization Section IX.45. Unique Factorization Domains Note. In this section we return to integral domains and concern ourselves with factoring (with respect
More informationU e = E (U\E) e E e + U\E e. (1.6)
12 1 Lebesgue Measure 1.2 Lebesgue Measure In Section 1.1 we defined the exterior Lebesgue measure of every subset of R d. Unfortunately, a major disadvantage of exterior measure is that it does not satisfy
More informationSWFR ENG 4TE3 (6TE3) COMP SCI 4TE3 (6TE3) Continuous Optimization Algorithm. Convex Optimization. Computing and Software McMaster University
SWFR ENG 4TE3 (6TE3) COMP SCI 4TE3 (6TE3) Continuous Optimization Algorithm Convex Optimization Computing and Software McMaster University General NLO problem (NLO : Non Linear Optimization) (N LO) min
More informationOn the Largest Integer that is not a Sum of Distinct Positive nth Powers
On the Largest Integer that is not a Sum of Distinct Positive nth Powers arxiv:1610.02439v4 [math.nt] 9 Jul 2017 Doyon Kim Department of Mathematics and Statistics Auburn University Auburn, AL 36849 USA
More informationThe Vaught Conjecture Do uncountable models count?
The Vaught Conjecture Do uncountable models count? John T. Baldwin Department of Mathematics, Statistics and Computer Science University of Illinois at Chicago May 22, 2005 1 Is the Vaught Conjecture model
More informationMA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES
MA257: INTRODUCTION TO NUMBER THEORY LECTURE NOTES 2018 57 5. p-adic Numbers 5.1. Motivating examples. We all know that 2 is irrational, so that 2 is not a square in the rational field Q, but that we can
More informationOn a Balanced Property of Compositions
On a Balanced Property of Compositions Miklós Bóna Department of Mathematics University of Florida Gainesville FL 32611-8105 USA Submitted: October 2, 2006; Accepted: January 24, 2007; Published: March
More informationExponential triples. Alessandro Sisto. Mathematical Institute, St Giles, Oxford OX1 3LB, United Kingdom
Exponential triples Alessandro Sisto Mathematical Institute, 24-29 St Giles, Oxford OX1 3LB, United Kingdom sisto@maths.ox.ac.uk Submitted: Mar 6, 2011; Accepted: Jul 6, 2011; Published: Jul 15, 2011 Mathematics
More informationNotes on Equidistribution
otes on Equidistribution Jacques Verstraëte Department of Mathematics University of California, San Diego La Jolla, CA, 92093. E-mail: jacques@ucsd.edu. Introduction For a real number a we write {a} for
More informationA Combinatorial Bound on the List Size
1 A Combinatorial Bound on the List Size Yuval Cassuto and Jehoshua Bruck California Institute of Technology Electrical Engineering Department MC 136-93 Pasadena, CA 9115, U.S.A. E-mail: {ycassuto,bruck}@paradise.caltech.edu
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 informationE-SYMMETRIC NUMBERS (PUBLISHED: COLLOQ. MATH., 103(2005), NO. 1, )
E-SYMMETRIC UMBERS PUBLISHED: COLLOQ. MATH., 032005), O., 7 25.) GAG YU Abstract A positive integer n is called E-symmetric if there exists a positive integer m such that m n = φm), φn)). n is called E-asymmetric
More informationFinding Divisors, Number of Divisors and Summation of Divisors. Jane Alam Jan
Finding Divisors, Number of Divisors and Summation of Divisors by Jane Alam Jan Finding Divisors If we observe the property of the numbers, we will find some interesting facts. Suppose we have a number
More informationDivisibility. Chapter Divisors and Residues
Chapter 1 Divisibility Number theory is concerned with the properties of the integers. By the word integers we mean the counting numbers 1, 2, 3,..., together with their negatives and zero. Accordingly
More information2x 1 7. A linear congruence in modular arithmetic is an equation of the form. Why is the solution a set of integers rather than a unique integer?
Chapter 3: Theory of Modular Arithmetic 25 SECTION C Solving Linear Congruences By the end of this section you will be able to solve congruence equations determine the number of solutions find the multiplicative
More 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 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 informationOn the solvability of groups with four class sizes.
On the solvability of groups with four class sizes. Antonio Beltrán Departamento de Matemáticas, Universidad Jaume I, 12071 Castellón, Spain e-mail: abeltran@mat.uji.es and María José Felipe Instituto
More informationNotes on the second moment method, Erdős multiplication tables
Notes on the second moment method, Erdős multiplication tables January 25, 20 Erdős multiplication table theorem Suppose we form the N N multiplication table, containing all the N 2 products ab, where
More informationA class of Dirichlet series integrals
A class of Dirichlet series integrals J.M. Borwein July 3, 4 Abstract. We extend a recent Monthly problem to analyse a broad class of Dirichlet series, and illustrate the result in action. In [5] the following
More informationOn the Congruence ax + by 1 Modulo xy
On the Congruence ax + by Modulo xy J. Brzezińsi, W. Holsztyńsi, and P. Kurlberg CONTENTS. Introduction. Congruences. An Upper Bound 4. An Algorithm 5. Reduced Solutions 6. On the Rate of Growth of f (n)
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 informationON THE OSCILLATION OF THE SOLUTIONS TO LINEAR DIFFERENCE EQUATIONS WITH VARIABLE DELAY
Electronic Journal of Differential Equations, Vol. 008(008, No. 50, pp. 1 15. ISSN: 107-6691. URL: http://ejde.math.txstate.edu or http://ejde.math.unt.edu ftp ejde.math.txstate.edu (login: ftp ON THE
More informationA Gel fond type criterion in degree two
ACTA ARITHMETICA 111.1 2004 A Gel fond type criterion in degree two by Benoit Arbour Montréal and Damien Roy Ottawa 1. Introduction. Let ξ be any real number and let n be a positive integer. Defining the
More informationPart V. 17 Introduction: What are measures and why measurable sets. Lebesgue Integration Theory
Part V 7 Introduction: What are measures and why measurable sets Lebesgue Integration Theory Definition 7. (Preliminary). A measure on a set is a function :2 [ ] such that. () = 2. If { } = is a finite
More informationON A THREE TERM LINEAR DIFFERENCE EQUATION WITH COMPLEX COEFFICIENTS. 1. Introduction
t m Mathematical Publications DOI: 10.1515/tmmp-2015-0027 Tatra Mt. Math. Publ. 63 2015), 153 161 ON A THREE TERM LINEAR DIFFERENCE EQUATION WITH COMPLEX COEFFICIENTS Jiří Jánsý ABSTRACT. The paper discusses
More informationCHAPTER 3 REVIEW QUESTIONS MATH 3034 Spring a 1 b 1
. Let U = { A M (R) A = and b 6 }. CHAPTER 3 REVIEW QUESTIONS MATH 334 Spring 7 a b a and b are integers and a 6 (a) Let S = { A U det A = }. List the elements of S; that is S = {... }. (b) Let T = { A
More informationConvex Functions and Optimization
Chapter 5 Convex Functions and Optimization 5.1 Convex Functions Our next topic is that of convex functions. Again, we will concentrate on the context of a map f : R n R although the situation can be generalized
More information6. Duals of L p spaces
6 Duals of L p spaces This section deals with the problem if identifying the duals of L p spaces, p [1, ) There are essentially two cases of this problem: (i) p = 1; (ii) 1 < p < The major difference between
More informationfor all subintervals I J. If the same is true for the dyadic subintervals I D J only, we will write ϕ BMO d (J). In fact, the following is true
3 ohn Nirenberg inequality, Part I A function ϕ L () belongs to the space BMO() if sup ϕ(s) ϕ I I I < for all subintervals I If the same is true for the dyadic subintervals I D only, we will write ϕ BMO
More informationThe number of edge colorings with no monochromatic cliques
The number of edge colorings with no monochromatic cliques Noga Alon József Balogh Peter Keevash Benny Sudaov Abstract Let F n, r, ) denote the maximum possible number of distinct edge-colorings of a simple
More informationAn invariance result for Hammersley s process with sources and sinks
An invariance result for Hammersley s process with sources and sinks Piet Groeneboom Delft University of Technology, Vrije Universiteit, Amsterdam, and University of Washington, Seattle March 31, 26 Abstract
More informationON THE MOMENTS OF ITERATED TAIL
ON THE MOMENTS OF ITERATED TAIL RADU PĂLTĂNEA and GHEORGHIŢĂ ZBĂGANU The classical distribution in ruins theory has the property that the sequence of the first moment of the iterated tails is convergent
More informationConsequences of the Completeness Property
Consequences of the Completeness Property Philippe B. Laval KSU Today Philippe B. Laval (KSU) Consequences of the Completeness Property Today 1 / 10 Introduction In this section, we use the fact that R
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 informationPeter Kahn. Spring 2007
MATH 304: CONSTRUCTING THE REAL NUMBERS Peter Kahn Spring 2007 Contents 1 The Natural Numbers 1 1.1 The Peano Axioms............................ 2 1.2 Proof by induction............................ 4 1.3
More informationLecture 3 - Tuesday July 5th
Lecture 3 - Tuesday July 5th jacques@ucsd.edu Key words: Identities, geometric series, arithmetic series, difference of powers, binomial series Key concepts: Induction, proofs of identities 3. Identities
More informationCHAPTER III THE PROOF OF INEQUALITIES
CHAPTER III THE PROOF OF INEQUALITIES In this Chapter, the main purpose is to prove four theorems about Hardy-Littlewood- Pólya Inequality and then gives some examples of their application. We will begin
More informationPARTITIONS WITH FIXED DIFFERENCES BETWEEN LARGEST AND SMALLEST PARTS
PARTITIONS WITH FIXED DIFFERENCES BETWEEN LARGEST AND SMALLEST PARTS GEORGE E. ANDREWS, MATTHIAS BECK, AND NEVILLE ROBBINS Abstract. We study the number p(n, t) of partitions of n with difference t between
More informationPossible Group Structures of Elliptic Curves over Finite Fields
Possible Group Structures of Elliptic Curves over Finite Fields Igor Shparlinski (Sydney) Joint work with: Bill Banks (Columbia-Missouri) Francesco Pappalardi (Roma) Reza Rezaeian Farashahi (Sydney) 1
More informationProblem 3. Give an example of a sequence of continuous functions on a compact domain converging pointwise but not uniformly to a continuous function
Problem 3. Give an example of a sequence of continuous functions on a compact domain converging pointwise but not uniformly to a continuous function Solution. If we does not need the pointwise limit of
More informationA Proof of the Lucas-Lehmer Test and its Variations by Using a Singular Cubic Curve
1 47 6 11 Journal of Integer Sequences, Vol. 1 (018), Article 18.6. A Proof of the Lucas-Lehmer Test and its Variations by Using a Singular Cubic Curve Ömer Küçüksakallı Mathematics Department Middle East
More informationSupremum and Infimum
Supremum and Infimum UBC M0 Lecture Notes by Philip D. Loewen The Real Number System. Work hard to construct from the axioms a set R with special elements O and I, and a subset P R, and mappings A: R R
More informationMATH10040 Chapter 1: Integers and divisibility
MATH10040 Chapter 1: Integers and divisibility Recall the basic definition: 1. Divisibilty Definition 1.1. If a, b Z, we say that b divides a, or that a is a multiple of b and we write b a if there is
More informationIntroductory Analysis 2 Spring 2010 Exam 1 February 11, 2015
Introductory Analysis 2 Spring 21 Exam 1 February 11, 215 Instructions: You may use any result from Chapter 2 of Royden s textbook, or from the first four chapters of Pugh s textbook, or anything seen
More informationWe are now going to go back to the concept of sequences, and look at some properties of sequences in R
4 Lecture 4 4. Real Sequences We are now going to go back to the concept of sequences, and look at some properties of sequences in R Definition 3 A real sequence is increasing if + for all, and strictly
More informationOn the digital representation of smooth numbers
On the digital representation of smooth numbers Yann BUGEAUD and Haime KANEKO Abstract. Let b 2 be an integer. Among other results, we establish, in a quantitative form, that any sufficiently large integer
More information1 Basic Combinatorics
1 Basic Combinatorics 1.1 Sets and sequences Sets. A set is an unordered collection of distinct objects. The objects are called elements of the set. We use braces to denote a set, for example, the set
More informationComposite Numbers with Large Prime Factors
International Mathematical Forum, Vol. 4, 209, no., 27-39 HIKARI Ltd, www.m-hikari.com htts://doi.org/0.2988/imf.209.9 Comosite Numbers with Large Prime Factors Rafael Jakimczuk División Matemática, Universidad
More informationON THE NUMBER OF SUBSETS OF [1, M] RELATIVELY PRIME TO N AND ASYMPTOTIC ESTIMATES
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 8 (2008, #A41 ON THE NUMBER OF SUBSETS OF [1, M] RELATIVELY PRIME TO N AND ASYMPTOTIC ESTIMATES Mohamed El Bachraoui Department of Mathematical
More informationMosaics: A Prime-al Art
Mosaics: A Prime-al Art Kristen Bildhauser Saint Mary s College Notre Dame, IN 46556 kbildh01@saintmarys.edu Cara Tacoma Trinity Christian College Palos Heights, IL 60463 cara.tacoma@trnty.edu July 31,
More information