On a class of relatively prime sequences
For each \(n\geq 1\) let \(a_0(1)=n\) and define \(a_{i+1}(n)> a_i(n)\) inductively as the least integer coprime to \(a_j(n)\) for \(0\leq j\leq i\). Let \(g(n)\) be the largest \(a_i(n)\) which is neither a prime \(n\) or the square of a prime. It is shown here that \(g(n)\thicksim n\) and that \(g(n)-n \gg m^{1/2}\log n\). The true order of magnitude of \(g(n)-n\) remains unsettled, and some relevant computations are discussed. Other results on the sequence \(a_i(n)\) are given, extending work of \textit{P.Erdős} [Math. Mag. 51, 238-240 (1978; Zbl 0391.10004)] . The following result occurs incidentally in one of the proofs: if \(n\) is large enough \([n/p]\) is composite for some prime \(p< n^{1/2}\).
- A Property of 70
- Approximate formulas for some functions of prime numbers
- scientific article; zbMATH DE number 3518877 (Why is no real title available?)
- scientific article; zbMATH DE number 3235403 (Why is no real title available?)
- scientific article; zbMATH DE number 3420877 (Why is no real title available?)
- scientific article; zbMATH DE number 3107107 (Why is no real title available?)
- On Character Sums and Power Residues
- ON THE DIFFERENCE BETWEEN CONSECUTIVE PRIMES
- On the difference between consecutive primes
- On the difference of consecutive numbers prime to n
- On the error term in the linear sieve
- On the existence of primes in short arithmetical progressions
- On the mean square distribution of primitive roots of unity
- Some problems on the prime factors of consecutive integers
- The Difference between Consecutive Prime Numbers V
- Über die Häufigkeit großer Differenzen konsekutiver Primzahlen
This page was built for publication: On a class of relatively prime sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1254272)