![]() |
![]() |
#529 | |
Random Account
Aug 2009
Not U. + S.A.
47378 Posts |
![]() Quote:
Many thanks. ![]() |
|
![]() |
![]() |
![]() |
#530 | |
Random Account
Aug 2009
Not U. + S.A.
7×192 Posts |
![]()
I cannot find any references to what needs to be ran, so I will just run the below using pgfw as something to do:
Quote:
|
|
![]() |
![]() |
![]() |
#531 | |
"99(4^34019)99 palind"
Nov 2016
(P^81993)SZ base 36
2·7·263 Posts |
![]() Quote:
Code:
ABC2 ($a^$b-1)/($a-1) ABC2 ($a^$b+1)/($a+1) a: from 2 to 2048 b: primes from 3 to 1000000 |
|
![]() |
![]() |
![]() |
#532 |
"Mark"
Apr 2003
Between here and the
696210 Posts |
![]() |
![]() |
![]() |
![]() |
#533 |
"Mark"
Apr 2003
Between here and the
2×592 Posts |
![]()
Why are you asking someone else to do something that you can do easily?
|
![]() |
![]() |
![]() |
#534 | |
Random Account
Aug 2009
Not U. + S.A.
7×192 Posts |
![]()
mtsieve is an archive with 27 binaries inside. There must be an error here somewhere.
Quote:
|
|
![]() |
![]() |
![]() |
#535 | |
Random Account
Aug 2009
Not U. + S.A.
7×192 Posts |
![]() Quote:
Code:
ABC2 ($a^$b-1)/($a-1) ABC2 ($a^$b+1)/($a+1) a: from 2 to 2048 b: primes from 3 to 1000000 All I wanted to do is participate, even at a low level. All this would be much easier if individuals would be more forthcoming and not act as a tight little circle where no one can enter. e.g. "The good ole boys club." A person is in or on the far side of the moon. |
|
![]() |
![]() |
![]() |
#536 | |
"Curtis"
Feb 2005
Riverside, CA
3×1,877 Posts |
![]() Quote:
As for the "good ole boys club", have you considered reading the first page of posts in threads where you don't know what is going on? Most of the questions you've asked recently were things I didn't know either (particularly about this project), but I can read old posts and locate links to sites that track the work and then I know what's going on. You could do the same. When I've found a new project of interest around here, I'll spend a couple hours reading the old posts about the project. The info is there, you just have to read it. |
|
![]() |
![]() |
![]() |
#537 | |
Bamboozled!
"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across
1165410 Posts |
![]() Quote:
How are you getting on with the agreement we came to? You do ECM work for me under Windows in return for me working on you primality proving. Reason I ask is that I have not yet seen any connections from you to my ECMNET server. |
|
![]() |
![]() |
![]() |
#538 | ||
Random Account
Aug 2009
Not U. + S.A.
7×192 Posts |
![]() Quote:
Quote:
Last fiddled with by storm5510 on 2022-07-01 at 14:06 Reason: Correction |
||
![]() |
![]() |
![]() |
#539 |
"Mark"
Apr 2003
Between here and the
2×592 Posts |
![]()
The mtsieve README.txt points to http://www.mersenneforum.org/rogue/mtsieve.html, which I admit is a little out of date. None of the programs sieve that specific form.
Last fiddled with by rogue on 2022-07-01 at 14:35 |
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Distribution of Mersenne primes before and after couples of primes found | emily | Math | 35 | 2022-12-21 16:32 |
Mersenne Primes p which are in a set of twin primes is finite? | carpetpool | Miscellaneous Math | 4 | 2022-07-14 02:29 |
Leyland Primes: ECPP proofs | Batalov | XYYXF Project | 57 | 2022-06-30 17:24 |
On Leyland Primes | davar55 | Puzzles | 9 | 2016-03-15 20:55 |
possible primes (real primes & poss.prime products) | troels munkner | Miscellaneous Math | 4 | 2006-06-02 08:35 |