possibly abandoned repdigit prime project

[jasong]

If you go here you will discover a project which, in a way, is similar to Riesel Sieve and Seventeen or Bust.

Simply put, you have a repeated digit k, that is anything other than 0, and you want to find a series of digits that you can put before or after(one or the other) the repeated digit that will make it so the resultant number is never prime. For instance, if you take the digits 891, no matter how many 7s you put after 891, the resulting integer will NEVER, EVER yield a prime. So, then, the goal would be to prove that 891 is the lowest number for which it is true that it never yields a prime when you have any number of 7s to the right of the number. Simple math tells us that there are 18 separate cases, in terms of the broadest description of the problem.

The website was dedicated to solving the problem for all 18 cases, some of which were totally solved. Unfortunately, my email attempt to join the search has gone unanswered, and I'm not sure what to do the next.

What's the proper protocol if I want to continue the project?

[jasong]

Since it may have been buried by other comments :) :

Originally Posted by jasong

What's the proper protocol if I want to continue the project?

[jasong]

No more bumps after this, I promise.

[Jens K Andersen]

If you cannot get in contact with the organizer Dries De Clercq then I suggest trying the listed participants which I assume are David Kokales, Patrick Keller and our own fetofs.

[Phil MjX]

Originally Posted by jasong

No more bumps after this, I promise.

Please have a look at M Kamada's pages :
http://homepage2.nifty.com/m_kamada/...orizations.htm

You'll find many repdigits candidates, with precomputed snfs polys, gnfs and ecm candidates

Regards

Philippe

[jasong]

Originally Posted by Phil MjX

Please have a look at M Kamada's pages :
http://homepage2.nifty.com/m_kamada/...orizations.htm

You'll find many repdigits candidates, with precomputed snfs polys, gnfs and ecm candidates

Regards

Philippe

While that's a very interesting page, I was actually interested in finding repdigit primes, not factoring composites. The project I'm interested in is, in some ways, similar to Seventeen or Bust, Riesel Sieve, and the Prime Sierpinski Project.

[jasong]

Originally Posted by Jens K Andersen

If you cannot get in contact with the organizer Dries De Clercq then I suggest trying the listed participants which I assume are David Kokales, Patrick Keller and our own fetofs.

Thanks for the advice. Notice that I've never claimed to have a lot of common sense, with good reason.

High IQ scores, absolutely I do, but common sense? Not much.

[Phil MjX]

Originally Posted by jasong

While that's a very interesting page, I was actually interested in finding repdigit primes, not factoring composites. The project I'm interested in is, in some ways, similar to Seventeen or Bust, Riesel Sieve, and the Prime Sierpinski Project.

Hi !

At the beginning of each repdigit page, you have the status of the prp found up to date. It may give you a hint for a search start but I agree it isn't a coordinated search.

Regards.

Philippe.

[jasong]

Originally Posted by Phil MjX

Hi !

At the beginning of each repdigit page, you have the status of the prp found up to date. It may give you a hint for a search start but I agree it isn't a coordinated search.

Regards.

Philippe.

If we assume it's abandoned, maybe I should start a thread in Mersenne Forum to attempt to complete the project.

Now I just need to figure out which forum to use.

Oh, I just found the small projects forum, I can put it there. :)