On Chebyshev-Type Inequalities for Primes

From MaRDI portal
Publication:3957010

DOI10.2307/2320934zbMath0494.10004OpenAlexW4246799703WikidataQ55898672 ScholiaQ55898672MaRDI QIDQ3957010

Mohan Nair

Publication date: 1982

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2320934




Related Items (51)

On the least common multiple of several consecutive values of a polynomialThe least common multiple of consecutive terms in a cubic progressionOn the least common multiple of binary linear recurrence sequencesNewton representation of functions over natural integers having integral difference ratiosNontrivial effective lower bounds for the least common multiple of a $q$-arithmetic progressionLower bounds for the least common multiple of finite arithmetic progressionsA LOWER BOUND ON THE NUMBER OF PRIMES BETWEEN AND nA factor of integer polynomials with minimal integralsA note on integer polynomials with small integrals. IIMinima, slopes and tensor algebraElementary and combinatorial methods for counting prime numbersA sharp upper bound for the sum of reciprocals of least common multiplesUniform lower bound for the least common multiple of a polynomial sequenceThe least common multiple of a sequence of products of linear polynomialsOn the sum of reciprocals of least common multiplesExtreme cases for Frostman’s theoremOn Presburger arithmetic extended with non-unary counting quantifiersAsymptotic behavior of the least common multiple of consecutive arithmetic progression termsNote on the lower bound of least common multipleAn analogue of the Erdős-Ginzburg-Ziv theorem over \(\mathbb{Z}\)Regret bounds for restless Markov banditsNew lower bounds for the least common multiples of arithmetic progressionsProof pearl: Bounding least common multiples with trianglesImprovements of lower bounds for the least common multiple of finite arithmetic progressionsOn the sum of digits of the factorialOn the periodicity of an arithmetical functionThe cardinality of some symmetric differencesFurther improvements of lower bounds for the least common multiples of arithmetic progressionsThe least common multiple of consecutive arithmetic progression termsOn the sum of reciprocals of least common multiples. IINew lower bounds for the least common multiple of polynomial sequencesA note on integer polynomials with small integralsNontrivial upper bounds for the least common multiple of an arithmetic progressionNontrivial effective lower bounds for the least common multiple of some quadratic sequencesMechanisation of the AKS algorithmNontrivial lower bounds for the least common multiple of some finite sequences of integersUnnamed ItemTriforce and cornersNew results on the least common multiple of consecutive integersNew Results on the Minimum Amount of Useful SpaceSur le diamètre transfini entier d'un intervalle réel. (On the transfinite integer diameter of a real interval)The exact upper bound for the sum of reciprocals of least common multiplesProof Pearl: Bounding Least Common Multiples with TrianglesBipartite Perfect Matching is in Quasi-NCElementary methods in the study of the distribution of prime numbersNontrivial lower bounds for the least common multiple of some sequences of integers.On integer Chebyshev polynomialsIsolating a Vertex via Lattices: Polytopes with Totally Unimodular FacesTHE LEAST COMMON MULTIPLE OF CONSECUTIVE TERMS IN A QUADRATIC PROGRESSIONOn the computational complexity of reaction systems, revisitedA SHARP UPPER BOUND FOR THE SUM OF RECIPROCALS OF LEAST COMMON MULTIPLES II




This page was built for publication: On Chebyshev-Type Inequalities for Primes