mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 25 of 316
Search took 0.06 seconds.
Search: Posts Made By: carpetpool
Forum: Conjectures 'R Us 2020-10-12, 05:34
Replies: 852
Views: 70,610
Posted By carpetpool
Post S223 is complete to n=30k. Primes attached.

S223 is complete to n=30k. Primes attached.
Forum: FermatSearch 2020-10-05, 04:27
Replies: 318
Views: 40,791
Posted By carpetpool
Post Congrats on a World Record Fermat Divisor! ...

Congrats on a World Record Fermat Divisor!

:bounce wave:

PrimeGrid has held the record for many years up until now...

Way to go!
Forum: Software 2020-10-04, 22:39
Replies: 6
Views: 233
Posted By carpetpool
Post Thanks for the suggestions! I ran 4 subsequent...

Thanks for the suggestions! I ran 4 subsequent instances of LLR --- assigning affinity to CPUS 0, 2.

The time increased by about 0.120 ms which I guess makes sense given that more cores means...
Forum: Software 2020-10-03, 21:16
Replies: 6
Views: 233
Posted By carpetpool
Post LLR Affinity Problem

I know there's a way to run different LLR instances and have them assigned to different designated CPU, making it run significantly faster than if only one instance were used.

I am using a 4 core,...
Forum: GPU Computing 2020-10-02, 21:41
Replies: 1
Views: 207
Posted By carpetpool
Post LLR GPU application

Hi,


I'm wondering if the GPU LLR software found at Jean Penne's website (http://jpenne.free.fr/index2.html) is in progress or of any use.




I've installed CUDA Toolkit 11.1...
Forum: Miscellaneous Math 2020-09-20, 00:04
Replies: 106
Views: 9,937
Posted By carpetpool
Post The pseudoprimes associated with r=1 are just...

The pseudoprimes associated with r=1 are just those 2-SPRPs congruent to 3 mod 4. We need some way to avoid trivial cases. As you suggest, gcd(2^r-2,n)=1 is a good requirement. Whether my claim could...
Forum: Miscellaneous Math 2020-09-19, 08:35
Replies: 106
Views: 9,937
Posted By carpetpool
I retract my original claim (but perhaps...

I retract my original claim (but perhaps something better could be turned out of it). Here are some counterexamples I just found using specific parameters b = 2, r = 1, s = 2. Trivially,...
Forum: Miscellaneous Math 2020-09-17, 15:57
Replies: 56
Views: 2,325
Posted By carpetpool
Post We need an easy computational method to compute...

We need an easy computational method to compute b(u) (if deg(b(u)) = p, then forget it, it's practically impossible to compute ). Anyone?
Forum: Miscellaneous Math 2020-09-17, 15:28
Replies: 106
Views: 9,937
Posted By carpetpool
Post I think the 1-2^r test is better (a...

I think the 1-2^r test is better (a generalization to any arbitrary base b should hold). If there are two integers r, s, which pass this test, in particular we have (WLOG):

1 - b^r...
Forum: Miscellaneous Math 2020-09-17, 03:33
Replies: 56
Views: 2,325
Posted By carpetpool
Post I agree with CRGreathouse. Seems like a...

I agree with CRGreathouse. Seems like a pseudoprime (PRP) test. The test can be generalized to higher level matrices. With 2 x 2 matrix test:

For any integer n, if we have (gp):
...
Forum: Prime Wiki 2020-09-14, 04:19
Replies: 216
Sticky: Prime-Wiki
Views: 19,806
Posted By carpetpool
Post Williams Primes base 3

I created a page for 10*3^n+1 (https://www.rieselprime.de/ziki/Gen._Proth_prime_3_10) so that Williams PP9 (https://www.rieselprime.de/ziki/Williams_prime_PP_9) primes could be reused from there.
...
Forum: Lounge 2020-09-10, 17:27
Replies: 1,508
RIP
Views: 102,796
Posted By carpetpool
Post I'm really shook to see one of our own members on...

I'm really shook to see one of our own members on this forum pass away... :sad:

Everyone here is valuable even if we don't all know eachother.

RIP Ian
Forum: Conjectures 'R Us 2020-09-02, 19:22
Replies: 852
Views: 70,610
Posted By carpetpool
Post Yes, I plan to. There are 553 of them now, I'm...

Yes, I plan to. There are 553 of them now, I'm hoping to go as far as eliminating at least half of those.
Forum: Conjectures 'R Us 2020-09-02, 17:33
Replies: 852
Views: 70,610
Posted By carpetpool
Post Would like to please reserve S223. Not sure what...

Would like to please reserve S223. Not sure what range I want to complete yet. Will post .res files here since there are a lot of candidates to check.
Forum: Miscellaneous Math 2020-09-01, 03:16
Replies: 2
Views: 372
Posted By carpetpool
Post Claim: If 2^n-1 is not prime, then 2^(n-2)-1 is a...

Claim: If 2^n-1 is not prime, then 2^(n-2)-1 is a quadratic non-residue mod 2^n-1.

The claim is false, however the contrapositive is true:

If 2^n-1 is prime, then 2^(n-2)-1 is a quadratic...
Forum: Miscellaneous Math 2020-08-31, 23:01
Replies: 10
Views: 922
Posted By carpetpool
Post The thread discussion raises an interesting...

The thread discussion raises an interesting problem I had in mind:

For primes q and (odd) p

How does one find solutions to x^q = a mod p given that p = 1 mod q^2 provided the solutions exist...
Forum: carpetpool 2020-08-14, 04:08
Replies: 0
Views: 647
Posted By carpetpool
Post Eliptic curve J-variants

I am interesting in understanding the theoretical aspect of the ECPP test, and how everything works.



Looking at this...
Forum: Wagstaff PRP Search 2020-07-26, 13:08
Replies: 0
Views: 317
Posted By carpetpool
Post Wagstaff factors

Wagstaff factors currently aren't on the Top20's page and was thinking about asking Prof. Caldwell or one of his editors to consider making an archivable form (https://primes.utm.edu/top20/home.php)...
Forum: Lounge 2020-07-17, 17:05
Replies: 56
Views: 4,925
Posted By carpetpool
Post Not 25 yet, nor have I been involved in romantic...

Not 25 yet, nor have I been involved in romantic relationships just yet. Being a mostly math/computer science/tech forum (myself included), I figured I might ask to those of you who have:


How...
Forum: Riesel Prime Search 2020-07-13, 22:48
Replies: 212
Views: 27,050
Posted By carpetpool
Post Another lucky hit: 26*3^1700041+1 may be...

Another lucky hit:

26*3^1700041+1 may be prime, but N divides 3^((N-1)/3))-1, restarting with a=5 Time : 938.494 sec.
26*3^1700041+1 is prime! (811128 decimal digits) Time : 946.942 sec.
Forum: sweety439 2020-07-12, 18:55
Replies: 1,069
Views: 35,735
Posted By carpetpool
Post That is incorrect. What if we only know 12.5% of...

That is incorrect. What if we only know 12.5% of the factorization of n^2-1 (CHG proof), and thus, niether n+1, nor n-1 has to be trivially written as a product ? What if the factors found were...
Forum: Riesel Prime Search 2020-07-12, 05:22
Replies: 1,952
Views: 174,014
Posted By carpetpool
Post 273*2^2024810-1 is prime! (609531 decimal digits)...

273*2^2024810-1 is prime! (609531 decimal digits) Time : 1198.071 sec.
Forum: Miscellaneous Math 2020-07-08, 19:21
Replies: 14
Views: 975
Posted By carpetpool
Post Cunningham Chain of the second kind...

Cunningham Chain of the second kind (https://primes.utm.edu/glossary/page.php?sort=CunninghamChain)



OP is mentioning a special case of this (k=2, Fermat Primes), there are only finitely such...
Forum: Riesel Prime Search 2020-07-06, 03:34
Replies: 212
Views: 27,050
Posted By carpetpool
Post This has been my lucky weekend (just yesterday, I...

This has been my lucky weekend (just yesterday, I found a T5K prime for CRUS):

26*3^1435875+1 may be prime, but N divides 3^((N-1)/3))-1, restarting with a=5 Time : 1308.400 sec.
26*3^1435875+1...
Forum: Conjectures 'R Us 2020-07-04, 20:46
Replies: 870
Views: 70,134
Posted By carpetpool
Post R187 has 4 k's to go now: 2868*187^212559-1...

R187 has 4 k's to go now:

2868*187^212559-1 is prime! (482904 decimal digits, P = 3) Time : 5885.318 sec.
Showing results 1 to 25 of 316

 
All times are UTC. The time now is 11:51.

Sun Oct 25 11:51:26 UTC 2020 up 45 days, 9:02, 0 users, load averages: 1.19, 1.40, 1.47

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, 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.