Google Treasure Hunt 2008---Find the Smallest Prime Number

本文介绍了一个使用VB6编写的程序,该程序旨在找到一个最小的质数,它同时可以表示为不同数量连续质数之和,并且本身也是一个质数。通过筛选质数并计算连续质数之和的方式,最终找到了符合条件的最小质数。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Question:
Find the smallest number that can be expressed as
the sum of 3 consecutive prime numbers,
the sum of 11 consecutive prime numbers,
the sum of 25 consecutive prime numbers,
the sum of 171 consecutive prime numbers,
the sum of 1225 consecutive prime numbers,
and is itself a prime number.


For example, 41 is the smallest prime number that can be expressed as
the sum of 3 consecutive primes (11 + 13 + 17 = 41) and
the sum of 6 consecutive primes (2 + 3 + 5 + 7 + 11 + 13 = 41).

Your answer:

My solution with VB6

  1. Dima(100000000)AsByte,p(10000000)AsLong,numAsLong,nAsLong
  2. SubGetprimes()
  3. Dimi&,j&,k
  4. p(0)=2'The1stprime
  5. k=10000'sqrarerootof10^8
  6. n=100000000'10^8
  7. Fori=3TokStep2
  8. Ifa(i)=0Then
  9. num=num+1
  10. p(num)=i
  11. Forj=i*iTonStep2*i'Eractosthenes
  12. a(j)=100'Notprimenumber
  13. Next
  14. EndIf
  15. Next
  16. Fori=k+1TonStep2'Listallprimenumberstoarrayp()
  17. Ifa(i)=0Then
  18. num=num+1
  19. p(num)=i
  20. EndIf
  21. Next
  22. EndSub
  23. PrivateSubCommand1_Click()
  24. DimsAsString,tmAsSingle
  25. s=InputBox("Pleaseenternumbers:","Info","3,11,25,171,1225")'Inputallnumbersthequestionhaslisted
  26. tm=Timer
  27. Getprimes
  28. s=minprime(s)
  29. tm=Timer-tm
  30. Clipboard.Clear
  31. Clipboard.SetTextCStr(s)'CopytheanswertoClipboard
  32. MsgBox"Itcostmeabout"&Format(tm,"0.0000")&"secondstofindtheanswer:"&s&vbCrLf&"Andithasbeencopiedtotheclipboard"
  33. EndSub
  34. Functionminprime(myprimesAsString)AsLong
  35. Dimi&,j&,sum()AsLong,countAsLong,primedata
  36. primedata=Split(myprimes,",")
  37. count=UBound(primedata)
  38. ReDimsum(count)
  39. Fori=0Tocount
  40. Forj=1Toprimedata(i)'Smallsumofcontinuousprimenumbers
  41. sum(i)=sum(i)+p(j)
  42. Next
  43. Ifa(sum(i))<100Thena(sum(i))=a(sum(i))+1'Meetoneoftheconditions
  44. Forj=primedata(i)+1Tonum
  45. sum(i)=sum(i)+p(j)-p(j-primedata(i))
  46. Ifsum(i)>nThenExitFor
  47. Ifa(sum(i))<100Thena(sum(i))=a(sum(i))+1'Meetoneoftheconditions
  48. Ifa(sum(i))=count+1Thenminprime=sum(i):ExitFunction'Meetalloftheconditions,Ok
  49. Next
  50. Next
  51. EndFunction

It returns:

6954293

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值