On the number of solutions of N - p = Pr.
DOI10.1515/CRLL.1991.414.117zbMATH Open0702.11065OpenAlexW4235691841MaRDI QIDQ3480158FDOQ3480158
Authors: Jiahai Kan
Publication date: 1991
Published in: Journal fΓΌr die reine und angewandte Mathematik (Crelles Journal) (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/153302
Recommendations
lower boundsupper boundsGoldbach conjecturesievessum of prime and almost primerepresentation of large integers
Goldbach-type theorems; other additive questions involving primes (11P32) Applications of sieve methods (11N36)
Cited In (17)
- Title not available (Why is that?)
- Enumerating solutions to π(π)+π(π)=π(π)+π (π)
- The minimal number of solutions to $\phi(n)=\phi(n+k)$
- Lower and upper bounds for the number of solutions of $p + h = P_{r}$
- Computer Algebra and Geometric Algebra with Applications
- Title not available (Why is that?)
- On the representation of large even integers as sums of a prime and an almost prime, II
- Chen's theorem with small primes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the problem of Goldbach's type
- On the sequence \(p+h\)
- On the number of solutions of \(N-p=P_ 3\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the number of solutions of \(p+h=P_ r\)
This page was built for publication: On the number of solutions of N - p = Pr.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3480158)