mersenneforum.org Sierpinski / Riesel - Base 22
 User Name Remember Me? Password
 Register FAQ Search Today's Posts Mark Forums Read

2007-11-25, 10:01   #34
michaf

Jan 2005

479 Posts

You can take them,

I cannot get to the computer I tested them on right now, but my guess is that I updated the web-page when I stopped searching.
Good luck!

and @Gary:
apologies accepted, I think the comments were made with the best intentions :)

As for including or not: You might want to just a side-note telling the story, it'll be clear to everyone then.

Quote:
 Originally Posted by Siemelink Michaf, are you still working on this numbers? If not, do you mind if I take over? In the thread there is a post stating that you tested all until n = 18000. How far did you get? Willem.

Last fiddled with by michaf on 2007-11-25 at 10:04

2007-11-26, 05:21   #35
gd_barnes

"Gary"
May 2007
Overland Park, KS

22·13·227 Posts

Quote:
 Originally Posted by michaf and @Gary: apologies accepted, I think the comments were made with the best intentions :) As for including or not: You might want to just a side-note telling the story, it'll be clear to everyone then.
OK, thanks for the input, Michaf. In a list of remaining k's to find prime for each base, if there are "exception-situation" k's like this, I will show those with an asterisk by them -or- may not show them but instead put a special note at the bottom of the page about them.

As I get into creating the page, I'll ask people's input about what they think looks the best.

Gary

 2007-12-05, 20:16 #36 Siemelink     Jan 2006 Hungary 26810 Posts Found some. Aloha everyone. I have some results: 5659*22^97758+1 is probable prime 6462*22^45507+1 is probable prime 1013*22^26067-1 is probable prime 2853*22^27975-1 is probable prime 4001*22^36614-1 is probable prime Having fun, Willem. -- Sierpinski / Riesel - Base 22 Conjectured Sierpinski at 6694 [5,23,97] Conjectured Riesel at Riesel 4461 [5,23,97] Sierpinski 22 (cedricvonck) 484 (cedricvonck) 1611 (Willem tested upto 98000) 1908 (Willem tested upto 60000) 4233 (Willem tested upto 30000) 5128 (Willem tested upto 30000) Riesel 3104 (willem tested upto 60000) 3656 (willem tested upto 60000)
2007-12-06, 03:00   #37
gd_barnes

"Gary"
May 2007
Overland Park, KS

22×13×227 Posts

Quote:
 Originally Posted by Siemelink Aloha everyone. I have some results: 5659*22^97758+1 is probable prime 6462*22^45507+1 is probable prime 1013*22^26067-1 is probable prime 2853*22^27975-1 is probable prime 4001*22^36614-1 is probable prime Having fun, Willem. -- Sierpinski / Riesel - Base 22 Conjectured Sierpinski at 6694 [5,23,97] Conjectured Riesel at Riesel 4461 [5,23,97] Sierpinski 22 (cedricvonck) 484 (cedricvonck) 1611 (Willem tested upto 98000) 1908 (Willem tested upto 60000) 4233 (Willem tested upto 30000) 5128 (Willem tested upto 30000) Riesel 3104 (willem tested upto 60000) 3656 (willem tested upto 60000)

Great work, Willem! And a top-5000 prime to boot! Keep us posted on your progress. I'm accumulating all of the info. for bases <=32 into a master spreadsheet that I am using to slowly create some web pages.

Question...were you able to prove the primes? Although it's slow, I use Proth.

Thanks,
Gary

 2007-12-06, 20:34 #38 Siemelink     Jan 2006 Hungary 22·67 Posts Aah, proving prime with some other program. I didn't think so far ahead yet. Ok, I have proth running now. Thanks for the tip, laters, Willem.
 2007-12-06, 21:52 #39 rogue     "Mark" Apr 2003 Between here and the 11011001100002 Posts You should be able to prove these prime with WinPFGW and it will be much faster than Proth. Use the -tp or -tm switch (depending upon -1 or +1, although I don't recall which switch is used with which sign). Combine it with -f0 and you should be all set.
2007-12-07, 00:37   #40
axn

Jun 2003

22·32·151 Posts

Quote:
 Originally Posted by rogue You should be able to prove these prime with WinPFGW and it will be much faster than Proth. Use the -tp or -tm switch (depending upon -1 or +1, although I don't recall which switch is used with which sign). Combine it with -f0 and you should be all set.
-tp means "Classic plus side test" = N+1 test = applicable for -1 numbers.
Vice versa for -tm

Quote:
 Originally Posted by pfgw documentation -t currently performs a deterministic test. By default this is an N-1 test, but N+1 testing may be selected with '-tp'. N-1 or N+1 is factored, and Pocklington's or Morrison's Theorem is applied. If 33% size of N prime factors are available, the Brillhart-Lehmer-Selfridge test is applied for conclusive proof of primality. If less than 33% is factored, this test provides 'F-strong' probable primality with respect to the factored part F.

Last fiddled with by axn on 2007-12-07 at 00:39 Reason: Added documentation excerpt

2007-12-07, 00:52   #41
geoff

Mar 2003
New Zealand

13×89 Posts

Quote:
Originally Posted by gd_barnes
Masser, I checked out the thread that you posted here. It is a good one but I guess I am a little bit confused now. In the post, doesn't Geoff state the following?:

Quote:
 Originally Posted by geoff 2. k > 0 is a base 5 Sierpinski number if k*5^n+1 is not prime for any integer n >= 0. ... 3. k > 0 is a base 5 Sierpinski number if k*5^n+1 is not prime for any integer n. ... For the purposes of this project it makes no difference whether we use definition 2 or definition 3.
I can only speculate and maybe you can confirm that we want to use the above base 5 defintion for all bases. Is that your thinking? If so, here is where I'm confused:
The conclusion above was based on the particular properties of the base 5 sequences (i.e. the primes that had been discovered so far), it does not a priori apply to other bases.

edit: The quote above has been edited, see the original post.

Last fiddled with by geoff on 2007-12-07 at 00:55

2007-12-07, 07:52   #42
gd_barnes

"Gary"
May 2007
Overland Park, KS

22×13×227 Posts

Quote:
 Originally Posted by geoff The conclusion above was based on the particular properties of the base 5 sequences (i.e. the primes that had been discovered so far), it does not a priori apply to other bases. edit: The quote above has been edited, see the original post.

Thanks for responding and clarifying Geoff. I'm wondering what properties those were for base 5 and would they apply to at least 'some' other bases such as base 22?

Gary

Last fiddled with by gd_barnes on 2007-12-07 at 07:56

2007-12-07, 07:55   #43
gd_barnes

"Gary"
May 2007
Overland Park, KS

101110000111002 Posts

Quote:
 Originally Posted by rogue You should be able to prove these prime with WinPFGW and it will be much faster than Proth. Use the -tp or -tm switch (depending upon -1 or +1, although I don't recall which switch is used with which sign). Combine it with -f0 and you should be all set.

Very good. I should have known as much since I've been using PFGW extensively for these conjecture searches but didn't look into all of its options. Thanks for the heads up.

Gary

 2007-12-07, 13:24 #44 kar_bon     Mar 2006 Germany 2,999 Posts something like this: call: pfgw -tc -q"1468*11^26258+1" output: PFGW Version 20031222.Win_Dev (Beta 'caveat utilitor') [FFT v22.13 w/P4] Primality testing 1468*11^26258+1 [N-1/N+1, Brillhart-Lehmer-Selfridge] Running N-1 test using base 2 Running N-1 test using base 3 Running N+1 test using discriminant 23, base 1+sqrt(23) Calling N-1 BLS with factored part 100.00% and helper 0.02% (300.02% proof) 1468*11^26258+1 is prime! (813.9536s+0.1133s) karsten

 Similar Threads Thread Thread Starter Forum Replies Last Post sweety439 Conjectures 'R Us 33 2022-07-19 15:03 Citrix Sierpinski/Riesel Base 5 16 2017-02-09 15:55 robert44444uk Sierpinski/Riesel Base 5 358 2008-12-08 16:28 rogue Conjectures 'R Us 11 2007-12-17 05:08 michaf Conjectures 'R Us 2 2007-12-17 05:04

All times are UTC. The time now is 15:04.

Sun Jan 29 15:04:37 UTC 2023 up 164 days, 12:33, 0 users, load averages: 1.09, 1.14, 1.00

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.

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