For faster navigation, this Iframe is preloading the Wikiwand page for 格林-陶定理.

格林-陶定理

格林-陶定理(英语:Green-Tao theorem)是本·格林英语Ben_Green_(mathematician)陶哲轩于2004年证明的一个关于质数组成的等差数列存在性定理[1]。质数序列包含任意长的等差数列,是格林-陶定理的著名推论。

定理内容

对于任意的素数集合的子集,若相对于素数集合的上密度(英语:upper density)为正,即:

其中,代表不大于的素数的个数。

那么:

对于任意的正整数中的元素可以组成任意多个长度为的等差数列。[1]

推论

格林-陶定理有以下两个直接的推论:

  • 对于任意正整数,质数序列中存在任意多长度为的等差子序列
  • 质数序列中包含有任意长的等差子序列

目前已知的最长质数等差数列

质数序列中长度为的等差子序列,对于1≤n≤k,目前最好的结果是对于k=26,此等差数列为:

{an=43,142,746,595,714,191 + 23,681,770 · 223,092,870 ·(n-1)}

相关定理与猜想

  • 格林-陶定理是塞迈雷迪定理在素数集上的推广。
  • 格林-陶定理是埃尔德什等差数列猜想的一个特例。
  • 更强的猜想是对于任何正整数r,质数序列中都存在任意长度非r−1阶阶差数列的r阶阶差数列(0阶阶差数列是常数数列,1阶阶差数列是等差数列,依此类推),格林-陶定理就是r=1的特例。对于2阶阶差数列,质数序列中长度为的二阶阶差子序列,对于0≤n≤k−1,目前最好的结果是对于k=45,此数列为36n^2-810n+2753(不管各项的大小顺序,只要序列中没有重复的质数就可以)。

参考文献

  1. ^ 1.0 1.1 Green, Ben; Tao, Terence, The primes contain arbitrarily long arithmetic progressions, Annals of Mathematics, 2008, 167 (2): 481–547, arXiv:math.NT/0404188可免费查阅, doi:10.4007/annals.2008.167.481 .

外部链接

{{bottomLinkPreText}} {{bottomLinkText}}
格林-陶定理
Listen to this article

This browser is not supported by Wikiwand :(
Wikiwand requires a browser with modern capabilities in order to provide you with the best reading experience.
Please download and use one of the following browsers:

This article was just edited, click to reload
This article has been deleted on Wikipedia (Why?)

Back to homepage

Please click Add in the dialog above
Please click Allow in the top-left corner,
then click Install Now in the dialog
Please click Open in the download dialog,
then click Install
Please click the "Downloads" icon in the Safari toolbar, open the first download in the list,
then click Install
{{::$root.activation.text}}

Install Wikiwand

Install on Chrome Install on Firefox
Don't forget to rate us

Tell your friends about Wikiwand!

Gmail Facebook Twitter Link

Enjoying Wikiwand?

Tell your friends and spread the love:
Share on Gmail Share on Facebook Share on Twitter Share on Buffer

Our magic isn't perfect

You can help our automatic cover photo selection by reporting an unsuitable photo.

This photo is visually disturbing This photo is not a good choice

Thank you for helping!


Your input will affect cover photo selection, along with input from other users.

X

Get ready for Wikiwand 2.0 🎉! the new version arrives on September 1st! Don't want to wait?