arXiv subjects
Publications and source records attributed to Doychin Tolev.
In this paper we consider the equation $[p^{c}] + [m^{c}] = N$, where $N$ is a sufficiently large integer, and prove that if $1 < c < \frac{29}{28}$, then it has a solution in a prime $p$ and an almost prime $m$ with at most $\left[ \frac{52}{29 - 28 c}\right] + 1 $ prime factors.
It is not difficult to find an asymptotic formula for the number of pairs of positive integers $x, y \le H$ such that $x^2 + y^2 + 1$ is squarefree. In the present paper we improve the estimate for the error term in this formula using the properties of certain exponential sums. A.Weils's estimate for the Kloosterman sum plays the major role in our analysis.
We find an asymptotic formula for the number of pairs of positive integers $x_1, x_2 \le H$ such that the product $x_1 x_2$ is a $k$-th power.
We consider the ternary Goldbach problem with two prime variables of the form $k^2+m^2+1$ and find an asymptotic formula for the number of its solutions.
We study the binary Goldbach problem with arithmetic weights attached to one of the variables.
We establish Bombieri-Vinogradov's type result for the number of solutions of the ternary Goldbach problem with primes from arithmetic progressions.
We cosider the number of r-tuples of squarefree numbers in a short interval. We prove that it cannot be much bigger than the expected value and we also estabish an asymptotic formula if the interval is not very short.