3 citations · 8 across the 7 of their papers we have counts for
5 papers · 1 filter
Primes in tuples and Romanoff's theorem
Artyom Radomskii
We obtain a lower bound for a number of primes in tuples. As applications, we obtain a lower bound for the Romanoff type representation functions.
Generalization of Romanoff's theorem
Artyom Radomskii
We generalize Romanoff's theorem. Also, we obtain a result on sums related to Euler's totient function.
A large integer is a sum of two prime avoiding numbers
Artyom Radomskii
Let , where is a prime. We show that there is a positive constant such that for any large integer there exist two positive integers and …
On Romanoff's theorem
Artyom Radomskii
We obtain some results related to Romanoff's theorem.
Consecutive primes in short intervals
Artyom Radomskii
We obtain a lower bound for \[ \#\{x/2< p_{n}\leq x:\ p_n \equiv\ldots\equiv p_{n+m}\equiv a\text{ (mod )},\ p_{n+m} - p_{n}\leq y\}, \] where is the pri…