给出一组哥猜真值，仅供参考！

愚工688 · 发表于 2022-9-17 18:49

本帖最后由愚工688 于 2022-9-18 00:30 编辑

1000000364:65:2

G(1000000364) = 1913317
G(1000000366) = 1704613
G(1000000368) = 3424584
G(1000000370) = 2270076
G(1000000372) = 2044767
……
G(1000000482) = 3799272
G(1000000484) = 2049718
G(1000000486) = 1927670
G(1000000488) = 3410612
G(1000000490) = 2270902
G(1000000492) = 1702980

count = 65, algorithm = 2, working threads = 2, time use 0.276 sec

时空的素对数据是正确的，用时2个半小时多。我使用网友赠予的C++编写的筛选软件仅仅用了0.276秒。所以说具有高速筛选素对的软件是非常重要的。

筛选素对真值的软件，没有误差。

愚工688 · 发表于 2022-9-17 19:26

本帖最后由愚工688 于 2022-9-18 00:38 编辑

我用黄博士赠予的软件筛选2022091610起的100个偶数的素对数量不到一秒。
2022091610:100:2

G(2022091610) = 5742191
G(2022091612) = 3212371
G(2022091614) = 6422992
G(2022091616) = 3273906
G(2022091618) = 3216283
G(2022091620) = 8563708
G(2022091622) = 3620247
G(2022091624) = 3911424
G(2022091626) = 6421880
G(2022091628) = 3300786
G(2022091630) = 4670936
G(2022091632) = 7148496
G(2022091634) = 3234266
G(2022091636) = 3218330
G(2022091638) = 7710439
G(2022091640) = 4279822
G(2022091642) = 3342436
G(2022091644) = 7228009
G(2022091646) = 3221898
G(2022091648) = 3212005
G(2022091650) = 8668205
G(2022091652) = 3858916
G(2022091654) = 3574859
G(2022091656) = 7474202
G(2022091658) = 3233721
G(2022091660) = 4357176
G(2022091662) = 6604607
G(2022091664) = 3220390
G(2022091666) = 3855713
G(2022091668) = 6437219
G(2022091670) = 4281328
G(2022091672) = 3211422
G(2022091674) = 6482449
G(2022091676) = 3574705
G(2022091678) = 3256154
G(2022091680) = 10274192
G(2022091682) = 3748424
G(2022091684) = 3461608
G(2022091686) = 6422784
G(2022091688) = 3212759
G(2022091690) = 4802182
G(2022091692) = 6424253
G(2022091694) = 3854913
G(2022091696) = 3216300
G(2022091698) = 7136745
G(2022091700) = 4482650
G(2022091702) = 3225923
G(2022091704) = 6419585
G(2022091706) = 3215623
G(2022091708) = 4202702
G(2022091710) = 8893602
G(2022091712) = 3218684
G(2022091714) = 3236162
G(2022091716) = 6578913
G(2022091718) = 3212769
G(2022091720) = 5038338
G(2022091722) = 7855507
G(2022091724) = 3425260
G(2022091726) = 3223103
G(2022091728) = 6422975
G(2022091730) = 4288211
G(2022091732) = 3211261
G(2022091734) = 7004686
G(2022091736) = 4194340
G(2022091738) = 3214088
G(2022091740) = 8561289
G(2022091742) = 3615072
G(2022091744) = 3212374
G(2022091746) = 6649717
G(2022091748) = 3262068
G(2022091750) = 5147744
G(2022091752) = 6421955
G(2022091754) = 3211597
G(2022091756) = 3212033
G(2022091758) = 7683543
G(2022091760) = 4671250
G(2022091762) = 3219109
G(2022091764) = 8561852
G(2022091766) = 3213561
G(2022091768) = 3212666
G(2022091770) = 8772097
G(2022091772) = 3209840
G(2022091774) = 3210756
G(2022091776) = 6422748
G(2022091778) = 4009077
G(2022091780) = 4283555
G(2022091782) = 6728519
G(2022091784) = 3210887
G(2022091786) = 3948282
G(2022091788) = 6457202
G(2022091790) = 4281456
G(2022091792) = 4216294
G(2022091794) = 6434941
G(2022091796) = 3400018
G(2022091798) = 3212572
G(2022091800) = 8562380
G(2022091802) = 3215561
G(2022091804) = 3210343
G(2022091806) = 7870615
G(2022091808) = 3689497

count = 100, algorithm = 2, working threads = 2, time use 0.643 sec

我用自己编写的Basic 程序筛选素对对于一千万不到的一个偶数也需要20多分钟，所以现在我自己编写的软件只用来计算，筛选素对真值就使用黄博士赠予的软件，相对误差就手工计算了。
对于几万的连续偶数，我自编的QBasic 程序可以直接完成素对数量，计算值，相对误差，区域内偶数相对误差的统计等等功能，还是很有用的。
没有掌握高级的编程方法只能这样了。

愚工688 · 发表于 2022-9-17 20:02

本帖最后由愚工688 于 2022-9-17 12:04 编辑

素对计算式：Xi(M)=t2*c1*M/(logM)^2  ；
  式中：t2=1.358-(log(M))^(.5)*0.05484； c1:只计算√M内素数的类似拉曼扭杨系数。

  G(2022091610) = 5742191  ;Xi(M)≈ 5743926.99 δxi(M)≈? 0.0003023；
  G(2022091612) = 3212371  ;Xi(M)≈ 3210815.38 δxi(M)≈?-0.0004844；
  G(2022091614) = 6422992  ;Xi(M)≈ 6421630.77 δxi(M)≈?-0.0002119；
  G(2022091616) = 3273906  ;Xi(M)≈ 3273772.63 δxi(M)≈?-0.0000406；
  G(2022091618) = 3216283  ;Xi(M)≈ 3216706.65 δxi(M)≈? 0.0001317；
  G(2022091620) = 8563708  ;Xi(M)≈ 8562174.58 δxi(M)≈?-0.0001790；
  G(2022091622) = 3620247  ;Xi(M)≈ 3621790.16 δxi(M)≈? 0.0004261；
  G(2022091624) = 3911424  ;Xi(M)≈ 3912254.97 δxi(M)≈? 0.0002125；
  G(2022091626) = 6421880  ;Xi(M)≈ 6421630.81 δxi(M)≈?-0.0000388；
  G(2022091628) = 3300786  ;Xi(M)≈ 3301116.19 δxi(M)≈? 0.0001000；
  G(2022091630) = 4670936  ;Xi(M)≈ 4670276.99 δxi(M)≈?-0.0001411；
  G(2022091632) = 7148496  ;Xi(M)≈ 7150204.93 δxi(M)≈? 0.0002391；
  G(2022091634) = 3234266  ;Xi(M)≈ 3235705.58 δxi(M)≈? 0.0004452；

  time start =19:34:28, time end =19:35:13

我自编的计算软件的计算速度还是可以的，10几个偶数用时1分钟不到。用时比较多的是手工计算计算值的相对误差，不过不计时看不出来。

愚工688 · 发表于 2022-9-18 08:21

本帖最后由愚工688 于 2022-9-18 00:43 编辑

答：独木星空谁

黄博士的筛选素对软件是比较先进的，据讲是在他们这行内（可能是编程筛选素数、偶数的素对等领域）颇具有竞争力的。

我刚刚计时计算了一下：
10^10=18200488, 用时：0.82秒；
10^11=149091160；用时：8.63秒。

计算10^10起始的1000个偶数的素对，用时：11.910秒。

时空伴随者 · 发表于 2022-9-18 09:32

愚工688 发表于 2022-9-17 18:49
1000000364:65:2

G(1000000364) = 1913317

2022-09-17 19:33:30
G(1000000364) = 1913317 [2, 2, 11, 191, 257, 463]
G(1000000366) = 1704613 [2, 500000183]
G(1000000368) = 3424584 [2, 2, 2, 2, 3, 3, 197, 35251]
G(1000000370) = 2270076 [2, 5, 100000037]
G(1000000372) = 2044767 [2, 2, 7, 2347, 15217]
G(1000000374) = 3405467 [2, 3, 166666729]
G(1000000376) = 1710698 [2, 2, 2, 227, 550661]
G(1000000378) = 1867330 [2, 13, 13, 239, 12379]
G(1000000380) = 4545539 [2, 2, 3, 5, 1303, 12791]
G(1000000382) = 1703897 [2, 10711, 46681]
G(1000000384) = 1828147 [2, 2, 2, 2, 2, 2, 2, 17, 181, 2539]
G(1000000386) = 4592599 [2, 3, 3, 7, 11, 11, 107, 613]
G(1000000388) = 1821491 [2, 2, 29, 47, 149, 1231]
G(1000000390) = 2270835 [2, 5, 100000039]
G(1000000392) = 3407509 [2, 2, 2, 3, 41666683]
G(1000000394) = 1804040 [2, 23, 101, 215239]
G(1000000396) = 1736785 [2, 2, 53, 4716983]
G(1000000398) = 3405959 [2, 3, 11351, 14683]
G(1000000400) = 2886129 [2, 2, 2, 2, 5, 5, 7, 19, 18797]
G(1000000402) = 1704261 [2, 500000201]
G(1000000404) = 3718140 [2, 2, 3, 3, 3, 3, 3, 13, 79139]
G(1000000406) = 1760517 [2, 37, 229, 59011]
G(1000000408) = 1894493 [2, 2, 2, 11, 3371, 3371]
G(1000000410) = 4543191 [2, 3, 5, 33333347]
G(1000000412) = 1702565 [2, 2, 250000103]
G(1000000414) = 2096923 [2, 7, 41, 1742161]
G(1000000416) = 3408300 [2, 2, 2, 2, 2, 3, 10416671]
G(1000000418) = 1880167 [2, 17, 31, 948767]
G(1000000420) = 2272260 [2, 2, 5, 50000021]
G(1000000422) = 3408975 [2, 3, 3, 55555579]
G(1000000424) = 1703712 [2, 2, 2, 3637, 34369]
G(1000000426) = 1720977 [2, 103, 4854371]
G(1000000428) = 4145858 [2, 2, 3, 7, 7, 73, 23297]
G(1000000430) = 2761850 [2, 5, 11, 13, 569, 1229]
G(1000000432) = 1746638 [2, 2, 2, 2, 43, 1453489]
G(1000000434) = 3451104 [2, 3, 83, 2008033]
G(1000000436) = 1714963 [2, 2, 163, 1533743]
G(1000000438) = 1804267 [2, 19, 26315801]
G(1000000440) = 4896622 [2, 2, 2, 3, 3, 5, 23, 23, 59, 89]
G(1000000442) = 2043711 [2, 7, 71428603]
G(1000000444) = 1718986 [2, 2, 109, 2293579]
G(1000000446) = 3534002 [2, 3, 29, 5747129]
G(1000000448) = 1704154 [2, 2, 2, 2, 2, 2, 15625007]
G(1000000450) = 2309617 [2, 5, 5, 61, 327869]
G(1000000452) = 4036801 [2, 2, 3, 11, 17, 445633]
G(1000000454) = 1703454 [2, 500000227]
G(1000000456) = 2230080 [2, 2, 2, 7, 13, 1373627]
G(1000000458) = 3413396 [2, 3, 3, 3, 421, 43987]
G(1000000460) = 2310501 [2, 2, 5, 67, 661, 1129]
G(1000000462) = 1704142 [2, 500000231]
G(1000000464) = 3408041 [2, 2, 2, 2, 3, 20833343]
G(1000000466) = 1704163 [2, 500000233]
G(1000000468) = 1702664 [2, 2, 250000117]
G(1000000470) = 5475519 [2, 3, 5, 7, 277, 17191]
G(1000000472) = 1724125 [2, 2, 2, 139, 199, 4519]
G(1000000474) = 1893248 [2, 11, 45454567]
G(1000000476) = 3606369 [2, 2, 3, 3, 19, 1461989]
G(1000000478) = 1704890 [2, 10301, 48539]
G(1000000480) = 2417281 [2, 2, 2, 2, 2, 5, 31, 37, 5449]
G(1000000482) = 3799272 [2, 3, 13, 47, 272777]
G(1000000484) = 2049718 [2, 2, 7, 419, 85237]
G(1000000486) = 1927670 [2, 17, 23, 79, 16187]
G(1000000488) = 3410612 [2, 2, 2, 3, 1489, 27983]
G(1000000490) = 2270902 [2, 5, 100000049]
G(1000000492) = 1702980 [2, 2, 250000123]
用时 9312.970707416534 秒

liugongqin · 发表于 2022-9-18 12:16

回答错误0分。把简单的搞复杂了是浪费。

愚工688 · 发表于 2022-9-18 13:33

CPU为：AMD Athlon(tm) xp2000+、操作系统：Win-xp；时间：26分； 2005/11/07

All keys of dividing  9699690  into two prime numbers:
4849723 + 4849967  4849639 + 4850051  4849631 + 4850059  4849613 + 4850077  4849589 + 4850101  4849567 + 4850123  4849531 + 4850159  4849529 + 4850161  4849459 + 4850231  4849417 + 4850273  4849307 + 4850383  4849291 + 4850399  4849277 + 4850413  4849223 + 4850467  4849219 + 4850471  4849189 + 4850501  4849157 + 4850533  4849147 + 4850543  4849057 + 4850633  4849049 + 4850641  4849043 + 4850647  4849001 + 4850689  4848979 + 4850711  4848937 + 4850753  4848871 + 4850819  4848847 + 4850843  4848721 + 4850969  4848673 + 4851017  4848577 + 4851113  4848563 + 4851127  ……
…… 67 + 9699623  59 + 9699631  53 + 9699637  47 + 9699643  43 + 9699647  41 + 9699649  37 + 9699653  23 + 9699667
M= 9699690 S(m)= 124180  S1(m)= 124031  Sp(m)= 136157.51 δ(m)= .1 K(m)= 4.38  r= 3109

用Basic 语音编写的偶数素对筛选程序对几百万的偶数的素对的筛选就显得很困难了。

yangchuanju · 发表于 2022-9-18 14:16

研究哥猜，历来可分为两个课题：有没有、有多少。
愚公等人不但着重研究了有多少，现又在研究“是什么”（几加几）！

liugongqin · 发表于 2022-9-18 14:27

回答错误0分。把简单的搞复杂了是浪费。

yangchuanju · 发表于 2022-9-18 14:41

A116979
Number of distinct representations of primorials as the sum of two primes.
素数阶乘p#的素数对数
0, 0, 1, 3, 19, 114, 905, 9493, 124180, 2044847, 43755729, 1043468386, 30309948241

		自动登录	找回密码
密码			注册

给出一组哥猜真值，仅供参考！

点评

点评

点评

点评