A Sierpinski/Riesel-like problem

[Batalov]

This is getting silly! (Cue Monty Python Lieutenant).

Get yourself a web site not dissimilar to "norpimeslefbehind" and do this trivially-small-but changing-every-day maintenance there! Yourself.

Can you understand that you are using this forum as a "Write-only memory" device?! You write whatever you want, tomorrow you rewrite everything ...and nobody reads what you wrote. But the disk usage is enormous.

It makes a thinking person feel the so-called Spanish shame, watching your threads.

[Uncwilly]

Originally Posted by Stargate38

@VBCurtis: You shouldn't be banning people for posting stuff in their blog.

The blogs are an experiment and subject to discontinuation (at an individual level)
See Batalov's post on the issue. Sweety has been given several helpful suggestions on how to make his posts more useful. It being a blog area allows him to change his posts at any time. Thus on post can be kept up to date. Further pdf's can be produced and attached. Then as they are updated a new pdf can be generated and changed out for the previous one.

Also, please unban ONeil (I have no idea why he/she/they would still be banned, given what's in the last post) and Samuel immediately, and give the latter a blog of their own to post in.

ONeil said he would post a video to YouTube at the end of his LL run showing the results of it. He has failed to do so on any of his older YT channels or his current one. He has posted a video about something else more recently (so he is still 'active' on YT). Because he found out his claim was bogus, he chose not to post a video showing it. In not posting such a video, he made himself a liar. Given to opportunity to post about it, he did not acknowledge that he was wrong. Further, in very recent PM's to a mod, he did not acknowledge that he was wrong. Lying and not acknowledging the truth might work for some people in politics, but it won't fly here.

Samuel was abusive. Some of his insults were redacted/edited/removed or otherwise cleaned up. And without getting into details, his PM's to the mods made our job of banning him obvious.

There's also the possibility that Sweety439 might be special needs, and therefore might not be able to understand certain things.

Special needs or not, ignoring direct PM's from the moderators is an issue. Not replying to posts by the mods is an issue. Sweety was given a little time away and counseling, yet returned to the same behaviour upon his return.

[sweety439]

searched to n=2000, see the text file for the status, 0 if no (probable) prime found for this k

CK=235

k = 22, 127, 133, 184, 219 remain

[sweety439]

1,3
2,4
3,2
4,1
5,54
6,2
7,15
8,2
9,1
10,3
11,0
12,2

With CK=13

k = 11 remain at n=6000, see https://github.com/xayahrainie4793/S...esel%20k11.txt

[sweety439]

1,3251
2,1
3,1

With CK=4

k=1 prime given by generalized repunit prime search (cached copy)

Conjecture proven

[sweety439]

1,5
2,1
3,90
4,1
5,13
6,1
7,2
8,1
9,1
10,136
11,3048
12,1
13,1
14,7
15,8
16,17
17,1
18,10
19,2
20,1

With CK=21

k=11 prime found by the project for k<=12 and bases <= 1024

Conjecture proven

[sweety439]

1,3
2,6
3,2
4,9
5,4
6,1
7,1
8,2
9,1
10,1
11,2
12,1
13,1
14,2
15,2
16,1
17,4
18,1
19,1
20,6
21,1
22,19
23,2
24,2
25,9
26,20
27,1
28,3
29,12
30,1
31,1
32,12
33,1
34,79
35,6
36,1
37,3
38,2
39,1
40,1
41,2
42,5
43,7
44,4
45,1
46,1
47,2
48,1
49,1
50,12
51,1
52,1
53,16
54,5
55,1
56,4
57,1

With CK=58

Conjecture proven

[sweety439]

searched to n=2000, see the text file for the status, 0 if no (probable) prime found for this k

CK=209

All k where k = m^2 and m = = 7 or 9 mod 16:
for even n let k = m^2 and let n = 2*q; factors to:
(m*177^q - 1) * (m*177^q + 1)
odd n:
factor of 2

This includes k = 49, 81

k = 36, 64 primes given by CRUS

k = 25, 161, 193, 197 remain at n=2000

[sweety439]

1,2
2,2
3,14
4,0
5,2
6,118
7,4
8,1
9,1
10,1
11,177
12,2
13,8
14,44
15,3
16,3
17,12
18,1
19,0
20,1
21,89

With CK=22

k = 4, 19 remain at n=2000

[sweety439]

1,19
2,2
3,16

With CK=4

Conjecture proven

[sweety439]

CK = 7674582 is too large, thus not run this base

(Condition 1):

All k where k = m^2 and m = = 19 or 162 mod 181:
for even n let k = m^2 and let n = 2*q; factors to:
(m*180^q - 1) * (m*180^q + 1)
odd n:
factor of 181

(Condition 2):

All k where k = 5*m^2 and m = = 67 or 114 mod 181:
even n:
factor of 181
for odd n let k = 5*m^2 and let n=2*q-1; factors to:
[m*6^(2*q-1)*5^q - 1] * [m*6^(2*q-1)*5^q + 1]