Numerical verification of the ternary Goldbach conjecture up to 8.875 10³⁰
From MaRDI portal
Publication:5415565
Abstract: We describe a computation that confirms the ternary Goldbach Conjecture up to 8,875,694,145,621,773,516,800,000,000,000 (>8.875e30).
Recommendations
Cites work
Cited in
(9)- Inductive formulas related to prime partitions
- The ternary Goldbach problem with a prime and two isolated primes
- Two independent checkings of the weak Goldbach conjecture up to \(10^{27}\)
- A consequence of the ternary Goldbach theorem
- Checking the odd Goldbach conjecture up to 10²⁰
- Empirical verification of the even Goldbach conjecture and computation of prime gaps up to 4⋅10¹⁸
- Computers as a novel mathematical reality. I: A personal account
- Reviews An Introduction to the Circle Method . By M. Ram Murty & Kaneenika Sinha, American Mathematical Society, 2023. 258 pp., ISBN 978-1-4704-7203-0, $59.00.
- Computers as a novel mathematical reality. IV: The Goldbach problem
This page was built for publication: Numerical verification of the ternary Goldbach conjecture up to \(8.875 {\cdot} 10^{30}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5415565)