Every sufficiently large odd integer can be written as the sum of three prime numbers. Proved by Ivan Vinogradov using the Hardy-Littlewood circle method, it established the weak Goldbach conjecture for all large enough odd numbers.
Facts
StatementEvery sufficiently large odd integer can be expressed as the sum of three prime numbers. 1 Proof YearThe lead section dates the result broadly to the 1930s; the strategy-of-proof section gives the specific year 1937 for Vinogradov's unconditional bound completing the proof. Classification
Statement Form Connections
Has Statement Form
Entity-backed identity for the statement-form enum value this theorem already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The statement-form fact itself stays on the theorem unchanged.
In Branch
Sources
1. Vinogradov's Theorem (Wikipedia)
Wikimedia FoundationLead section, opening definition
Vinogradov's theorem is a result which implies that any sufficiently large odd integer can be written as a sum of three prime numbers.
Strategy of proof section, sentence dating the unconditional bound to 1937
In 1937 Vinogradov gave an unconditional upper bound for |S(α)|.
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.