数学中国

 找回密码
 注册
搜索
热搜: 活动 交友 discuz
查看: 6152|回复: 5

p1,p2是素数,p(n+2)是p(n+1)+p(n)+2000的最大素因子,试证{p(n)}有界

[复制链接]
发表于 2014-8-17 12:35 | 显示全部楼层 |阅读模式

本帖子中包含更多资源

您需要 登录 才可以下载或查看,没有帐号?注册

x
 楼主| 发表于 2014-8-17 12:43 | 显示全部楼层
推论,这个序列只含有限个素数,并且从某项开始具有周期性
 楼主| 发表于 2014-8-19 05:54 | 显示全部楼层

本帖子中包含更多资源

您需要 登录 才可以下载或查看,没有帐号?注册

x
 楼主| 发表于 2014-8-22 06:39 | 显示全部楼层
Python 程序:


  1. from math import *

  2. def maxPrimeFactor(n):
  3.    P = [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,\
  4.    73,79,83,89,97,101,103,107,109,113,127,131,137,139,149,151,157,\
  5.    163,167,173,179,181,191,193,197,199,211,223,227,229,233,239,241,\
  6.    251,257,263,269,271,277,281,283,293,307,311,313,317,331,337,347,\
  7.    349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,\
  8.    443,449,457,461,463,467,479,487,491,499,503,509,521,523,541]
  9.    p = 1
  10.    i = 0
  11.    d = P[0]
  12.    s = int(sqrt(n))
  13.    while n > 1:
  14.        if n % d == 0:
  15.            p = d
  16.            while n % d == 0:
  17.                n /= d
  18.            s = int(sqrt(n))
  19.        i = i + 1
  20. &#160; &#160; &#160; &#160;if i < 100: d = P[i]
  21. &#160; &#160; &#160; &#160;else: d = d + 2
  22. &#160; &#160; &#160; &#160;if d > s:
  23. &#160; &#160; &#160; &#160; &#160; &#160;if n > 1: p = n
  24. &#160; &#160; &#160; &#160; &#160; &#160;break
  25. &#160; &#160;return p

  26. def pPlusList(a,b,c=2000):
  27. &#160; &#160;L = [a,b]
  28. &#160; &#160;while True:
  29. &#160; &#160; &#160; &#160;d = maxPrimeFactor(a + b + c)
  30. &#160; &#160; &#160; &#160;e = maxPrimeFactor(b + c + d)
  31. &#160; &#160; &#160; &#160;m = len(L)
  32. &#160; &#160; &#160; &#160;i = 0
  33. &#160; &#160; &#160; &#160;while i < m:
  34. &#160; &#160; &#160; &#160; &#160; &#160;if L[i] == d:
  35. &#160; &#160; &#160; &#160; &#160; &#160;if i+1 < m and L[i+1] == e:
  36. &#160; &#160; &#160; &#160; &#160; &#160; &#160; &#160;L.append(d)
  37. &#160; &#160; &#160; &#160; &#160; &#160; &#160; &#160;L.append(e)
  38. &#160; &#160; &#160; &#160; &#160; &#160; &#160; &#160;return L,i
  39. &#160; &#160; &#160; &#160; &#160; &#160;i = i + 1
  40. &#160; &#160; &#160; &#160;L.append(d)
  41. &#160; &#160; &#160; &#160;L.append(e)
  42. &#160; &#160; &#160; &#160;a = d
  43. &#160; &#160; &#160; &#160;b = e
复制代码
 楼主| 发表于 2014-8-22 06:44 | 显示全部楼层

本帖子中包含更多资源

您需要 登录 才可以下载或查看,没有帐号?注册

x
 楼主| 发表于 2014-8-24 03:59 | 显示全部楼层
以任意自然数取代 2000, 首项及次项不必为素数,主贴的结论仍成立。
您需要登录后才可以回帖 登录 | 注册

本版积分规则

Archiver|手机版|小黑屋|数学中国 ( 京ICP备05040119号 )

GMT+8, 2026-1-14 16:37 , Processed in 0.123189 second(s), 16 queries .

Powered by Discuz! X3.4

Copyright © 2001-2020, Tencent Cloud.

快速回复 返回顶部 返回列表