Vinogradov's theoremVinogradov's theorem
Common
Rarity: Common
The most frequent rarity: most Wikipedia articles become Commons.
Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.
At a glance
- Class
- Notion
- Domain
- Science and technology
- In collections
- Nobody has pulled it yet.
What Wikipedia says
In number theory, Vinogradov's theorem is a result which implies that any sufficiently large odd integer can be written as a sum of three prime numbers. It is a weaker form of Goldbach's weak conjecture, which would imply the existence of such a representation for all odd integers greater than five.
Excerpt from the Wikipedia article “Vinogradov's theorem”, under the CC BY-SA 4.0 license. Read the article on Wikipedia
Image: Unknown author, Public domain, via Wikimedia Commons.
Open free boosters and add Vinogradov's theorem to your collection.
Play for free

