Home Primes, Reloaded
 

There was a thread [url=http://www.mersenneforum.org/showthread.php?t=9668]here[/url] for Home Primes of Base 10 (most popular).

The results are collected at [url=http://www.mersennewiki.org/index.php/Category:Home_primes]MersenneWiki[/url] but those pages are hard to read, especially for other bases.

With M.Tervooren's [url=http://factordb.com/search.php]FactoringDatabase[/url] it's easy as can be to hold the results (see 'Sequences' and choose the type of sequence).

The last days I've compiled Summary pages (like that ones for the Aliquot Sequences) at [url=www.rieselprime.de]RieselPrimeDatabase[/url] under the new menu 'Interests'.

For now i've only done pages for Bases 2, 6 and 10, because they are most primeness or popular.

For Base 10 I have to do some more work (sizes only upto n~1300) and including more terminated n's with more data from MersenneWiki.

So to all, who will work on these sequences, please feel free to reserve and post your results here. I will update that pages from time to time.

I'm just extending the range for Base 6 to about n=10000 and factoring some of the lower Base 2 composites.

Happy hunting!

I extended [URL="http://factordb.com/search.php?se=10&aq=1370"]1370[/URL] and [URL="http://factordb.com/search.php?se=10&aq=10014"]10014[/URL] a few lines.

Thanks!

I was going to ask about the Home Primes search status once I got my new computer up and running (parts just arrived today). This is perfect timing for me! :smile: Now I've already pushed HP9942 a few iterations while typing my reply...

HP[sub]10[/sub]9942 is already prime (P89) at index 49!

Sorry. I meant 9922.

have we got everything from mersennewiki in the database?

I've taken HP[SUB]10[/SUB]9922 to n=59. I've also taken HP[SUB]10[/SUB]9900 to n=58.

Does anyone have a script that can recursively test a home prime sequence until a prime is found? I could probably write my own, but this would save me the effort.

BTW, found a home prime for 3393.

[QUOTE=rogue;191723]Does anyone have a script that can recursively test a home prime sequence until a prime is found? I could probably write my own, but this would save me the effort.

BTW, found a home prime for 3393.[/QUOTE]

I suppose one could hack aliqueit to make it calculate home primes instead of aliquot sequences...

[quote=rogue;191723]Does anyone have a script that can recursively test a home prime sequence until a prime is found? I could probably write my own, but this would save me the effort.[/quote]
I don't have or know of one. If nobody has one, it'd be easier to modify aliqueit to compute the next line in the sequence as a home prime (i.e. based on the concatenation of prime factors in base x, x could be fixed at 10 or other) instead of as an aliquot sequence (i.e. based on the sum of all factors) than to write a whole new program.
[quote=rogue;191723] BTW, found a home prime for 3393.[/quote]
Congrats. :smile:

[QUOTE=Mini-Geek;191725]I don't have or know of one. If nobody has one, it'd be easier to modify aliqueit to compute the next line in the sequence as a home prime (i.e. based on the concatenation of prime factors in base x, x could be fixed at 10 or other) instead of as an aliquot sequence (i.e. based on the sum of all factors) than to write a whole new program.[/QUOTE]

I will leave that hacking to someone else because I'm not a big fan of perl.

I was lucky enough to find a second home prime today, although I don't recall which one it was. This is the first time I've actually used the factor database. I would make a few changes, but other than that, it saves me a bit of work.