#A52 INTEGERS 15 (2015) AN IMPROVED UPPER BOUND FOR RAMANUJAN PRIMES
|
|
- Garey Houston
- 5 years ago
- Views:
Transcription
1 #A5 INTEGERS 15 (015) AN IMPROVED UPPER BOUND FOR RAMANUJAN PRIMES Anitha Srinivasan Dept. of Mathematics, Saint Louis University Madrid Campus, Madrid, Spain John W. Nicholson Decatur, Mississippi Received: 1//14, Revised: 10/8/15, Accepted: 1//15, Published: 1/11/15 Abstract For n 1, the n th Ramanujan prime is defined as the least positive inteer R n such that for all x R n, the interval ( x, x] has at least n primes. If = n 1 +, then we show that R n < p [ ] for all n > 41, where p i lo n + lo n 4 is the i th prime. This bound improves upon all previous bounds for lare n. 1. Introduction For n 1, the n th Ramanujan prime is defined as the least positive inteer R n, such that for all x R n, the interval ( x, x] has at least n primes. Note that by the minimality condition, R n is prime and the interval ( Rn, R n] contains exactly n primes. Let p n denote the n th prime. Sondow [] showed that p n < R n < p 4n for all n and conjectured that R n < p n for all n. This conjecture was proved by Laishram [] and subsequently Sondow, Nicholson and Noe [4] improved Laishram s result by showin that R n < p n. Axler [1, Proposition.4] showed that for t > we have R n apple p [tn] for all n, where [x] denotes the inteer part of x. In [5] it was shown that for every > 0, there exists an inteer N such that R n < p [n(1+ )] for all n > N. Our main result below ives a new upper bound that, for lare n, is better than all previous bounds. Theorem 1. Let R n = p s be the n th Ramanujan prime, where p s is the s th prime. Then s < n 1 + lo n+lo(lo n) 4 for all n > 41. Note that while all previous upper bounds for R n are of the form of p [nc], where c > 1 is a constant, the bound iven in the theorem above is of the form p [nf(n)], where f(n) > 1 and lim n!1 f(n) = 1. Hence for lare n our bound is smaller and thus better than p [nc] for any fixed c.
2 INTEGERS: 15 (015). Proof of Theorem 1 The proof follows closely the proof of the main theorem in [5], where the followin function was defined. Let F (x) = x(lo x + lo lo x) (x n)(lo(x n) + lo lo(x n) 1), where n is a fixed positive inteer. Henceforth we denote lo(lo n) by lo n. Also, let (x) denote the number of primes less than or equal to x. In [5] we showed that for a Ramanujan prime R n = p s we have p s n < ps. A similar result, with the inequality reversed, holds for indices reater than s. We include both of these results in the followin lemma, which while not used directly in the proofs here, is of independent interest and relevant to the current topic. The result in the second part of the lemma has been dubbed as the Ramanujan prime corollary by the second author (see the first three sequences and last sequence iven in Table 1 of the Appendix). Lemma 1. Let R n = p s be the n th Ramanujan prime, where p s is the s th prime. Then the followin hold: (i) p s n < ps for all n. [5, Lemma.1]. (ii) p s+k < p s+k n for all positive inteers k. Proof. Let i = s + k. Note that by definition of R n we have pi pi 1 (p i 1) = (p i 1) n. Therefore, p i 1 p i 1 > p i > p i >... > p i n > pi, and hence p i n > pi and the second part of the lemma follows notin that i = s + k. Lemma. Let R n = p s be the n th Ramanujan prime, where p s is the s th prime. Then the followin hold: (i) n < s < n ([, ]). (ii) F (s) > 0 and F (x) is a decreasin function for all x 1.1]. n [5, Proof of Theorem Lemma. Let = (n) = lo n + lo n 4. Then for all n > 41 we have F n (n) < 0. Proof. We first observe that for n > 41 we have > 1. Let = lo n lo n 1 + 1
3 INTEGERS: 15 (015) and = lo n lo n Observe that = 1 + lo + lo! lo 1 n + n A lo n + n < + lo <, 1+ 1 lo(n+ as lo < 0 and 0 < lo ) < 1. Therefore, 1+ lo(n+ n ) = ( ) > and hence > > lo n + lo n 4 =, which ives and the lemma follows as F < 1 +, n = n n 1 +. Proof of Theorem 1 Let R n = p s. Then by Lemma, part (i), we have s > n and F (s) > 0. Moreover, by Lemma, part (ii), F (x) is a decreasin function for x n. Let = (n) = lo n+lo n 4 and = n(1 + 1 ). Then by Lemma we have F ( ) < 0 for all n > 41. As F is a decreasin function for x n and F (s) > 0, we have s apple n(1 + 1 ) for all n > 41. References [1] C. Axler, On eneralized Ramanujan primes, Arxiv: v1. [] S. Laishram, On a conjecture on Ramanujan primes, Int. J. Number Theory 6, (010), [] J. Sondow, Ramanujan primes and Bertrand s postulate, Amer. Math. Monthly 116, (009), [4] J. Sondow, J. W. Nicholson, T. D. Noe, Ramanujan primes: bounds, runs, twins, and aps, J. Inteer Sequences 14, (011), Article [5] A. Srinivasan, An upper bound for Ramanujan primes, Inteers 14 (014).
4 INTEGERS: 15 (015) 4 Appendix: Tables of Sequences from the OEIS at Sequence Title A Size of the rane of the Ramanujan Prime Corollary, *A16841(n) - A1047(n). A16841 Small Associated Ramanujan Prime, p i n. A16845 Lare Associated Ramanujan Prime, p i. A17460 Smallest prime that beins a run of n Ramanujan primes that are consecutive primes. A17465 A Prime numbers that are not Ramanujan primes. Smallest prime that beins a run of n consecutive primes that are not Ramanujan primes. A Number of primes up to the n th Ramanujan prime: A19014 A00070(A1047(n)), (R n). Decimal expansion of Ramanujan prime constant: P 1 n=1 1/R n, where R n is the n th Ramanujan prime, A1047(n). A1900 Decimal expansion of sum of alternatin series of reciprocals of Ramanujan primes, P 1 n=1 (1/Rn)( 1)n 1, where R n is the n th Ramanujan prime, A1047(n). A Number of Ramanujan primes R k such that (n 1) < R k apple n. A19050 Number of Ramanujan primes apple n. A First di erences of A179196, (R (n+1) ) (R n) where R n is A1047(n). A1915 Number of Ramanujan primes R k between trianular numbers T (n 1) < R k apple T (n). A1916 First occurrence of number n of Ramanujan primes in A1915. A1917 Last known occurrence of number n of Ramanujan primes in A1915. A1918 Greatest Ramanujan prime index less than x. A14756 a(n) = larest Ramanujan prime R k in A1047 that is apple A0086(n). A14757 a(n) = smallest Ramanujan prime R k in A1047 that is A000101(n). A1496 Di erence A1495(n) - A1494(n), prime count between Ramanujan primes boundin maximal ap primes. A1494 Numbers R(k) such that R(k) k lo R(k), where R(k) = A1047(k) is the k th Ramanujan prime. A79 R(n) p(n), where R(n) is the n th Ramanujan prime and p(n) is the n th prime.. A498 Ramanujan prime R k such that (R k+1 ) (R k ) are record values: record Ramanujan prime A190874(k). Table 1: Sequences authored by John W. Nicholson
5 INTEGERS: 15 (015) 5 Sequence Title Comments A Increasin aps between primes (upper end) (compare with A0086, which ives lower ends of these aps). A0058 Primes p such that p 1 is also prime. Except for a(1)= and a()=5, a(n) = A16841(k). Primes and 5 are special in that they are the only primes which do not have a Ramanujan prime between them and their double, apple 6 and 10 respectively. Because of the lare size of a ap, there are many repeats of the prime number in A John W. Nicholson, Dec If a(n) is in A16841 then A0058(n) is a twin prime with a Ramanujan prime, A0058(n) -. If this sequence has an infinite number of terms in A16841, then the twin prime conjecture can be proved. - John W. Nicholson, Dec A1047 A Ramanujan primes R n: a(n) is the smallest number such that if x apple a(n), then (x) (x/) apple n, where (x) is the number of primes apple x. Least number a(n) such that there are at least n primes in the rane (T (k 1), T (k)] for all k a(n), where T(k) is the k-th trianular number. For some n and k, we see that A16841(k) = a(n) so as to form a chain of primes similar to a Cunninham chain. For example (and the first example), A16841() = 7, links a() = 11 = A16841(), links a() = 17 = A16841(4), links a(4) = 9 = A16841(6), links a(6) = 47. Note that the links do not have to be of a form like q = *p+1 or q = *p-1. - John W. Nicholson, Feb 015 With R n the n-th Ramanujan prime (A1047), it is conjectured that for every n 0, (1/)R n apple a(n) < (0/1)R n. These bounds have been verified for all n up to For most n apple 8000, we have a(n) > R n, with exceptions listed in A Table : Observations (four sequences)
6 INTEGERS: 15 (015) 6 Sequence Title A04814 Number of decompositions of n into an unordered sum of two Ramanujan primes. A05616 Even numbers that are not the sum of two non-ramanujan primes (A17465). COMMENTS: No other terms < Conjectured to be complete. A05617 Number of decompositions of n into an unordered sum of two non- Ramanujan primes (A17465). A05618 Last occurrence of n partitions in A Table : Authored by (or suested by) John W. Nicholson and Donovan Johnson (4 sequences). Note: All are related to Goldbach conjecture.
Introduction 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 informationGoldbach and twin prime conjectures implied by strong Goldbach number sequence
Goldbach and twin prime conjectures implied by strong Goldbach number sequence Pingyuan Zhou E-mail:zhoupingyuan49@hotmail.com Abstract In this note, we present a new and direct approach to prove the Goldbach
More information7. Prime Numbers Part VI of PJE
7. Prime Numbers Part VI of PJE 7.1 Definition (p.277) A positive integer n is prime when n > 1 and the only divisors are ±1 and +n. That is D (n) = { n 1 1 n}. Otherwise n > 1 is said to be composite.
More informationAnalytic. Number Theory. Exploring the Anatomy of Integers. Jean-Marie. De Koninck. Florian Luca. ffk li? Graduate Studies.
Analytic Number Theory Exploring the Anatomy of Integers Jean-Marie Florian Luca De Koninck Graduate Studies in Mathematics Volume 134 ffk li? American Mathematical Society Providence, Rhode Island Preface
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 informationOn the Foundamental Theorem in Arithmetic. Progession of Primes
On the Foundamental Theorem in Arithmetic roession of rimes Chun-Xuan ian. O. Box 9 Beijin 008. R. China jianchunxuan@vip.sohu.com Abstract Usin ian function we prove the foundamental theorem in arithmetic
More informationarxiv: v1 [math.gm] 1 Oct 2015
A WINDOW TO THE CONVERGENCE OF A COLLATZ SEQUENCE arxiv:1510.0174v1 [math.gm] 1 Oct 015 Maya Mohsin Ahmed maya.ahmed@gmail.com Accepted: Abstract In this article, we reduce the unsolved problem of convergence
More informationA formula for pi involving nested radicals
arxiv:60.0773v [math.gm] 7 Apr 08 A formula for pi involving nested radicals S. M. Abrarov and B. M. Quine April 7, 08 Abstract We present a new formula for pi involving nested radicals with rapid convergence.
More information1 x i. i=1 EVEN NUMBERS RAFAEL ARCE-NAZARIO, FRANCIS N. CASTRO, AND RAÚL FIGUEROA
Volume, Number 2, Pages 63 78 ISSN 75-0868 ON THE EQUATION n i= = IN DISTINCT ODD OR EVEN NUMBERS RAFAEL ARCE-NAZARIO, FRANCIS N. CASTRO, AND RAÚL FIGUEROA Abstract. In this paper we combine theoretical
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 informationProbabilistic Aspects of the Integer-Polynomial Analogy
Probabilistic Aspects of the Integer-Polynomial Analogy Kent E. Morrison Department of Mathematics California Polytechnic State University San Luis Obispo, CA 93407 kmorriso@calpoly.edu Zhou Dong Department
More informationDefinition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively
6 Prime Numbers Part VI of PJE 6.1 Fundamental Results Definition 6.1 (p.277) A positive integer n is prime when n > 1 and the only positive divisors are 1 and n. Alternatively D (p) = { p 1 1 p}. Otherwise
More informationJonathan Sondow 209 West 97th Street Apt 6F New York, NY USA
Which Partial Sums of the Taylor Series for e Are Convergents to e? (and a Link to the Primes 2, 5, 13, 37, 463,...) arxiv:0709.0671v1 [math.nt] 5 Sep 2007 Jonathan Sondow 209 West 97th Street Apt 6F New
More informationOn the prime divisors of elements of a D( 1) quadruple
arxiv:1309.4347v1 [math.nt] 17 Sep 2013 On the prime divisors of elements of a D( 1) quadruple Anitha Srinivasan Abstract In [4] it was shown that if {1,b,c,d} is a D( 1) quadruple with b < c < d and b
More informationHIGHER-ORDER DIFFERENCES AND HIGHER-ORDER PARTIAL SUMS OF EULER S PARTITION FUNCTION
ISSN 2066-6594 Ann Acad Rom Sci Ser Math Appl Vol 10, No 1/2018 HIGHER-ORDER DIFFERENCES AND HIGHER-ORDER PARTIAL SUMS OF EULER S PARTITION FUNCTION Mircea Merca Dedicated to Professor Mihail Megan on
More informationarxiv: v1 [math.nt] 10 Dec 2009
Ford circles, continued fractions, and best approximation of the second kind arxiv:092.997v [math.nt] 0 Dec 2009 Ian Short Centre for Mathematical Sciences Wilberforce Road Cambridge CB3 0WB United Kingdom
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 informationA proof of strong Goldbach conjecture and twin prime conjecture
A proof of strong Goldbach conjecture and twin prime conjecture Pingyuan Zhou E-mail:zhoupingyuan49@hotmail.com Abstract In this paper we give a proof of the strong Goldbach conjecture by studying limit
More informationMath 110 HW 3 solutions
Math 0 HW 3 solutions May 8, 203. For any positive real number r, prove that x r = O(e x ) as functions of x. Suppose r
More informationVarious new observations about primes
A talk given at Univ. of Illinois at Urbana-Champaign (August 28, 2012) and the 6th National Number Theory Confer. (October 20, 2012) and the China-Korea Number Theory Seminar (October 27, 2012) Various
More informationExtending Theorems of Serret and Pavone
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 20 (2017), Article 17.10.5 Extending Theorems of Serret and Pavone Keith R. Matthews School of Mathematics and Physics University of Queensland Brisbane
More informationCHAPTER 1 REAL NUMBERS KEY POINTS
CHAPTER 1 REAL NUMBERS 1. Euclid s division lemma : KEY POINTS For given positive integers a and b there exist unique whole numbers q and r satisfying the relation a = bq + r, 0 r < b. 2. Euclid s division
More informationSOME REMARKS ON NUMBER THEORY BY P. ERDŐS 1. Let ABSTRACT This note contains some disconnected minor remarks on number theory. (1) Iz j I=1, 1<j<co be
SOME REMARKS ON NUMBER THEORY BY P. ERDŐS 1. Let ABSTRACT This note contains some disconnected minor remarks on number theory. (1) Iz j I=1, 1
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Define and use the congruence modulo m equivalence relation Perform computations using modular arithmetic
More informationOpen Problems with Factorials
Mathematics Open Problems with Factorials Sílvia Casacuberta supervised by Dr. Xavier Taixés November 3, 2017 Preamble This essay contains the results of a research project on number theory focusing on
More informationarxiv: v2 [math.nt] 21 Mar 2018
PROOF OF BERTRAND S POSTULATE FOR n 6 MANOJ VERMA arxiv:40.468v [math.nt] Mar 08 Abstract. We add a few ideas to Erdős s proof of Bertrand s Postulate to produce one using a little calculus but requiring
More informationSummary Slides for MATH 342 June 25, 2018
Summary Slides for MATH 342 June 25, 2018 Summary slides based on Elementary Number Theory and its applications by Kenneth Rosen and The Theory of Numbers by Ivan Niven, Herbert Zuckerman, and Hugh Montgomery.
More informationarxiv: v2 [math.nt] 4 Jun 2016
ON THE p-adic VALUATION OF STIRLING NUMBERS OF THE FIRST KIND PAOLO LEONETTI AND CARLO SANNA arxiv:605.07424v2 [math.nt] 4 Jun 206 Abstract. For all integers n k, define H(n, k) := /(i i k ), where the
More informationOn products of quartic polynomials over consecutive indices which are perfect squares
Notes on Number Theory and Discrete Mathematics Print ISSN 1310 513, Online ISSN 367 875 Vol. 4, 018, No. 3, 56 61 DOI: 10.7546/nntdm.018.4.3.56-61 On products of quartic polynomials over consecutive indices
More informationPartial Complements and Transposable Dispersions
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 7 (2004), Article 04.1.6 Partial Complements and Transposable Dispersions Clark Kimberling and John E. Brown Department of Mathematics University of
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 informationAn integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p.
Chapter 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and p has exactly two positive divisors, 1 and p. If n > 1
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 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 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 informationarxiv: v1 [math.co] 24 Jan 2017
CHARACTERIZING THE NUMBER OF COLOURED m ARY PARTITIONS MODULO m, WITH AND WITHOUT GAPS I. P. GOULDEN AND PAVEL SHULDINER arxiv:1701.07077v1 [math.co] 24 Jan 2017 Abstract. In a pair of recent papers, Andrews,
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 informationON INTEGERS EXPRESSIBLE BY SOME SPECIAL LINEAR FORM. 1. Introduction
ON INTEGERS EXPRESSIBLE BY SOME SPECIAL LINEAR FORM A. DUBICKAS and A. NOVIKAS Abstract. Let E(4) be the set of positive integers expressible by the form 4M d, where M is a multiple of the product ab and
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 informationH2 MATHS SET D PAPER 1
H Maths Set D Paper H MATHS Exam papers with worked solutions SET D PAPER Compiled by THE MATHS CAFE P a g e b The curve y ax c x 3 points, and, H Maths Set D Paper has a stationary point at x 3. It also
More informationA RESULT ON RAMANUJAN-LIKE CONGRUENCE PROPERTIES OF THE RESTRICTED PARTITION FUNCTION p(n, m) ACROSS BOTH VARIABLES
#A63 INTEGERS 1 (01) A RESULT ON RAMANUJAN-LIKE CONGRUENCE PROPERTIES OF THE RESTRICTED PARTITION FUNCTION p(n, m) ACROSS BOTH VARIABLES Brandt Kronholm Department of Mathematics, Whittier College, Whittier,
More informationInteger Partitions and Convexity
2 3 47 6 23 Journal of Integer Sequences, Vol. 0 (2007), Article 07.6.3 Integer Partitions and Convexity Sadek Bouroubi USTHB Faculty of Mathematics Department of Operational Research Laboratory LAID3
More informationarxiv: v2 [math.nt] 15 Feb 2014
ON POLIGNAC S CONJECTURE FRED B. HOLT AND HELGI RUDD arxiv:1402.1970v2 [math.nt] 15 Feb 2014 Abstract. A few years ago we identified a recursion that works directly with the gaps among the generators in
More informationA PROBABILISTIC THRESHOLD FOR MONOCHROMATIC ARITHMETIC PROGRESSIONS
A PROBABILISTIC THRESHOLD FOR MONOCHROMATIC ARITHMETIC PROGRESSIONS Aaron Robertson Department of Mathematics, Colgate University, Hamilton, New York arobertson@colgate.edu Abstract Let f r (k) = p k r
More informationConvergence of DFT eigenvalues with cell volume and vacuum level
Converence of DFT eienvalues with cell volume and vacuum level Sohrab Ismail-Beii October 4, 2013 Computin work functions or absolute DFT eienvalues (e.. ionization potentials) requires some care. Obviously,
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 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 informationAbstract. Roma Tre April 18 20, th Mini Symposium of the Roman Number Theory Association (RNTA) Michel Waldschmidt
Roma Tre April 8 0, 08 4th Mini Symposium of the Roman umber Theory Association (RTA) Representation of integers by cyclotomic binary forms Michel Waldschmidt Institut de Mathématiques de Jussieu Paris
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 informationPRODUCTS THAT ARE POWERS. A mathematical vignette Ed Barbeau, University of Toronto
PRODUCTS THAT ARE POWERS. A mathematical vignette Ed Barbeau, University of Toronto This investigation was originally designed for school students to gain fluency with the factoring of positive integers
More information#A61 INTEGERS 14 (2014) SHORT EFFECTIVE INTERVALS CONTAINING PRIMES
#A6 INTEGERS 4 (24) SHORT EFFECTIVE INTERVALS CONTAINING PRIMES Habiba Kadiri Department of Mathematics and Computer Science, University of Lethbridge, Lethbridge, Canada habiba.kadiri@uleth.ca Allysa
More informationA New Identity for Complete Bell Polynomials Based on a Formula of Ramanujan
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 12 (2009, Article 09.3. A New Identity for Complete Bell Polynomials Based on a Formula of Ramanujan Sadek Bouroubi University of Science and Technology
More informationSieving 2m-prime pairs
Notes on Number Theory and Discrete Mathematics ISSN 1310 5132 Vol. 20, 2014, No. 3, 54 60 Sieving 2m-prime pairs Srečko Lampret Pohorska cesta 110, 2367 Vuzenica, Slovenia e-mail: lampretsrecko@gmail.com
More informationTHE DENOMINATORS OF POWER SUMS OF ARITHMETIC PROGRESSIONS. Bernd C. Kellner Göppert Weg 5, Göttingen, Germany
#A95 INTEGERS 18 (2018) THE DENOMINATORS OF POWER SUMS OF ARITHMETIC PROGRESSIONS Bernd C. Kellner Göppert Weg 5, 37077 Göttingen, Germany b@bernoulli.org Jonathan Sondow 209 West 97th Street, New Yor,
More informationarxiv: v1 [math.ca] 15 Jan 2018
Preprint submitted to arxiv.org Accurate estimates of 1 + x 1/x Involved in Carleman Inequality and Keller Limit arxiv:1801.04963v1 [math.ca] 15 Jan 2018 Branko Malešević 1, Yue Hu 2 and Cristinel Mortici
More informationGeneralization of Vieta's Formula
Rose-Hulman Underraduate Mathematics Journal Volume 7 Issue Article 4 Generalization of Vieta's Formula Al-Jalila Al-Abri Sultan Qaboos University in Oman Follow this and additional wors at: https://scholar.rose-hulman.edu/rhumj
More informationarxiv:math/ v1 [math.nt] 27 Feb 2004
arxiv:math/0402458v1 [math.nt] 27 Feb 2004 On simultaneous binary expansions of n and n 2 Giuseppe Melfi Université de Neuchâtel Groupe de Statistique Espace de l Europe 4, CH 2002 Neuchâtel, Switzerland
More informationarxiv:math/ v2 [math.nt] 3 Dec 2003
arxiv:math/0302091v2 [math.nt] 3 Dec 2003 Every function is the representation function of an additive basis for the integers Melvyn B. Nathanson Department of Mathematics Lehman College (CUNY) Bronx,
More informationImproved Bounds on the Anti-Waring Number
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 0 (017, Article 17.8.7 Improved Bounds on the Anti-Waring Number Paul LeVan and David Prier Department of Mathematics Gannon University Erie, PA 16541-0001
More informationD( 1)-QUADRUPLES AND PRODUCTS OF TWO PRIMES. Anitha Srinivasan Saint Louis University-Madrid campus, Spain
GLASNIK MATEMATIČKI Vol. 50(70)(2015), 261 268 D( 1)-QUADRUPLES AND PRODUCTS OF TWO PRIMES Anitha Srinivasan Saint Louis University-Madrid campus, Spain Abstract. A D( 1)-quadruple is a set of positive
More informationCONGRUENCES RELATED TO THE RAMANUJAN/WATSON MOCK THETA FUNCTIONS ω(q) AND ν(q)
CONGRUENCES RELATED TO THE RAMANUJAN/WATSON MOCK THETA FUNCTIONS ωq) AND νq) GEORGE E. ANDREWS, DONNY PASSARY, JAMES A. SELLERS, AND AE JA YEE Abstract. Recently, Andrews, Dixit, and Yee introduced partition
More informationSome new representation problems involving primes
A talk given at Hong Kong Univ. (May 3, 2013) and 2013 ECNU q-series Workshop (Shanghai, July 30) Some new representation problems involving primes Zhi-Wei Sun Nanjing University Nanjing 210093, P. R.
More informationSums of Squares. Bianca Homberg and Minna Liu
Sums of Squares Bianca Homberg and Minna Liu June 24, 2010 Abstract For our exploration topic, we researched the sums of squares. Certain properties of numbers that can be written as the sum of two squares
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 informationXIUMEI LI AND MIN SHA
GAUSS FACTORIALS OF POLYNOMIALS OVER FINITE FIELDS arxiv:1704.0497v [math.nt] 18 Apr 017 XIUMEI LI AND MIN SHA Abstract. In this paper we initiate a study on Gauss factorials of polynomials over finite
More information[STRAIGHT OBJECTIVE TYPE] log 4 2 x 4 log. (sin x + cos x) = 10 (A) 24 (B) 36 (C) 20 (D) 12
[STRAIGHT OBJECTIVE TYPE] Q. The equation, ( ) +. + 4 4 + / (A) eactly one real solution (B) two real solutions (C) real solutions (D) no solution. = has : ( n) Q. If 0 sin + 0 cos = and 0 (sin + cos )
More informationMathSciNet infinitude of prime
0 π(x) x π(x) > c log log x π(x) > c log x c MathSciNet infinitude of prime 2018/11/3 2012 arxiv Romeo Meštrović, Euclid s theorem on the infinitude of primes: a historical survey of its proofs (300 B.C.
More informationSets of Lengths of Puiseux Monoids
UC Berkeley Conference on Rings and Factorizations Institute of Mathematics and Scientific Computing University of Graz, Austria February 21, 2018 Introduction Online reference: https://arxiv.org/abs/1711.06961
More informationMath 412: Number Theory Lecture 3: Prime Decomposition of
Math 412: Number Theory Lecture 3: Prime Decomposition of Integers Gexin Yu gyu@wm.edu College of William and Mary Prime numbers Definition: a (positive) integer p is prime if p has no divisor other than
More information#A22 INTEGERS 17 (2017) NEW CONGRUENCES FOR `-REGULAR OVERPARTITIONS
#A22 INTEGERS 7 (207) NEW CONGRUENCES FOR `-REGULAR OVERPARTITIONS Shane Chern Department of Mathematics, Pennsylvania State University, University Park, Pennsylvania shanechern@psu.edu Received: 0/6/6,
More informationAn irreducibility criterion for integer polynomials
An irreducibility criterion for integer polynomials Anuj Jakhar, Neeraj Sangwan arxiv:1612.01712v1 [math.ac] 6 Dec 2016 anujjakhar@iisermohali.ac.in, neerajsan@iisermohali.ac.in Indian Institute of Science
More information1 i<j k (g ih j g j h i ) 0.
CONSECUTIVE PRIMES IN TUPLES WILLIAM D. BANKS, TRISTAN FREIBERG, AND CAROLINE L. TURNAGE-BUTTERBAUGH Abstract. In a stunning new advance towards the Prime k-tuple Conjecture, Maynard and Tao have shown
More informationFundamental Theorem of Finite Abelian Groups
Monica Agana Boise State University September 1, 2015 Theorem (Fundamental Theorem of Finite Abelian Groups) Every finite Abelian group is a direct product of cyclic groups of prime-power order. The number
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 informationSection II.2. Finitely Generated Abelian Groups
II.2. Finitely Generated Abelian Groups 1 Section II.2. Finitely Generated Abelian Groups Note. In this section we prove the Fundamental Theorem of Finitely Generated Abelian Groups. Recall that every
More informationNotes on Continued Fractions for Math 4400
. Continued fractions. Notes on Continued Fractions for Math 4400 The continued fraction expansion converts a positive real number α into a sequence of natural numbers. Conversely, a sequence of natural
More informationThe Riddle of Primes
A talk given at Dalian Univ. of Technology (Nov. 16, 2012) and Nankai University (Dec. 1, 2012) The Riddle of Primes Zhi-Wei Sun Nanjing University Nanjing 210093, P. R. China zwsun@nju.edu.cn http://math.nju.edu.cn/
More informationEuclid-Euler-Jiang Prime Theorem
Euclid-Euler-iang Prime Theorem Chun-Xuan iang POBox 394 Beiing 00854 P R China iangchunxuan@sohucom Abstract Santilli s prime chains: P + ap b L ( a b ab If λn a P λ LP n P LPn b we have ( as There exist
More informationProofs of the infinitude of primes
Proofs of the infinitude of primes Tomohiro Yamada Abstract In this document, I would like to give several proofs that there exist infinitely many primes. 0 Introduction It is well known that the number
More informationA Generalization of Bernoulli's Inequality
Florida International University FIU Digital Commons Department of Mathematics and Statistics College of Arts, Sciences & Education 200 A Generalization of Bernoulli's Inequality Laura De Carli Department
More informationRepresenting numbers as the sum of squares and powers in the ring Z n
Representing numbers as the sum of squares powers in the ring Z n Rob Burns arxiv:708.03930v2 [math.nt] 23 Sep 207 26th September 207 Abstract We examine the representation of numbers as the sum of two
More informationAn Exploration of the Arithmetic Derivative
An Eploration of the Arithmetic Derivative Alaina Sandhu Final Research Report: Summer 006 Under Supervision of: Dr. McCallum, Ben Levitt, Cameron McLeman 1 Introduction The arithmetic derivative is a
More informationCHAPTER 6. Prime Numbers. Definition and Fundamental Results
CHAPTER 6 Prime Numbers Part VI of PJE. Definition and Fundamental Results 6.1. Definition. (PJE definition 23.1.1) An integer p is prime if p > 1 and the only positive divisors of p are 1 and p. If n
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 informationOn Polynomial Pairs of Integers
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 18 (2015), Article 15.3.5 On Polynomial Pairs of Integers Martianus Frederic Ezerman Division of Mathematical Sciences School of Physical and Mathematical
More information(k, l)-universality OF TERNARY QUADRATIC FORMS ax 2 + by 2 + cz 2
#A20 INTEGERS 18 (2018) (k, l)-universality OF TERNARY QUADRATIC FORMS ax 2 + by 2 + cz 2 Lerna Pehlivan Department of Mathematics and Statistics, Acadia University, Wolfville, Nova Scotia, Canada lerna.pehlivan@acadiau.ca
More informationarxiv: v1 [math.cv] 14 Nov 2017
EXTENDING A FUNCTION JUST BY MULTIPLYING AND DIVIDING FUNCTION VALUES: SMOOTHNESS AND PRIME IDENTITIES arxiv:1711.07887v1 [math.cv] 14 Nov 2017 PATRICK ARTHUR MILLER ABSTRACT. We describe a purely-multiplicative
More informationProofs Not Based On POMI
s Not Based On POMI James K. Peterson Department of Biological Sciences and Department of Mathematical Sciences Clemson University February 1, 018 Outline Non POMI Based s Some Contradiction s Triangle
More informationON THE SUM OF INTEGERS FROM SOME MULTIPLICATIVE SETS AND SOME POWERS OF INTEGERS
#A27 INTEGERS 18 (2018) ON THE SUM OF INTEGERS FROM SOME MULTIPLICATIVE SETS AND SOME POWERS OF INTEGERS Timothy Foo Department of Electrical and Computer Engineering, University of Waterloo, Waterloo,
More informationMATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION. Chapter 2: Countability and Cantor Sets
MATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION Chapter 2: Countability and Cantor Sets Countable and Uncountable Sets The concept of countability will be important in this course
More informationA NOTE ON THE SMARANDACHE PRIME PRODUCT SEQTJENCE A.A.K.~AR. Department of Mathematics, Jahangimagar University, Savar, Dhaka 1342, Bangladesh
A NOTE ON THE SMARANDACHE PRIME PRODUCT SEQTJENCE A.A.K.~AR Department of Mathematics, Jahangimagar University, Savar, Dhaka 1342, Bangladesh ABSTRACT This paper gives some properties of the Smarandache
More informationarxiv: v1 [math.gm] 6 Oct 2014
Prime number generation and factor elimination Vineet Kumar arxiv:1411.3356v1 [math.gm] 6 Oct 2014 Abstract. We have presented a multivariate polynomial function termed as factor elimination function,by
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 informationArithmetic Properties of Partition k-tuples with Odd Parts Distinct
3 7 6 3 Journal of Integer Sequences, Vol. 9 06, Article 6.5.7 Arithmetic Properties of Partition k-tuples with Odd Parts Distinct M. S. Mahadeva Naika and D. S. Gireesh Department of Mathematics Bangalore
More informationJournal of Inequalities in Pure and Applied Mathematics
Journal of Inequalities in Pure and Applied Mathematics L HOSPITAL TYPE RULES FOR OSCILLATION, WITH APPLICATIONS IOSIF PINELIS Department of Mathematical Sciences, Michian Technoloical University, Houhton,
More informationItem 6. Pi and the Universe. Gives Applications to the Geometry of our Universe. 5 Total Pages
Item 6 Pi and the Universe Gives Applications to the Geometry of our Universe 5 Total Pages 1 Pi and the Universe How Geometry Proves the Correct Ratio for Pi 201/64, as a decimal 3.140625 For our geometry
More informationUltrafilters maximal for finite embeddability
1 16 ISSN 1759-9008 1 Ultrafilters maximal for finite embeddability LORENZO LUPERI BAGLINI Abstract: In this paper we study a notion of preorder that arises in combinatorial number theory, namely the finite
More informationGoldbach's problem with primes in arithmetic progressions and in short intervals
Goldbach's problem with primes in arithmetic progressions and in short intervals Karin Halupczok Journées Arithmétiques 2011 in Vilnius, June 30, 2011 Abstract: We study the number of solutions in Goldbach's
More informationAn Invitation to Modern Number Theory. Steven J. Miller and Ramin Takloo-Bighash PRINCETON UNIVERSITY PRESS PRINCETON AND OXFORD
An Invitation to Modern Number Theory Steven J. Miller and Ramin Takloo-Bighash PRINCETON UNIVERSITY PRESS PRINCETON AND OXFORD Contents Foreword Preface Notation xi xiii xix PART 1. BASIC NUMBER THEORY
More informationCHIRANJIT RAY AND RUPAM BARMAN
ON ANDREWS INTEGER PARTITIONS WITH EVEN PARTS BELOW ODD PARTS arxiv:1812.08702v1 [math.nt] 20 Dec 2018 CHIRANJIT RAY AND RUPAM BARMAN Abstract. Recently, Andrews defined a partition function EOn) which
More information