Matches in DBpedia 2015-10 for { <http://dbpedia.org/resource/Vinogradovs_theorem> ?p ?o }
Showing triples 1 to 46 of
46
with 100 triples per page.
- Vinogradovs_theorem abstract "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. It is named after Ivan Matveyevich Vinogradov who proved it in the 1930s. Hardy and Littlewood had shown earlier that this result followed from the generalized Riemann hypothesis, and Vinogradov was able to remove this assumption. The full statement of Vinogradov's theorem gives asymptotic bounds on the number of representations of an odd integer as a sum of three primes.".
- Vinogradovs_theorem wikiPageID "4633030".
- Vinogradovs_theorem wikiPageLength "4941".
- Vinogradovs_theorem wikiPageOutDegree "17".
- Vinogradovs_theorem wikiPageRevisionID "674176962".
- Vinogradovs_theorem wikiPageWikiLink Asymptotic_analysis.
- Vinogradovs_theorem wikiPageWikiLink Bob_Vaughan.
- Vinogradovs_theorem wikiPageWikiLink Category:Theorems_about_prime_numbers.
- Vinogradovs_theorem wikiPageWikiLink Dirichlets_approximation_theorem.
- Vinogradovs_theorem wikiPageWikiLink Eventually_(mathematics).
- Vinogradovs_theorem wikiPageWikiLink Exponential_sum.
- Vinogradovs_theorem wikiPageWikiLink Goldbachs_weak_conjecture.
- Vinogradovs_theorem wikiPageWikiLink Hardy–Littlewood_circle_method.
- Vinogradovs_theorem wikiPageWikiLink Integer.
- Vinogradovs_theorem wikiPageWikiLink Ivan_Matveyevich_Vinogradov.
- Vinogradovs_theorem wikiPageWikiLink Number_theory.
- Vinogradovs_theorem wikiPageWikiLink Prime_number.
- Vinogradovs_theorem wikiPageWikiLink Riemann_hypothesis.
- Vinogradovs_theorem wikiPageWikiLink Siegel-Walfisz_theorem.
- Vinogradovs_theorem wikiPageWikiLink Siegel–Walfisz_theorem.
- Vinogradovs_theorem wikiPageWikiLink Sufficiently_large.
- Vinogradovs_theorem wikiPageWikiLink Vaughans_identity.
- Vinogradovs_theorem wikiPageWikiLink Von_Mangoldt_function.
- Vinogradovs_theorem wikiPageWikiLinkText "Vinogradov's theorem".
- Vinogradovs_theorem hasPhotoCollection Vinogradovs_theorem.
- Vinogradovs_theorem title "Vinogradov's Theorem".
- Vinogradovs_theorem urlname "VinogradovsTheorem".
- Vinogradovs_theorem wikiPageUsesTemplate Template:Cite_book.
- Vinogradovs_theorem wikiPageUsesTemplate Template:MathWorld.
- Vinogradovs_theorem subject Category:Theorems_about_prime_numbers.
- Vinogradovs_theorem hypernym Result.
- Vinogradovs_theorem comment "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. It is named after Ivan Matveyevich Vinogradov who proved it in the 1930s.".
- Vinogradovs_theorem label "Vinogradov's theorem".
- Vinogradovs_theorem sameAs مبرهنة_فينوغرادوف.
- Vinogradovs_theorem sameAs Satz_von_Winogradow.
- Vinogradovs_theorem sameAs Teorema_de_Vinográdov.
- Vinogradovs_theorem sameAs Théorème_de_Vinogradov.
- Vinogradovs_theorem sameAs ヴィノグラードフの定理.
- Vinogradovs_theorem sameAs Stelling_van_Vinogradov.
- Vinogradovs_theorem sameAs Teorema_de_Vinogradov.
- Vinogradovs_theorem sameAs m.0cdn10.
- Vinogradovs_theorem sameAs Vinogradovs_sats.
- Vinogradovs_theorem sameAs Q1694565.
- Vinogradovs_theorem sameAs Q1694565.
- Vinogradovs_theorem wasDerivedFrom Vinogradovs_theoremoldid=674176962.
- Vinogradovs_theorem isPrimaryTopicOf Vinogradovs_theorem.