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

 2007-01-19, 19:06 #12 michaf     Jan 2005 479 Posts small succes: 91268055041 | 22^134217728+1 So at least THAT one isn't prime :)
2007-01-20, 00:43   #13
fatphil

May 2003

FF16 Posts

Quote:
 Originally Posted by michaf small succes: 91268055041 | 22^134217728+1 So at least THAT one isn't prime :)
That's about one millionth of a second's work. Why is it considered a success?

2007-01-20, 03:23   #14
jasong

"Jason Goatcher"
Mar 2005

3·7·167 Posts

Quote:
 Originally Posted by fatphil That's about one millionth of a second's work. Why is it considered a success?
He's probably thinking of how long it would take to test the number for primality if it hadn't been sieved.

2007-01-20, 08:03   #15
michaf

Jan 2005

1110111112 Posts

Quote:
 Originally Posted by jasong He's probably thinking of how long it would take to test the number for primality if it hadn't been sieved.
That was indeed what I was thinking :)
_and_ it took some 24 hours to get to that sieving point :>

2007-01-20, 08:20   #16
Citrix

Jun 2003

3·5·107 Posts

Quote:
 Originally Posted by michaf That was indeed what I was thinking :) _and_ it took some 24 hours to get to that sieving point :>
Should have taken you less than a sec!

Anyway why are you trying to factorize these numbers
For base 22, numbers that are multiple of 22 do not have to be tested, this eliminates k=22,484 but k=1 is left. But 1*22^1+1 is prime hence 1 is eliminated.

under base=100 only the following bases are left for which k does not produce a prime
38
50
62
68
86
92
98
You can try to find a prime for them

Last fiddled with by Citrix on 2007-01-20 at 08:45

2007-01-20, 18:29   #17
michaf

Jan 2005

7378 Posts

Quote:
 Originally Posted by michaf View Post Without any math skills... so excuse me if I bugger here :> base 22: 22*22^n + 1 = 22^(n+1) + 1 = 1*22^(n+1) + 1 so, k = 1 and that one is eliminated, therefore is k=22 and 484?
Quote:
 Unfortunately not. 1*22^1+1=23 prime, but, I think we decided for the Sierpinski base 5 exercise, that we would not use n=0, otherwise k=22 could be eliminated but not 484.
(quotes from sierpinski 6-18 thread)
I think this justifies the search

2007-01-20, 23:24   #18
michaf

Jan 2005

1DF16 Posts

Quote:
 Originally Posted by Citrix Should have taken you less than a sec!
Oh, how do you do that? Test for all factors upto that limit in a sec? :)
Or did you mean just testing if that one number divided the huge number?

2007-01-21, 02:34   #19
Citrix

Jun 2003

3·5·107 Posts

Quote:
 Originally Posted by michaf Oh, how do you do that? Test for all factors upto that limit in a sec? :) Or did you mean just testing if that one number divided the huge number?
Finding the factor should take less than 1 sec. Try to factor 1 number at a time. What numbers are left, I can try to prove them composite them for you.

 2007-01-21, 09:58 #20 michaf     Jan 2005 479 Posts Hmm... what am I doing wrong then? srsieve is sieving about 20-30Million p's per second, but not a huge amount more when sieving only 1 n. Or is srsieve the wrong program here?
2007-01-21, 11:11   #21
Citrix

Jun 2003

160510 Posts

Quote:
 Originally Posted by michaf Hmm... what am I doing wrong then? srsieve is sieving about 20-30Million p's per second, but not a huge amount more when sieving only 1 n. Or is srsieve the wrong program here?
Try PFGW.

2007-01-21, 12:54   #22
michaf

Jan 2005

479 Posts

Quote:
 Originally Posted by Citrix Try PFGW.
I couldn't notice anything quicker about pfgw's factoring routines then there is in srsieve (quite the opposite, actually).

What's pfgw's command to find "91268055041 | 22^134217728+1" quickly?

 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 16:27.

Sun Jan 29 16:27:59 UTC 2023 up 164 days, 13:56, 0 users, load averages: 0.90, 0.85, 0.86

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.

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