Related papers: An explicit version of Chen's theorem assuming the…

In order to study the analytic properties of the Goldbach generating function we consider a smooth version, similar to the Chebyshev function for the Prime Number Theorem. In this paper, we obtain explicit numerical estimates for the…

Under the fundamental theorem of arithmetic, any integer $n>1$ can be uniquely written as a product of prime powers $p^a$; factoring each exponent $a$ as a product of prime powers $q^b$, and so on, one will obtain what is called the tower…

We prove that there are infinitely many $n$ such that $\omega(n+k) \ll \log k$ for all integers $k \ge 2$. This improves on a result of Tao-Ter\"{a}v\"{a}inen (2025), who has $O(k)$ in place of $O(\log k)$. As corollaries, we make progress…

Generalised Fermat equation (GFE) is the equation of the form $ax^p+by^q=cz^r$, where $a,b,c,p,q,r$ are positive integers. If $1/p+1/q+1/r<1$, GFE is known to have at most finitely many primitive integer solutions $(x,y,z)$. A large body of…

An positive even number is said to be a Kronecker number if it can be written in infinitely many ways as the difference between two primes, and it is believed that all even numbers are Kronecker numbers. We will study the division and…

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…

A positive integer n is said to be perfect if sigma(n)=2n, where sigma denotes the sum of the divisors of n. In this article, we show that if n is an even perfect number, then any integer m<=n is expressed as a sum of some of divisors of n.

Let $f$ be a Rademacher or a Steinhaus random multiplicative function. Let $\varepsilon>0$ small. We prove that, as $x\rightarrow +\infty$, we almost surely have $$\bigg|\sum_{\substack{n\leq x\\…

We establish estimates for the number of ways to represent any reduced residue class as a product of a prime and an integer free of small prime factors. Our best results is conditional on the Generalised Riemann hypothesis (GRH). As a…

We show that the greatest prime factor of $n^2+h$ is at least $n^{1.312}$ infinitely often. This gives an unconditional proof for the range previously known under the Selberg eigenvalue conjecture. Furthermore, we get uniformity in $h \leq…

The theorem presented in this paper allows the creation of large prime numbers (of order up to o(n^2)) given a table of all primes up to n.

Let $\Omega(n)$ denote the number of prime factors of $n$. We show that for any bounded $f\colon\mathbb{N}\to\mathbb{C}$ one has \[ \frac{1}{N}\sum_{n=1}^N\, f(\Omega(n)+1)=\frac{1}{N}\sum_{n=1}^N\, f(\Omega(n))+\mathrm{o}_{N\to\infty}(1).…

For any real $k\geq 2$ and large prime $q$, we prove a lower bound on the $2k$-th moment of the Dirichlet character sum \begin{equation*} \frac{1}{\phi(q)} \sum_{\substack{\chi \text{ mod }q\\ \chi\neq \chi_0}} \Big| \sum_{n\leq x}…

This document seeks to prove there are infinitely many primes whose difference is 2, referred to as twin prime pairs. This proof's methodology involves constructing a function that approximates the number of positive integers, less than a…

For each primitive Dirichlet character $\chi$, a hypothesis ${\rm GRH}^\dagger[\chi]$ is formulated in terms of zeros of the associated $L$-function $L(s,\chi)$. It is shown that for any such character, ${\rm GRH}^\dagger[\chi]$ is…

For each positive integer $n$, function $f$, and point $c$, the GGR Theorem states that $f$ is $n$ times Peano differentiable at $c$ if and only if $f$ is $n-1$ times Peano differentiable at $c$ and the following $n$-th generalized…

For g,n coprime integers, let l_g(n) denote the multiplicative order of g modulo n. Motivated by a conjecture of Arnold, we study the average of l_g(n) as n <= x ranges over integers coprime to g, and x tending to infinity. Assuming the…

Let $P$ be the set of all prime numbers, ${q_1},{q_2}, \cdots ,{q_m} \in P$, $P_k$ be the k-th $(k = 1,2, \cdots m)$ element of $P$ in ascending order of size, ${\alpha _1},{\alpha _2}, \cdots ,{\alpha _m}$ be positive integers, and ${\beta…

Schatunowsky's 1893 theorem, that 30 is the largest number all of whose totatives are primes, has been recently generalized by Kaneko and Nakai. In its generalized form, it states the finiteness of the set of all positive numbers $n$,…

The ternary Goldbach conjecture, or three-primes problem, states that every odd number $n$ greater than $5$ can be written as the sum of three primes. The conjecture, posed in 1742, remained unsolved until now, in spite of great progress in…