English

Divisor-sum fibers

Number Theory 2018-04-11 v1

Abstract

Let s()s(\cdot) denote the sum-of-proper-divisors function, that is, s(n)=dn, d<nds(n) = \sum_{d\mid n,~d<n}d. Erd\H{o}s-Granville-Pomerance-Spiro conjectured that for any set A\mathcal{A} of asymptotic density zero, the preimage set s1(A)s^{-1}(\mathcal{A}) also has density zero. We prove a weak form of this conjecture: If ϵ(x)\epsilon(x) is any function tending to 00 as xx\to\infty, and A\mathcal{A} is a set of integers of cardinality at most x12+ϵ(x)x^{\frac12+\epsilon(x)}, then the number of integers nxn\le x with s(n)As(n) \in \mathcal{A} is o(x)o(x), as xx\to\infty. In particular, the EGPS conjecture holds for infinite sets with counting function O(x12+ϵ(x))O(x^{\frac12 + \epsilon(x)}). We also disprove a hypothesis from the same paper of EGPS by showing that for any positive numbers α\alpha and ϵ\epsilon, there are integers nn with arbitrarily many ss-preimages lying between α(1ϵ)n\alpha(1-\epsilon)n and α(1+ϵ)n\alpha(1+\epsilon)n. Finally, we make some remarks on solutions nn to congruences of the form σ(n)a(modn)\sigma(n) \equiv a\pmod{n}, proposing a modification of a conjecture appearing in recent work of the first two authors. We also improve a previous upper bound for the number of solutions nxn \leq x, making it uniform in aa.

Keywords

Cite

@article{arxiv.1706.03120,
  title  = {Divisor-sum fibers},
  author = {Paul Pollack and Carl Pomerance and Lola Thompson},
  journal= {arXiv preprint arXiv:1706.03120},
  year   = {2018}
}
R2 v1 2026-06-22T20:14:35.535Z