Romanov type problems
From MaRDI portal
Recommendations
Cites work
- Approximate formulas for some functions of prime numbers
- scientific article; zbMATH DE number 1303174 (Why is no real title available?)
- scientific article; zbMATH DE number 914352 (Why is no real title available?)
- scientific article; zbMATH DE number 3056395 (Why is no real title available?)
- scientific article; zbMATH DE number 3063030 (Why is no real title available?)
- Numbers and functions. From a classical-experimental mathematician's point of view
- On a problem of Oppenheim concerning Factorisatio Numerorum
- On integers of the form p+2k
- On the sum of a prime and a Fibonacci number
- On the sumset of the primes and a linear recurrence
- Sums of primes and quadratic linear recurrence sequences
- Unsolved problems in number theory
Cited in
(12)- On Romanov's constant
- Extending an Erdős result on a Romanov type problem
- Fermat numbers and integers of the form ak+al+pα
- On a problem of Romanoff type
- Quantitative Romanoff theorem
- On a variant of Pillai's problem with factorials and S-units
- On integers of the form \(2^{g(j_1)}+2^{g(j_2)}+p\)
- On integers of the form \(p+ 2^{a^2}+ 2^{b^2}\)
- A generalization of the Romanoff theorem
- Romanoff's theorem for polynomials over finite fields revisited. II
- Solutions to a Romanoff type problem
- A note on Romanov's constant
This page was built for publication: Romanov type problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1623879)