Wouter van Doorn and I have uploaded to the arXiv our paper “Growth rates of sequences governed by the squarefree properties of its translates“. In this paper we answer a number of questions of Erdős} (Problem 1102 and Problem 1103 on the Erdős problem web site) regarding how quickly a sequence 
of increasing natural numbers can grow if one constrains its translates 
to interact with the set 
of squarefree numbers in various ways. For instance, Erdős defined a sequence 
to have “Property 
” if each of its translates only intersected 
in finitely many points. Erdős believed this to be quite a restrictive condition on , writing “Probably a sequence having property P must increase fairly fast, but I have no results in this direction.”. Perhaps surprisingly, we show that while these sequences must be of density zero, they can in fact grow arbitrary slowly in the sense that one can have 
for all sufficiently large 
and any specified function 
that tends to infinity as 
. For instance, one can find a sequence that grows like 
. The density zero claim can be proven by a version of the Maier matrix method, and also follows from known moment estimates on the gaps between squarefree numbers; the latter claim is proven by a greedy construction in which one slowly imposes more and more congruence conditions on the sequence to ensure that various translates of the sequence stop being squarefree after a certain point.
Erdős also defined a somewhat complementary property 
, which asserts that for infinitely many 
, all the elements 
of for 
are square-free. Since the squarefree numbers themselves have density 
, it is easy to see that a sequence with property must have (upper) density at most (because it must be “admissible” in the sense of avoiding one residue class modulo 
for each 
). Erdős observed that any sufficiently rapidly growing (admissible) sequence would obey property but beyond that, Erdős writes “I have no precise information about the rate of increase a sequence having property Q must have.”. Our results in this direction may also be surprising: we show that there exist sequences with property with density exactly (or equivalently, 
). This requires a recursive sieve construction, in which one starts with an initial scale and finds a much larger number 
such that 
is squarefree for most of the squarefree numbers 
(and all of the squarefree numbers ). We quantify Erdős’s remark by showing that an (admissible) sequence will necessarily obey property once it grows significantly faster than 
, but need not obey this property if it only grows like 
. This is achieved through further application of sieve methods.
A third property studied by Erdős is the property of having squarefree sums, so that 
is squarefree for all 
. Erdős writes, “In fact one can find a sequence which grows exponentially. Must such a sequence really increase so fast? I do not expect that there is such a sequence of polynomial growth.” Here our results are relatively weak: we can construct such a sequence that grows like 
, but do not know if this is optimal; the best lower bound we can produce on the growth, coming from the large sieve, is 
. (Somewhat annoyingly, the precise form of the large sieve inequality we needed was not in the literature, so we have an appendix supplying it.) We suspect that further progress on this problem requires advances in inverse sieve theory.
A weaker property than squarefree sums (but stronger than property ), referred to by Erdős as property 
, asserts that there are infinitely many such that all elements of (not just the small ones) are square-free. Here, the situation is close to, but not quite the same, as that for property ; we show that sequences with property must have upper density strictly less than , but can have density arbitrarily close to this value.
Finally, we looked at a further question of Erdős on the size of an admissible set . Because the squarefree numbers are admissible, the maximum number 
of elements of an admissible set up to 
(OEIS A083544) is at least the number ![{|{\mathcal SF} \cap [x]|}](https://s0.wp.com/latex.php?latex=%7B%7C%7B%5Cmathcal+SF%7D+%5Ccap+%5Bx%5D%7C%7D&bg=ffffff&fg=000000&s=0&c=20201002)
of squarefree elements up to (A013928). It was observed by Ruzsa that the former sequence is greater than the latter for infinitely many . Erdős asked, “Probably this holds for all large x. It would be of some interest to estimate A(x) as accurately as possible.”
We are able to show
with the upper bound coming from the large sieve and the lower bound from a probabilistic construction. In contrast, a classical result of Walfisz shows that
![\displaystyle |{\mathcal SF} \cap [x]| - \frac{6}{\pi^2} x \ll x^{1/2} \exp(-c \log^{3/5} x / (\log\log x)^{1/5}).](https://s0.wp.com/latex.php?latex=%5Cdisplaystyle++%7C%7B%5Cmathcal+SF%7D+%5Ccap+%5Bx%5D%7C+-+%5Cfrac%7B6%7D%7B%5Cpi%5E2%7D+x+%5Cll+x%5E%7B1%2F2%7D+%5Cexp%28-c+%5Clog%5E%7B3%2F5%7D+x+%2F+%28%5Clog%5Clog+x%29%5E%7B1%2F5%7D%29.&bg=ffffff&fg=000000&s=0&c=20201002)
Together, this implies that Erdős’s conjecture holds ![{A(x) > |{\mathcal SF} \cap [x]|}](https://s0.wp.com/latex.php?latex=%7BA%28x%29+%3E+%7C%7B%5Cmathcal+SF%7D+%5Ccap+%5Bx%5D%7C%7D&bg=ffffff&fg=000000&s=0&c=20201002)
for all sufficiently large . Numerically, it appears that in fact this conjecture holds for all 
:
However, we do not currently have enough numerical data for the sequence to completely confirm the conjecture in all cases. This could potentially be a crowdsourced project (similar to the Erdős-Guy-Selfridge project reported on in this previous blog post).
