On primitive sets of squarefree integers
From MaRDI portal
The authors provide a proof of a conjecture of Pomerance and Sárközy (a generalized version) as follows. If \(\mathbb P^{\ast}_N\) is the set of squarefree integers not exceeding \(N\), then \[ \max_{\mathcal A \in \mathbb P^{\ast}_N}\sum_{a \in \mathcal A} {1 \over a} = (1+o(1)){6 \over {\pi^2}} = {{\log N} \over {(2\pi \log \log N)^{1/2}}} \] as \(N\to \infty\). They also povide sharp estimates for \(\max_{\mathcal A \in \mathbb P^{\ast}_N}|\mathcal A|\) and some evidence for new conjectures.
Recommendations
Cited in
(6)- Proof of the P-integer conjecture of Pomerance
- Problems on the set of squarefree numbers
- scientific article; zbMATH DE number 1884328 (Why is no real title available?)
- scientific article; zbMATH DE number 1420975 (Why is no real title available?)
- On divisibility properties of integers of the form a+a'
- On square-free numbers generated from given sets of primes
This page was built for publication: On primitive sets of squarefree integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5948338)