中国搜 为人民服务 在线进行大于2的偶数分解为两个质数分解 希望对你证明哥德巴赫猜想论文有帮助


收藏本页到>> 新浪ViVi  365Key网摘   IE收藏夹 |设为首页

 中国搜首页 >>教育学习搜索>>哥德巴赫猜想  
Goldbach (哥德巴赫猜想)
The famous Goldbach conjecture states that any even number larger than 2 is the sum of two prime numbers. Despite efforts of mathematicians during several centries, this apparently very simple conjecture is still not yet proved (at the time when this page is written: 1999).
译文:著名的哥德巴赫猜想描述任何大于2的偶数是两个质数(素数)之和.尽管数学家们在过去的几个世纪很努力,但是这个看似简单的猜想,直道现在也没有被证明(当然这个页面被书写的日期:1999)

This page has no intention of bringing help to the proof of this conjecture. It simply computes the decompositions into sums of 2 primes, for a number given by you. Its aim is to give you the indication that the big even numbers tends rather to have more and more different such decompositions.
译文:这个页面没有帮助你证明哥德巴赫猜想的意图,它只是对于你提供的偶数,简单的分解为两个质数的和.它的目的是数字越大,分解也越困难.

Give your even number: n =  (填入偶数 )

Type of the search(查找类型):

  • Different decompositions of a same number. (同一数的不同分解)
  • One decomposition for each even number starting from the given one. (从给定偶数开始的数的一个分解)
Number of decompositions by reply: (显示分析结果的个数)


  ©2004   www.zhonguosou.com