- 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
- 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
- 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
- 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们。
- 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
- 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
连续正整数的乘积不是方幂
THE PRODUCT OF CONSECUTIVE INTEGERS
IS NEVER A POWER
BY
P. ERD6S AND J. L. SELFRIDGE
We dedicate this paper to the memory of our friends H. Davenport, Ju.V.
Linnik, L. J. Mordell, L. Moser, A. Rnyi and W. Sierpiski, all of whom were
alive when we started our work in 1966 at the University of Illinois at Urbana.
0. Introduction
It was conjectured about 150 years ago that the product of consecutive
integers is never a power. That is, the equation
(n + 1)’ (n + k)-- x’ (1)
has no solution in integers with k 2, l 2 and n 0. (These restrictions
on k, I and n will be implicit throughout this paper.) The early literature on this
subject can be found in Dickson’s history and the somewhat later literature in
the paper of Oblfith [5].
Rigge [-6-], and a few months later Erd6s [1], proved the conjecture for I 2.
Later these two authors ]-1] proved that for fixed l there are at most finitely
many solutions to (1). In 1940, Erd6s and Siegel jointly proved that there is
an absolute constant c such that (1) has no solutions with k c, but this proof
was never published. Later Erd6s [2] found a different proof; by improving
the method used, we can now completely establish the old conjecture. Thus
we shall prove:
THEOREM 1. The product of two or more consecutive positive integers is
never a power.
In fact we shall prove a stronger result:
THEOREM 2. Let k, l, n be integers such that k 3, 2 and n + k pt),
where pt) is the least prime satisfying pt) k. Then there is a prime p kfor
which v 0 (modl), where is the power ofp dividing (n + 1)...(n + k).
Theorem 2 implies Theorem 1, since it is easy to see that (n + 1)(n + 2)is
never an/th power and if n k then by Bertrand’s postulate the largest prime
fac
原创力文档


文档评论(0)