Search arXiv⌕ Search

arXiv · 2611.07617

On a problem due to Erdős concerning $w_1(n)$

Abstract

Adopting notation from Erdős [Congress. Numer., 1980], we define $w_1(n) = w(n)$ for positive integers $n$ so that $w(1) = 0$ and so that: If $n > 1$ and $n = \prod p^{α_p}$, then $w(n) = \sum_{p^{α_p} \parallel n} \frac{n}{p^{α_p}}$. By then defining $V(x)=\bigl|\{w(n):1\le n\le x\}\bigr|$ for $x \geq 1$, Erdős considered whether or not $V(x) = o(x)$ and left this as an open problem. This same problem was also given as an open problem in Guy's famous textbook on unsolved problems in number theory and seems to have remained open. We solve this problem by proving that $V(x) \neq o(x)$, and, moreover, by proving the stronger result such that $\liminf_{x \to \infty} \frac{V(x)}{x} > 0$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

John M. Campbell. 2026-11-05. On a problem due to Erdős concerning $w_1(n)$. https://arxiv.org/abs/2611.07617

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Arithmetic Upper and Lower Bounds for the Denumerant Function

We use an elementary arithmetic argument, going back to Blom and Fr{ö}berg, to obtain upper and lower bounds for the denumerant function of Sylvester for arbitrary positive integers $a_1,\dots,a_k$. The bounds hold along the multiples of $\gcd(a_1,\dots,a_k)$, share the leading term of the denumerant, and yield its asymptotic behaviour with an explicit error term; for large $n$ and under a mild condition, a polynomial refinement of the lower bound improves on the lower bound of Agnarsson.

math.NT↗

The Riemann hypothesis

The Weyl symbolic calculus of operators leads to the construction, if one takes for symbol a certain distribution decomposing over the zeros of the Riemann zeta function, of an operator with the following property: the Riemann hypothesis is equivalent to the validity of a collection of estimates involving this operator. Pseudodifferential arithmetic, a novel chapter of pseudodifferential operator theory, makes it possible to make the operator under study fully explicit. This leads to a proof of the conjecture.

math.NT↗

On the representation functions of certain numeration systems

Let $β>1$ be fixed. We consider the $(\mathbf{b},\mathcal{D})$-numeration system, where the base sequence $\mathbf{b}=(b_k)_{k\geq 0}$ consists of positive real numbers satisfying $\lim_{k\rightarrow \infty}b_{k+1}/b_k=β$, and the digit set $\mathcal{D}\ni 0$ is a finite set of nonnegative real numbers containing at least two elements. Let $r_{\mathbf{b},\mathcal{D}}(λ)$ denote the number of representations of a given $λ\in\mathbb{R}$ in the form $\sum_{k\ge 0}δ_kb_k$ with digits $δ_k\in \mathcal{D}$. We establish upper bounds for $r_{\mathbf{b},\mathcal{D}}(λ)$ as well as asymptotic formulas for its arbitrary moments. Furthermore, we prove that the associated Dirichlet series $ζ_{\mathbf{b},\mathcal{D}}(s):=\sum_{λ>0}r_{\mathbf{b},\mathcal{D}}(λ)λ^{-s}$ admits a meromorphic continuation to the entire complex plane when $b_k=β^{k}$, and to the half-plane $\mathrm{Re}(s)>\log_β\mathcal{D}-γ$ when $b_k=β^{k}+O(β^{(1-γ)k})$ for any fixed $γ\in(0,1]$. Within the regions of continuation, we determine all candidate poles, compute their corresponding residues, and locate the trivial zeros of $ζ_{\mathbf{b},\mathcal{D}}(s)$. As an application, we resolve several problems posed by Chow and Slattery concerning partitions into distinct terms of certain integer sequences.

math.NT↗