| 词条 | Problems involving arithmetic progressions |
| 释义 |
Problems involving arithmetic progressions are of interest in number theory,[1] combinatorics, and computer science, both from theoretical and applied points of view. Largest progression-free subsetsFind the cardinality (denoted by Ak(m)) of the largest subset of {1, 2, ..., m} which contains no progression of k distinct terms. The elements of the forbidden progressions are not required to be consecutive. For example, A4(10) = 8, because {1, 2, 3, 5, 6, 8, 9, 10} has no arithmetic progressions of length 4, while all 9-element subsets of {1, 2, ..., 10} have one. Paul Erdős set a $1000 prize for a question related to this number, collected by Endre Szemerédi for what has become known as Szemerédi's theorem. Arithmetic progressions from prime numbers{{main|Primes in arithmetic progression}}Szemerédi's theorem states that a set of natural numbers of non-zero upper asymptotic density contains finite arithmetic progressions, of any arbitrary length k. Erdős made a more general conjecture from which it would follow that The sequence of primes numbers contains arithmetic progressions of any length. This result was proven by Ben Green and Terence Tao in 2004 and is now known as the Green–Tao theorem.[2] See also Dirichlet's theorem on arithmetic progressions. {{As of|2014}}, the longest known arithmetic progression of primes has length 26:[3]43142746595714191 + 23681770·23#·n, for n = 0 to 25. (23# = 223092870) As of 2011, the longest known arithmetic progression of consecutive primes has length 10. It was found in 1998.[4][5] The progression starts with a 93-digit number 100 99697 24697 14247 63778 66555 87969 84032 95093 24689 19004 18036 03417 75890 43417 03348 88215 90672 29719 and has the common difference 210. Source about Erdős-Turán Conjecture of 1936:
Primes in arithmetic progressionsThe prime number theorem for arithmetic progressions deals with the asymptotic distribution of prime numbers in an arithmetic progression. Covering by and partitioning into arithmetic progressions
See also
Notes1. ^{{cite journal|author=Samuel S. Wagstaff, Jr.|authorlink=Samuel S. Wagstaff, Jr.|title=Some Questions About Arithmetic Progressions|journal=American Mathematical Monthly|volume=86|issue=7|pages=579–582|year=1979|doi=10.2307/2320590|publisher=Mathematical Association of America|jstor=2320590}} 2. ^{{MathWorld|title=Prime Arithmetic Progression|urlname=PrimeArithmeticProgression}} 3. ^Jens Kruse Andersen, Primes in Arithmetic Progression Records. Retrieved on 2014-06-13. 4. ^H. Dubner; T. Forbes; N. Lygeros; M. Mizony; H. Nelson; P. Zimmermann, "Ten consecutive primes in arithmetic progression", Math. Comp. 71 (2002), 1323–1328. 5. ^the Nine and Ten Primes Project 6. ^{{cite journal|author=Vsevolod F. Lev|title=Simultaneous approximations and covering by arithmetic progressions over Fp|doi=10.1006/jcta.1999.3034|year=2000|journal=Journal of Combinatorial Theory, Series A|volume=92|issue=2|pages=103–118}} 7. ^{{Cite OEIS|sequencenumber=A053732|name=Number of ways to partition {1,...,n} into arithmetic progressions of length >= 1}} 8. ^{{Cite OEIS|sequencenumber=A072255|name=Number of ways to partition {1,2,...,n} into arithmetic progressions...}} 1 : Mathematical series |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。