mersenneforum.org Octoproths
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

2005-04-20, 16:48   #89
smh

"Sander"
Oct 2002
52.345322,5.52471

29·41 Posts

Quote:
 Originally Posted by R.D. Silverman May I ask: With so many other established computational projects already available, why do this one?
This one is as good as any other.

But i choose this one because i can't use that pc for anything else (except maybe ecm) and it's only available to me for a few days. PRP-ing takes only 15 minutes on my P4. The pc will be gone tomorrow morning and i didn't want to let it run idle.

For the last year or two, i spent most of my cpu time factoring for a few projects (including Paul's). Unfortunately, Cunningham numbers are a bit to hard for my limited resources. I might be able to do a < c140 with GNFS, but my P4 has only 256MB RAM. I have a laptop with 2GB, but that one is used for work, and part of that memory is often needed. Besides, i'm not sure GGNFS is upto the job yet. Sieving on multiple pc's requires to much book keeping for the time i've currentely got.

I'm open for any number you want to have factored, as long as it can be done in a reasonable amount of time.

 2005-04-20, 16:53 #90 smh     "Sander" Oct 2002 52.345322,5.52471 22458 Posts N=157 Below the results for N=157 and K<2*10^13 All are prp, not tested for primality Code: 541364899635*2^157+1 541364899635*2^157-1 541364899635*2^(157+1)+1 541364899635*2^(157+1)-1 2^157+541364899635 2^157-541364899635 2^(157+1)+541364899635 2^(157+1)-541364899635 5375998941495*2^157+1 5375998941495*2^157-1 5375998941495*2^(157+1)+1 5375998941495*2^(157+1)-1 2^157+5375998941495 2^157-5375998941495 2^(157+1)+5375998941495 2^(157+1)-5375998941495 7137839620995*2^157+1 7137839620995*2^157-1 7137839620995*2^(157+1)+1 7137839620995*2^(157+1)-1 2^157+7137839620995 2^157-7137839620995 2^(157+1)+7137839620995 2^(157+1)-7137839620995 16986089468655*2^157+1 16986089468655*2^157-1 16986089468655*2^(157+1)+1 16986089468655*2^(157+1)-1 2^157+16986089468655 2^157-16986089468655 2^(157+1)+16986089468655 2^(157+1)-16986089468655
2005-04-20, 17:17   #91
TTn

4218 Posts
Silverman

Quote:
 May I ask: With so many other established computational projects already available, why do this one? I accuse noone. However, I suspect that the answer is: "Because this project is new, it is relatively easy to get results". Let me quote John Kennedy: "We choose to go to the moon and do the other thing... Not because they are easy, but because they are hard." There is little reward in using other people's software to do easy computations. Rewards come from succeeding at something that is hard. The satisfaction one derives from solving a problem is commensurate with the level of effort.
I would appreciate if you respectfully ask questions elsewhere. (buzz off)
This project has been around for awhile, and now has a new spin on the fundamental property that started it.

 2005-04-20, 22:32 #92 robert44444uk     Jun 2003 Suva, Fiji 23·3·5·17 Posts Angels We would still be computing the number of angels on the head of a pin unless we had adapted and explored. The facts are: This is original thinking, adaptation and exploration in virgin territory It is simple, but not so simple, there are pitfalls for the unwary There is interesting mathematics if anyone wants to look at it Axn1's program is a masterpiece This is true 1+1=3, as I like to define human co-operation This is the shitzit right now Mr Silverman, have pity on us poor humans, nattering together and taking up your valuable bandwidth. Consider yourself flamed, or at least singed, as I am a pacific sort. Regards Robert Smith (aged 53 1/4)
 2005-04-21, 03:15 #93 Dougy     Aug 2004 Melbourne, Australia 23×19 Posts What's in a name? Silverman? Hmmm... sounds familiar. Are you related to Joseph H. Silverman who published (among others) the paper "Wieferich's Criterion and the abc-Conjecture" in the Journal of Number Theory?
 2005-04-21, 05:14 #94 Dougy     Aug 2004 Melbourne, Australia 100110002 Posts Predicting the next octoproth. I've been looking at the "weights" of certain bases again. Working as I defined it previously, W(157) = 62. Is the heaviest W(n) for n <= 200. The next three heaviest are W(175) = 60 W(187) = 56 W(112) = 54 So the bases n = 112, 175, 187 should be good for finding octos.
 2005-04-21, 13:04 #95 Dougy     Aug 2004 Melbourne, Australia 23×19 Posts Update Newies: 4358737887315 87 (a monster!) 2232065722095 88 2148136610235 88 for n=89-96 there are no known octoproths. Searched n=89 to k=780321515295.
2005-04-22, 04:26   #96
TTn

13·467 Posts
bitwin

Quote:
 Okay, i have a few hours sieving time available
Is'nt it faster to verify bitwin primality first?
With RMA 1.75 in 2 minutes I was able to find no octoproth's for n=5000, with k<200000000.

TTn

2005-04-22, 06:25   #97
smh

"Sander"
Oct 2002
52.345322,5.52471

118910 Posts

Quote:
 Originally Posted by TTn Is'nt it faster to verify bitwin primality first?
No, the remaining 4 possibilities often have small factors.

Quote:
 Originally Posted by TTn With RMA 1.75 in 2 minutes I was able to find no octoproth's for n=5000, with k<200000000.
With octo_fast it took less then 1 second to 'sieve' this range, with only 4 possible candidates left.

Code:
1297905 5000
111183135 5000
116381265 5000
176976555 5000

Last fiddled with by smh on 2005-04-22 at 06:26

2005-04-22, 06:49   #98
TTn

2·1,453 Posts

Quote:
 No, the remaining 4 possibilities often have small factors.
Right on, I will include this in my script.

Although not all those look like the same candidates I came up with.
hmmm... Ill double check.

 2005-04-22, 15:35 #99 TTn   100010001011112 Posts double check Ah, newpgen has caused some errors due to the large file size. Or machine/Os cannot handle correctly. I am surprised that you are getting so much speed without errors. If this is true, then congradulations! I will tri-check thouroughly, with a belts and braces technique. TTn

 Thread Tools

 Similar Threads Thread Thread Starter Forum Replies Last Post ValerieVonck Octoproth Search 100 2007-02-16 23:43 ValerieVonck Octoproth Search 0 2007-02-14 07:24 Greenbank Octoproth Search 15 2006-01-20 16:29 jasong Software 1 2005-05-10 20:08

All times are UTC. The time now is 13:40.

Sun Feb 5 13:40:18 UTC 2023 up 171 days, 11:08, 1 user, load averages: 1.01, 0.76, 0.75

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2023, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔