Related papers: Additive problems with almost prime squares

We consider the question of existence of ramified covers over P_1 matching certain prescribed ramification conditions. This problem has already been faced in a number of papers, but we discuss alternative approaches for an existence proof,…

In the paper we can prove that every integer can be written as the sum of two integers, one perfect square and one squarefree. We also establish the asympotic formula for the number of representations of an integer in this form. The result…

For $n \geq 3$, an asymptotic formula is derived for the number of representations of a sufficiently large natural number $N$ as a sum of $r = 2^n + 1$ summands, each of which is an $n$-th power of natural numbers $x_i$, $i = \overline{1,…

In 1951, Linnik proved the existence of a constant $K$ such that every sufficiently large even number is the sum of two primes and at most $K$ powers of 2. Since then, this style of approximation has been considered for problems similar to…

We show that there are infinitely many primes $p$ such that $p-1$ is divisible by a square $d^2 \geq p^\theta$ for $\theta=1/2+1/2000.$ This improves the work of Matom\"aki (2009) who obtained the result for $\theta=1/2-\varepsilon$ (with…

Assuming the Riemann Hypothesis we obtain asymptotic estimates for the mean value of the number of representations of an integer as a sum of two primes. By proving a corresponding Omega-term, we prove that our result is essentially the best…

We show that every sufficiently large $x\equiv 3(4)$ can be written as the sum of three primes, each of which is a sum of a square and a prime square. The main tools are a transference version of the circle method and various sieve related…

We provide a geometric interpretation of Brillhart's celebrated algorithm for expressing a prime $p\equiv 1\pmod 4$ as the sum of two squares.

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…

Let $b \ge 2$ be an integer. Among other results, we establish, in a quantitative form, that any sufficiently large integer which is not a multiple of $b$ cannot have simultaneously only few distinct prime factors and only few nonzero…

We examine the representation of numbers as the sum of two squares in $\mathbb{Z}_n$ for a general positive integer $n$. Using this information we make some comments about the density of positive integers which can be represented as the sum…

In the present paper we prove that every sufficiently large odd integer $N$ can be represented in the form \begin{equation*} N=p_1+p_2+p_3\,, \end{equation*} where $p_1,p_2,p_3$ are primes, such that $p_1=x^2 + y^2 +1$, $p_2=[n^c]$.

We demonstrate that there are infinitely many integers that cannot be expressed as the sum of two squares of integers and up to two non-negative integer powers of 2.

A conjecture of Cai-Zhang-Shen for figurate primes says that every integer $k>1$ is the sum of two figurate primes. In this paper we give an equivalent proposition to the conjecture. By considering extreme value problems with constraints…

In this note, we try to understand the recent development on the Waring-Goldbach problem involving cubes of primes. Especially, we want to determine whether integers that are either primes, squares of primes, cubes of primes, or a cube of…

This paper examines with elementary proofs some interesting properties of numbers in the binary quadratic form $a^2+ab+b^2$, where $a$ and $b$ are non-negative integers. Key findings of this paper are (i) a prime number $p$ can be…

We investigate exponential sums over singular binary quartic forms, proving an explicit formula for the finite field Fourier transform of this set. Our formula shares much in common with analogous formulas proved previously for other vector…

We investigate the asymptotic formula for the number of representations of a large positive integer as a sum of $k$-th powers of integers represented as the sums of three positive cubes, counted with multiplicities. We also obtain a lower…

By assuming some widely-believed arithmetic conjectures, we show that the task of accepting a number that is representable as a sum of $d\geq2$ squares subjected to given congruence conditions is NP-complete. On the other hand, we develop…

We study short intervals which contain an ``almost square'', an integer $n$ that can be factored as $n = ab$ with $a$, $b$ close to $\sqrt{n}$. This is related to the problem on distribution of $n^2 \alpha \pmod 1$ and the problem on gaps…