Approximate formulas for some functions of prime numbers
About: This article is published in Illinois Journal of Mathematics. The article was published on 01 Mar 1962. and is currently open access. The article focuses on the topics: Prime k-tuple & Prime power.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases
Mark Giesbrecht,Erich Kaltofen,Wen-shin Lee +2 more
- 01 Sep 2003
TL;DR: These algorithms are based on the early termination version of sparse interpolation algorithms: for a symbolic set of interpolation points, a sparsest shift must be a root of the first possible zero discrepancy that can be used as the earlytermination test.
23
•Posted Content
Algebraic independence in the Grothendieck ring of varieties
TL;DR: In this article, the authors give sufficient cohomological criteria for the classes of given varieties over a field $k$ to be algebraically independent in the Grothendieck ring of varieties over the field.
23
I. État des lieux
Patrice Beck
- 01 Jan 2006
TL;DR: The article 3 de la Loi n°89-462 du 6 juillet 1989 as discussed by the authors states that l’état des lieux do not être établi de façon contradictoire entre les deux parties lors de la remise des clés au locataire and lors of leur restitution en fin de bail.
23
The distribution of the number of points modulo an integer on elliptic curves over finite fields
TL;DR: In this article, it was shown that the probability that the number of rational points on a randomly chosen elliptic curve over a finite field over a given integer modulo N equals b modulo n is bounded by an equidistribution result on the action of Frobenius on the N-torsion subgroup of E.
Evaluation of Porter's constant
TL;DR: A 40D value is computed for the constant which J. W. Porter has recently derived in connection with the analysis of Euclid's algorithm.
22
References
•Book
The distribution of prime numbers
A. E. Ingham
- 01 Jan 1932
TL;DR: In this paper, the prime number theorem and its application in the theory of applications are discussed, as well as the regularities of distribution in the context of prime numbers and their applications.
583
On the roots of the Riemann zeta-function
TL;DR: On the critical line a=l/s, t > 0, the Riemann Hypothesis is true at least for t <_9878.910.
Related Papers (5)
Harold Davenport
- 01 Jan 1967
[...]
Tom M. Apostol
- 01 Jan 1976