Related papers: Sums involving the number of distinct prime factor…

We introduce a general class $F_0$ of additive functions $f$ such that $f(p) = 1$ and prove a tight bound for exponential sums of the form $\sum_{n \le x} f(n) e(\alpha n)$ where $f \in F_0$ and $e(\theta) = \exp(2\pi i \theta)$. Both…

The main objective of this article is to study the exponential sums associated to Fourier coefficients of modular forms supported at numbers having a fixed set of prime factors. This is achieved by establishing an improvement on…

Factorization of numbers with the help of Gauss sums relies on an intimate relationship between the maxima of these functions and the factors. Indeed, when we restrict ourselves to integer arguments of the Gauss sum we profit from a…

We present lower bounds on the sum and product of the distinct prime factors of an odd perfect number, which provide a lower bound on the size of the odd perfect number as a function of the number of its distinct prime factors.

Let $\omega(n)$ denote the number of distinct prime factors of $n$. Assuming a suitably uniform version of the prime $k$-tuples conjecture, we show that the number \begin{align*} \sum_{n=1}^\infty \frac{\omega(n)}{2^n} \end{align*} is…

Let $f(n)$ be the number of distinct exponents in the prime factorization of the natural number $n$. We prove some results about the distribution of $f(n)$. In particular, for any positive integer $k$, we obtain that $$ \#\{n \leq x : f(n)…

A finite sum of exponential functions may be expressed by a linear combination of powers of the independent variable and by successive integrals of the sum. This is proved for the general case and the connection between the parameters in…

We examine oscillations in a number of sums of arithmetic functions involving $\Omega(n)$, the total number of prime factors of $n$, and $\omega(n)$, the number of distinct prime factors of $n$. In particular, we examine oscillations in…

In this paper, we introduce some explicit approximations for the summation $\sum_{k\leq n}\Omega(k)$, where $\Omega(k)$ is the total number of prime factors of $k$.

In this paper, we present a general framework for the derivation of interesting finite combinatorial sums starting with certain classes of polynomial identities. The sums that can be derived involve products of binomial coefficients and…

We introduce and consider a certain probability question involving elementary number theory and the likelihood that a fixed prime will appear in a certain recursively defined factorization of an integer. We derive several convergent…

We obtain an effective analytic formula, with explicit constants, for the number of distinct irreducible factors of a polynomial $f \in \mathbb{Z}[x]$. We use an explicit version of Mertens' theorem for number fields to estimate a related…

We give some theoretical and computational results on "random" harmonic sums with prime numbers, and more generally, for integers with a fixed number of prime factors.

In this paper, we consider universal sums of generalized polygonal numbers. Fixing $m\in\mathbb{N}_{\geq 3}$, we show two finiteness theorems for universal sums of generalized polygonal numbers whose inputs have a restricted number $L$ of…

In this paper we prove a weighted sum formula for multiple harmonic sums modulo primes, thereby proving a weighted sum formula for finite multiple zeta values. Our proof utilizes difference equations for the generating series of multiple…

In this note, we propose simple summations for primes, which involve two finite nested sums and Bernoulli numbers. The summations can also be expressed in terms of Bernoulli polynomials.

We present a function that tests for primality, factorizes composites and builds a closed form expression of $\pi(n^2)$ in terms of $\sum_{3 \leq p \leq n} \frac{1}{p}$ and a weaker version of $\omega(n)$.

We use an elementary argument to prove some finite sums involving expressions of the forms $(q)_n$ and $(a;q)_n$ along with inductive formulas for some sequences.

In this paper, we explore a variety of series involving the central binomial coefficients, highlighting their structural properties and connections to other mathematical objects. Specifically, we derive new closed-form representations and…

A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…