Proof of a heuristic principle in additive problems with primes

DOI10.1007/BF01105394zbMath0314.10032OpenAlexW1963571764MaRDI QIDQ1220531

B. M. Bredikhin, N. A. Yakovleva

Publication date: 1975

Published in: Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01105394

Mathematics Subject Classification ID

Goldbach-type theorems; other additive questions involving primes (11P32) Representation problems (11D85)

Related Items (2)

An elementary estimate of G(n) in Waring's problem ⋮ Binary Goldbach problem with restrictions on the summands

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Proof of a heuristic principle in additive problems with primes