On primitive sets of squarefree integers (Q5948338)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1668861
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On primitive sets of squarefree integers |
scientific article; zbMATH DE number 1668861 |
Statements
On primitive sets of squarefree integers (English)
0 references
5 November 2001
0 references
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.
0 references
primitive sets
0 references
squarefree integers
0 references
0.8187789916992188
0 references
0.8049811720848083
0 references
0.7921647429466248
0 references
0.7811432480812073
0 references