请输入您要查询的字词:

 

单词 NumericalVerificationOfTheGoldbachConjecture
释义

Numerical verification of the Goldbach conjecture


  • ABSTRACT:  The Strong Goldbach conjecture, GC, dates back to 1742. It states that every even integer greater than four can be written as the sum of two prime numbersMathworldPlanetmath. Since then, no one has been able to prove the conjecture. The conjecture has been verified to be true for all even integers up to 4.1018. In this article, we prove that the conjecture is true for all integers, with at least three different ways.In short, this treaty has as objective show the proof of GC, and presents a new resolution to the conjecture. Knowing that, these infinitiesMathworldPlanetmath establish other groups of infinities, in a logical way the conviction for the method and idea of proving it, we stand and separate these groups to prove, not only a sequenceMathworldPlanetmath, but the whole embodiment of arithmeticPlanetmathPlanetmath properties called here as groups, as well as its infinity conjectured for centuries.

    Keywords:Goldbach’s Conjecture; Crystallographic group; Cobordism group; Algebraic number theoryMathworldPlanetmath; Multiprime TheoremMathworldPlanetmath’s; Productoria Table.

    AMS Subject Classification:11N05; 11A41; 11A25; 11Y11; 11P32; 05A10; 11N56; 11D99; 11P99; 11N32; 05A17.

  • 随便看

     

    数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

     

    Copyright © 2000-2023 Newdu.com.com All Rights Reserved
    更新时间:2025/5/4 3:46:37