Related papers: On sums of prime factors

We consider $\Phi(x)=x^{-\frac{1}{4}}\left[1-2\sqrt{x}\Sigma e^{-p^2\pi x}\ln p\right]$ on $x>0$, where the sum is over all primes $p$. If $\Phi$ is bounded on $x>0$, then the Riemann hypothesis is true or there are infinitely many zeros…

Let $p>5$ be a fixed prime. We obtain an asymptotic formula related to small solutions of quadratic congruences of the form $x_1^2+x_2^2\equiv x_3^2\bmod{p^n}$ where $\max\{|x_1|,|x_2|,|x_3|\}\le p^{\nu n}$ with $\nu>1/2$.

We derive a central limit theorem for sums of a function of independent sums of independent and identically distributed random variables. In particular we show that previously known result from Rempa\la and Weso\lowski (Statist. Probab.…

We present an asymptotic evaluation unitary formula for large argument values existing for defined class of functions. The asymptotic evaluation is obtained using only power series expansion coefficients of a function, what is a new result…

The paper considers estimates for the asymptotics of summation functions of bounded multiplicative arithmetic functions. Several assertions on this subject are proved and examples are considered.

We illustrate how elementary information-theoretic ideas may be employed to provide proofs for well-known, nontrivial results in number theory. Specifically, we give an elementary and fairly short proof of the following asymptotic result:…

Let $\{p_j(n)\}_{j=1}^{\omega(n)}$ denote the increasing sequence of distinct prime factors of an integer $n$. For $z\geqslant 0$, let $G(n;z)$ denote the number of those indexes $j$ such that $p_{j+1}(n)>p_j(n)^{\exp z}$. We show uniform…

Gerard and Washington proved that, for $k > -1$, the number of primes less than $x^{k+1}$ can be well approximated by summing the $k$-th powers of all primes up to $x$. We extend this result to primes in arithmetic progressions: we prove…

Let $x \geq 1$ be a large number, let $f(x) \in \mathbb{Z}[x]$ be a prime polynomial of degree $\text{deg}(f)=m$, and let $u\ne \pm 1, v^2$ be a fixed integer. Assuming the Bateman-Horn conjecture, an asymptotic counting function for the…

We give an asymptotic for the number of prime solutions to $Q(x_1,\dots, x_8) = N$, subject to a mild non-degeneracy condition on the homogeneous quadratic form $Q$. The argument initially proceeds via the circle method, but this does not…

In recent work, we considered the frequencies of patterns of consecutive primes $\pmod{q}$ and numerically found biases toward certain patterns and against others. We made a conjecture explaining these biases, the dominant factor in which…

Let $A(s) = \sum_n a_n n^{-s}$ be a Dirichlet series admitting meromorphic continuation to the complex plane. Assume we know the location of the poles of $A(s)$ with $|\Im s| \leq T$, and their residues, for some large constant $T$. It is…

The function $\inf_n nx^{1/n}$ has the asymptotics $eu+e d^2(u)/(2u)+O(1/u^2)$ as $x\to\infty$, where $u=\log x$ and $d(u)$ is the distance from $u$ to the nearest integer. We generalize this observation. First, the curves $y=nx^{1/n}$ can…

An arithmetic formula is an expression involving only the constant $1$, and the binary operations of addition and multiplication, with multiplication by $1$ not allowed. We obtain an asymptotic formula for the number of arithmetic formulas…

We examine the behavior of the coefficients of powers of polynomials over a finite field of prime order. Extending the work of Allouche-Berthe, 1997, we study a(n), the number of occurring strings of length n among coefficients of any power…

Given a function f with an absolutely convergent Fourier series, we define the norm of f as ||f||_A = the sum of absolute values of the Fourier coefficients of f. We study the behavior of ||f^n||_A as n goes to infinity, for f of the form…

We establish formulas for the constant factor in several asymptotic estimates related to the distribution of integer and polynomial divisors. The formulas are then used to approximate these factors numerically.

In this paper we introduce and study a family $\Phi_k$ of arithmetic functions generalizing Euler's totient function. These functions are given by the number of solutions to the equation $\gcd(x_1^2+\ldots +x_k^2, n)=1$ with $x_1,\ldots,x_k…

We analyze the representation of $A^{n}$ as a linear combination of $A^{j},\ 0\leq j\leq k-1,$ where $A$ is a $k\times k$ matrix. We obtain a first order asymptotic approximation of $A^{n}$ as $n\to\infty,$ without imposing any special…

Let $k$ and $n$ be natural numbers. Let $\omega_k(n)$ denote the number of distinct prime factors of $n$ with multiplicity $k$ as studied by Elma and the third author. We obtain asymptotic estimates for the first and the second moments of…