Expand Messages
• Hi Cletus, I don t consider 3499...99 is near-repdigit because Chris K. Caldwell s Top Twenty page (http://primes.utm.edu/top20/page.php?id=15) says Let all
Message 1 of 5 , Jan 13, 2005
• 0 Attachment
Hi Cletus,

I don't consider 3499...99 is near-repdigit because Chris K.
Caldwell's Top Twenty page (http://primes.utm.edu/top20/page.php?id=15)
says "Let all but one of the digits be the same, these are the near
repdigit primes".

By the way, I had sieved many near-repdigit and quasi-repdigit
sequences by my own program, for our factorization tables
though the factor table of 35*10^n-1 is not opened yet, I had sieved
it too.

1:35*10^(6*k+4)-1 is divisible by 13
2:35*10^(16*k)-1 is divisible by 17
3:35*10^(18*k+4)-1 is divisible by 19
4:35*10^(22*k+8)-1 is divisible by 23
5:35*10^(28*k+18)-1 is divisible by 29
6:35*10^(15*k+3)-1 is divisible by 31
7:35*10^(21*k+15)-1 is divisible by 43
8:35*10^(46*k+37)-1 is divisible by 47
9:35*10^(58*k+38)-1 is divisible by 59
10:35*10^(60*k+23)-1 is divisible by 61
...snip...
1114:35*10^(5520*k+4029)-1 is divisible by 309121
1115:35*10^(4656*k+4080)-1 is divisible by 372481
1116:35*10^(4980*k+4082)-1 is divisible by 373501
1117:35*10^(4817*k+4148)-1 is divisible by 529871
1118:35*10^(9620*k+3979)-1 is divisible by 538721
1119:35*10^(8842*k+497)-1 is divisible by 565889
1120:35*10^(7891*k+1338)-1 is divisible by 694409
1121:35*10^(6868*k+2646)-1 is divisible by 721141
1122:35*10^(5863*k+761)-1 is divisible by 1008437
1123:35*10^(7599*k+2250)-1 is divisible by 1124653

general term: 35*10^n-1
upper limit of periods: 10000
upper limit of periodical factors: 4294967296
checked terms: 100000000
terms divided by periodical factors: 70915377
room for prime numbers: 29.08%

Cheers,
Makoto

On Thu, 13 Jan 2005 06:49:26 -0800 (PST), Cletus Emmanuel wrote:
>
>Hi all,
>What can I use to sieve for N=35*10^k - 1? And, would this form be considered near-repunit? I did
>not see this form in Multisieve, but I suspect that the form C*b^k - 1, where C and b are constants
>and k a variable is being sieved. Let me know where I can such a program. If none exist, Mark R.,
>can you customize Multisieve to do that?
>
>
>--Cletus
>
>
>---------------------------------
>Do you Yahoo!?
> Yahoo! Mail - You care about security. So do we.
>
>[Non-text portions of this message have been removed]
>
>
>
>
>Unsubscribe by an email to: primenumbers-unsubscribe@yahoogroups.com
>The Prime Pages : http://www.primepages.org/
>
>
>
>
>
>

--
• ... Use NewPGen. --Mark
Message 2 of 5 , Jan 13, 2005
• 0 Attachment
> Hi all,
> What can I use to sieve for N=35*10^k - 1? And, would this form
> be considered near-repunit? I did not see this form in
> Multisieve, but I suspect that the form C*b^k - 1, where C and b
> are constants and k a variable is being sieved. Let me know where
> I can such a program. If none exist, Mark R., can you customize
> Multisieve to do that?

Use NewPGen.

--Mark
• Thanks guys, I downloaded the siever and have started using it. Now, would Proth.exe be better PrPing or should I used PFGW? ... Use NewPGen. --Mark
Message 3 of 5 , Jan 14, 2005
• 0 Attachment
Thanks guys,
I downloaded the siever and have started using it. Now, would Proth.exe be better PrPing or should I used PFGW?

---Cletus

mgrogue@... wrote:
> Hi all,
> What can I use to sieve for N=35*10^k - 1? And, would this form
> be considered near-repunit? I did not see this form in
> Multisieve, but I suspect that the form C*b^k - 1, where C and b
> are constants and k a variable is being sieved. Let me know where
> I can such a program. If none exist, Mark R., can you customize
> Multisieve to do that?

Use NewPGen.

--Mark

Unsubscribe by an email to: primenumbers-unsubscribe@yahoogroups.com
The Prime Pages : http://www.primepages.org/

---------------------------------

To visit your group on the web, go to:

To unsubscribe from this group, send an email to:

---------------------------------
Do you Yahoo!?
All your favorites on one personal page � Try My Yahoo!

[Non-text portions of this message have been removed]
• ... Proth.exe be better PrPing or should I used PFGW? Definitely PFGW or LLR (LLR might be faster). Proth is best for GFNs. --Mark
Message 4 of 5 , Jan 14, 2005
• 0 Attachment
--- In primenumbers@yahoogroups.com, Cletus Emmanuel <cemmanu@y...> wrote:
> Thanks guys,
> I downloaded the siever and have started using it. Now, would
Proth.exe be better PrPing or should I used PFGW?

Definitely PFGW or LLR (LLR might be faster). Proth is best for GFNs.

--Mark
Your message has been successfully submitted and would be delivered to recipients shortly.