Upper bound of 1/(a_i a_i) for quasi-primitive sequences
A strictly increasing sequence \(A=\{a_i\}\) is said to be primitive if no element of \(A\) divides any other. Similarly, \(A\) is called quasi- primitive if the equation \((a_i,a_j)=a_r\) has no solutions with \(r<i<j\). Erdős has conjectured that \(f(A)\leq f(P)<1.64\) for any primitive sequence \(A\), where \(P\) is the primitive sequence of all primes. The authors had shown in a previous paper [Proc. Am. Math. Soc. 117, No. 4, 891-895 (1993; Zbl 0776.11013)] that \(f(A)\leq 1.84\) for any primitive sequence. In this paper, they conjecture a corresponding bound for quasi-primitive namely that \(f(A)\leq f(Q)<2\cdot 01\) for any quasi-primitive sequence \(A\), where \(Q\) is the quasi-primitive sequence of all prime powers, and prove that \(f(A)\leq 2.77\) for any quasi-primitive sequence \(A\).
- An upper bound of 1/(a_i a_i) for quasi-primitive sequences
- Upper Bound of ∑1/(a i loga i ) for Primitive Sequences
- An Upper Bound of Σ1/(a i loga i ) for Primitive Sequences
- scientific article; zbMATH DE number 3335226
- scientific article; zbMATH DE number 5281503
- On a conjecture of Erdős on the sum \(\sum_{p\leq n}1/(p\,\log \,p)\)
- A concrete upper bound in the uniform law of the iterated logarithm
- On the upper bound for the number of primes or almost primes in a given integer sequence
- Upper and lower bounds for \(A(q)\)
- Estimation de la fonction de Tchebychef θ sur le k-ième nombre premier et grandes valeurs de la fonction ω(n) nombre de diviseurs premiers de n
- scientific article; zbMATH DE number 3227181 (Why is no real title available?)
- scientific article; zbMATH DE number 3336994 (Why is no real title available?)
- On a conjecture of Erdős on the sum \(\sum_{p\leq n}1/(p\,\log \,p)\)
- On a Problem of Erdos Concerning Primitive Sequences
- Upper Bound of ∑1/(a i loga i ) for Primitive Sequences
This page was built for publication: Upper bound of \(\sum 1/(a_i \log a_i)\) for quasi-primitive sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367553)