Approximate formulas for some functions of prime numbers
1962/03/01 by J. Barkley Rosser, Lowell Schoenfeld · 174 citations
Mathematics · #Advanced Mathematical Identities #Algebraic and Geometric Analysis #Analytic Number Theory Research
paper · pdf · doi:10.1215/ijm/1255631807
crossref issued 1962/03/01 · crossref published 1962/03/01 · crossref published-print 1962/03/01 · openalex publication_date 1962/03/01 · crossref created 2019/02/28 · crossref deposited 2024/01/30 · openalex created_date 2025/10/10 · crossref indexed 2026/07/30 · openalex updated_date 2026/08/01
Citations
Cited by
- An Explicit Result for the Sum of Two Almost Primes
- Improved Bounds for the Index Conjecture in Zero-Sum Theory
- An effective Bombieri-Vinogradov error term for sifting problems
- Embeddings of weighted projective spaces
- An Effective Version of the p-Curvature Conjecture for Order One Differential Equations
- Conjectures About Cyclic Numbers: Resolutions and Counterexamples
- Explicit zero-free regions for automorphic L-functions
- Counting polynomials with positive roots
- Large gaps between values of several binary quadratic forms
- On the verification of a Nicolas inequality
- A lower bound for the number of Egyptian fractions
- The Diophantine Frobenius Problem revisited
- Answer to a Question of Hung and Tiep on Conductors of Cyclotomic Integers
- Liftability of periodic mapping classes under alternating covers
- Bounds for sets of remainders
- Alpay Folded Prime Enumerator via gcd and Floors: Exact Enumeration, Record-Lift, and Non-Synonymy/Minimality Certificates
- Parameterized complexity of quantum invariants
- Superior Highly Composite Numbers and the Explicit Upper Bound of Generalized Divisor Functions
- On the constant factor in several related asymptotic estimates
- Bounds on the Minkowski constants and a function involving φ
- Topics In Primitive Roots
- The modified prime sieve for primitive elements in finite fields
- The probability of Riemann's hypothesis being true is equal to 1
- A quantum algorithm for computing the Carmichael function
- Homothéties explicites des représentations ℓ-adiques
- Cannonball Polygons with Multiplicities
- Updating an upper bound of Erik Westzynthius
- Factors of Sparse Polynomials are Sparse
- Faster Sparse Multivariate Polynomial Interpolation of Straight-Line Programs
- Behaviour of the sequence ϑn = ϑ(pn)
- Fractal curves from prime trigonometric series
- A computational history of prime numbers and Riemann zeros
- An effective analytic recurrence for prime numbers
- Products of Factorials Modulo p
- On the arithmetic and geometric means of the prime numbers
- Primitive Roots In Short Intervals
- On the Amount of Dependence in the Prime Factorization of a Uniform Random Integer
- Multiple Mertens evaluations
- Ramanujan and Labos primes, their generalizations and classifications of primes
- Remarks on Robin's and Niocolas Inequalities
- About one matrix of composite numbers and her applications
- New bounds for the sum of the first n prime numbers
- On the Number of Connected Components of Ranges of Divisor Functions
- Explicit Bounds and Parallel Algorithms for Counting Multiply Gleeful Numbers
- Computing Euler products and coefficients of classical modular forms for twisted L-functions
- Squarefree Integers And Extreme Values Of Some Arithmetic Functions
- On the Complexity of Problems on Graphs Defined on Groups
- The determination of norm-Euclidean cyclic cubic fields
- Linear independence of values of logarithms revisited
- Simultaneous Elements Of Prescribed Multiplicative Orders
- An elemetary proof of an estimate for a number of primes less than the product of the first n primes
- An Investigation Into Several Explicit Versions of Burgess' Bound
- A bias in Mertens' product formula
- About the Primality of Primorials
- The distance to square-free polynomials
- A Rigorous Error Bound for the TG Kernel in Prime Counting
- Continued fractions constructed from prime numbers
- All-Pairs Shortest Paths with Few Weights per Node
- Explicit estimates on prime numbers
- Affine transformations of finite vector spaces with large orders or few cycles
- Explicit conditional bounds for the residue of a Dedekind zeta-function at s=1
- From the Goldbach Conjecture to the Theorem
- A Note on a Unitary Analog to Redheffer's Matrix
- Catalytic z-rotations in constant T-depth
- Quantitative Chevalley-Weil theorem for curves
- Output-sensitive algorithms for sumset and sparse polynomial\n multiplication
- Coefficient growth in square chains
- Explicit Improvements to the Burgess Bound Via Pólya-Vinogradov
- A note on primes with prime indices
- The ternary Goldbach conjecture is true
- On Hölder maps and prime gaps
- Bounds for the solutions of S-unit equations and decomposable form equations
- On numbers satisfying Robin's inequality, properties of the next counterexample and improved specific bounds
- A Totient Function Inequality
- Perfect transfer of arbitrary states in quantum spin networks
- Explicit formulae for primes in arithmetic progressions, II
- On the sum of a prime and two Fibonacci numbers
- Primes of the form ax+by
- The number of primes not in a numerical semigroup
- On integrals of fractional parts and the theory of prime differences
- Regular and oscillatory parts for basic functions of prime numbers. I Regular parts
- On The Prime Numbers In Intervals
- On the decomposition of n! into primes
- On the Prime Numbers in the Interval [4n,5n]
- Effective Height Upper Bounds on Algebraic Tori
- Ranges of Unitary Divisor Functions
- Inequities in the Shanks-Renyi Prime Number Race: An asymptotic formula for the densities
- Updating the error term in the prime number theorem
- Sharper estimates for Chebyshev's functions ϑ and ψ
- On the Lebesgue Component of Semiclassical Measures for Abelian Quantum Actions
- Explicit Chen's theorem
- Values of the Euler phi function not divisible by a prescribed odd prime
- Periodicity related to a sieve method of producing primes
- Every odd number greater than 1 is the sum of at most five primes
- The Minimal Degree of Salem Numbers with Negative Trace
- Quadratic residues that are not primitive roots
- Landau's function for one million billions
- Uniform Universal Sets, Splitters, and Bisectors
- On the prime factors of the iterates of the Ramanujan τ--function
- Low-degree factors of random polynomials
- On \mathbbFq-primitive points on hypersurfaces
- On the arithmetic average of the first n primes
- Quasiperfect numbers with the same exponent
- When π(n) does not divide n
- Reducing elliptic curve logarithms to logarithms in a finite field
- Power-free values of binary forms and the global determinant method
- Signature schemes based on the strong RSA assumption
- Some Notes on Digit Strings in the Primes
- The large sieve
- Polynomial-time isomorphism testing of groups of most finite orders
- On sums of primes
- Primes in floor function sets
- On primitive Dirichlet characters and the Riemann hypothesis
- Medium-sized values for the Prime Number Theorem for primes in arithmetic progression
- Infinitely many Carmichael numbers in arithmetic progressions
- There are Infinitely Many Carmichael Numbers
- Serre’s modularity conjecture (II)
- Serre’s modularity conjecture (I)
- Evaluation of Porter's constant
- On the decomposition of n! into prime powers
- The 𝑘𝑡ℎ prime is greater than 𝑘(ln𝑘+lnln𝑘-1) for 𝑘≥2
- Odd perfect numbers are greater than 101500
- Explicit bounds for primes in arithmetic progressions
- Sieve methods for odd perfect numbers
- Updating the error term in the prime number theorem
- Nonnegative trigonometric polynomials and a zero-free region for the Riemann zeta-function
- Elementary methods in the study of the distribution of prime numbers
- On the Largest Prime factor of the k-generalized Pell numbers
- The Number of Solutions of φ (x) = m
- On Integral Well-rounded Lattices in the Plane
- Criteria for irrationality of Euler’s constant
- Euler’s constant, q-logarithms, and formulas of Ramanujan and Gosper
- On Burgess' Bound for Primitive Roots Modulo Primes and an Application to Γ(p)
- On the abc conjecture, II
- On the prime counting function and the partial sum of reciprocals of odd primes
- The impact of 𝜁(𝑠) complex zeros on 𝜋(𝑥) for 𝑥<1010¹³
- A sharp region where 𝜋(𝑥)-fc(r) is positive
- A NEW BOUND FOR THE SMALLEST x WITH π(x) > li(x)
- The prime-counting function and its analytic approximations
- On a problem of Bleicher and Erdös
- On Robin’s criterion for the Riemann hypothesis
- Paley-type matrices and 1-factorizations of complete graphs
- Bloomier Filters: A Second Look
- The least prime number in a Beatty sequence
- Analogues of the Robin-Lagarias Criteria for the Riemann Hypothesis
- Faster Integer Multiplication Using Preprocessing
- On the constant factor in several related asymptotic estimates
- The constant factor in the asymptotic for practical numbers
- Les nombres pratiques: théorie, observations et conjectures
- COUNTING THE NUMBER OF SOLUTIONS TO THE ERDŐS–STRAUS EQUATION ON UNIT FRACTIONS
- New bounds on the length of finite pierce and Engel series
- On the eigenstructure of sparse matrices related to the prime number theorem
- A fast algorithm to compute cubic fields
- On the sum of a prime and a number that is not square-free
- Explicit bounds for the graphicality of the prime gap sequence
- Streaming algorithms for products of probabilities
- Reductions between short vector problems and simultaneous approximation
- Detecting lacunary perfect powers and computing their roots
- Minor arcs for Goldbach's problem
- The n-th prime exponentially
- Essentially optimal sparse polynomial multiplication
- Isomorphism testing of groups of cube-free order
- Linnik's large sieve and the L1 norm of exponential sums
- On the computation of the HNF of a module over the ring of integers of a number field
- On certain sums involving the largest prime factor over integer sequences
- Computing persistent homology with various coefficient fields in a single pass
- Primes with a Prime Subscript
- Local solubility in generalised Châtelet varieties
- Nondeterminism makes unary 1-limited automata concise
- On the Riemann hypothesis and the difference between primes
- On the Zeros of the Riemann Zeta Function in the Critical Strip. IV
- Zeros of Sections of the Zeta Function. II
- Euler's totient function [wikipedia]
- Skewes's number [wikipedia]