One more answer

来源: yma16 2003-07-03 12:46:00 [] [旧帖] [给我悄悄话] 本文已被阅读: 0 次 (479 bytes)
本文内容已被 [ yma16 ] 在 2004-02-03 10:03:04 编辑过。如有问题,请报告版主或论坛管理删除.
回答: 回复:answeryma162003-07-02 22:01:00
Another pair is 16,73. The hard question is: Are there infinitely many such pairs? Since we know little about prime numbers, we cannot answer this question. Look at this set:

S={n-2^i|n is odd, i=1,2,3...}

what we need for S is that S contains a unique prime which has i>1. S may have many primes (e.g. n=11) or may not have any prime (can you find an example?).

If we can find such S, then, the prime number in S, let call it n-2^m and 2^m is a solution.



请您先登陆,再发跟帖!

发现Adblock插件

如要继续浏览
请支持本站 请务必在本站关闭/移除任何Adblock

关闭Adblock后 请点击

请参考如何关闭Adblock/Adblock plus

安装Adblock plus用户请点击浏览器图标
选择“Disable on www.wenxuecity.com”

安装Adblock用户请点击图标
选择“don't run on pages on this domain”