请输入您要查询的字词:

 

单词 Sierpinski's Prime Sequence Theorem
释义

Sierpinski's Prime Sequence Theorem

For any , there exists a such that the sequence


where , 2, ...contains at least Primes.

See also Dirichlet's Theorem, Fermat 4n+1 Theorem, Sierpinski's Composite NumberTheorem


References

Abel, U. and Siebert, H. ``Sequences with Large Numbers of Prime Values.'' Amer. Math. Monthly 100, 167-169, 1993.

Ageev, A. A. ``Sierpinski's Theorem is Deducible from Euler and Dirichlet.'' Amer. Math. Monthly 101, 659-660, 1994.

Forman, R. ``Sequences with Many Primes.'' Amer. Math. Monthly 99, 548-557, 1992.

Garrison, B. ``Polynomials with Large Numbers of Prime Values.'' Amer. Math. Monthly 97, 316-317, 1990.

Sierpinski, W. ``Les binômes et les nombres premiers.'' Bull. Soc. Roy. Sci. Liege 33, 259-260, 1964.


随便看

 

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

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2024/5/20 16:32:33