相关论文: An Explicit Result for the Sum of Two Almost Prime…

We formulate some refinements of Goldbach's conjectures based on heuristic arguments and numerical data. For instance, any even number greater than 4 is conjectured to be a sum of two primes with one prime being 3 mod 4. In general, for…

It is a classic result of Selberg in the 1950's that $\theta_2 = 2/3$, where $\theta_2$ is the level of distribution of the divisor function in arithmetic progressions (defined more precisely below). Selberg applies this estimate, together…

We study the representations of large integers $n$ as sums $p_1^2 + ... + p_s^2$, where $p_1,..., p_s$ are primes with $| p_i - (n/s)^{1/2} | \le n^{\theta/2}$, for some fixed $\theta < 1$. When $s = 5$ we use a sieve method to show that…

We prove that every positive integer $n$ which is not equal to $1$, $2$, $3$, $6$, $11$, $30$, $155$, or $247$ can be represented as a sum of a squarefree number and a prime not exceeding $\sqrt{n}$.

With an artificial (p', n')-system it has been proved that even numbers > (p(x))^2 are the sum of two p > p(x).

We give a large sieve type inequality for functions supported on primes. As application we prove a conjecture by Elliott, and give bounds for short character sums over primes. The proves uses a combination of the large sieve and the Selberg…

Let $p$ be a prime. We define $S(p)$ the smallest number $k$ such that every positive integer is a sum of at most $k$ squares of integers that are not divisible by $p$. In this article, we prove that $S(2)=10$, $S(3)=6$, $S(5)=5$, and…

By developing the method of Wooley on the quadratic Waring-Goldbach problem, we prove that all sufficiently large even integers can be expressed as a sum of four squares of primes and 46 powers of 2.

We establish that almost every positive integer $n$ is the sum of four cubes, two of which are at most $n^{\theta}$, as long as $\theta\geq192/869$. An asymptotic formula for the number of such representations is established when…

We show that almost every positive integer can be expressed as a sum of four squares of integers represented as the sums of three positive cubes.

For $k\ge1$, a $k$-almost prime is a positive integer with exactly $k$ prime factors, counted with multiplicity. In this article we give elementary proofs of precise asymptotics for the reciprocal sum of $k$-almost primes. Our results match…

A classical theorem in number theory due to Euler states that a positive integer $z$ can be written as the sum of two squares if and only if all prime factors $q$ of $z$, with $q\equiv 3 \pmod{4}$, have even exponent in the prime…

We extend a result by Ikeda and Suriajaya (2025) to find the asymptotic behaviour of the average number of representations of an integer $n$, over multiples of a fixed $q\ge 2$, as a sum of two prime $k$-th powers, for $k\ge 2$.

Solving a problem by Erd\H{o}s, we prove that every positive integer $n$ can be written as a sum $$n = b_{1} + b_{2} + \ldots + b_{r}$$ of distinct $3$-smooth integers with $1 \le b_{1} < b_{2} < \ldots < b_{r} < 6b_{1}$.

After certain subsets of Natural numbers called Range and Row are defined, we assume (1) there is a function that can produce prime numbers and (2) each even number greater than 2, like A, can be represented as the sum of n prime numbers.…

We show that for any set $D$ of at least two digits in a given base $b$, there exists a $\delta(D,b)>0$ such that within the set $\mathcal{A}$ of numbers whose digits base $b$ are exclusively from $D$, the number of even integers in…

The Selberg sieve provides majorants for certain arithmetic sequences, such as the primes and the twin primes. We prove an L^2-L^p restriction theorem for majorants of this type. An immediate application is to the estimation of exponential…

We present and analyze an algorithm to enumerate all integers $n\le x$ that can be written as the sum of consecutive $k$th powers of primes, for $k>1$. We show that the number of such integers $n$ is asymptotically bounded by a constant…

Given an integer $n \ge 2$, its prime factorization is expressed as $n= \prod_{i=1}^s p_i^{a_i}$. We define the function $f(n)$ as the smallest positive integer such that $f(n)!$ is divisible by $n$. The main objective of this paper is to…

We prove new results on the additive theory of reversed primes $\overleftarrow{p}$; that is, primes $p$ which are written backwards in a fixed base $b\geq 2$. In particular, we study a variant of Goldbach's conjecture, looking at…