[seqfan] Re: Smallest prime with a substring of exactly n zeros
Bob Selcoe
rselcoe at entouchonline.net
Sun Feb 21 17:43:49 CET 2016
Hans, I avoided considering this because we could extend that even further and make things too confusing. For example, we can't have candidates with an even number of digits where z=1 and a=b, because those are all multiples of 11. I think it's better just to leave it as is
Cheers,
Bob
Sent from my iPhone
> On Feb 21, 2016, at 3:32 AM, Hans Havermann <gladhobo at teksavvy.com> wrote:
>
> A small quibble over the notion that a={1..9}, b={1,3,7,9} creates 36 candidate primes. The sum of the two or three non-zero digits in these primes can't be a multiple of three, so the list 'a' is materially reduced (by three), thus creating only 24 candidate primes.
>
>> On Feb 20, 2016, at 5:42 PM, Bob Selcoe <rselcoe at entouchonline.net> wrote:
>>
>> I've posted some observations on https://oeis.org/A037053 to flesh out the ideas, publication pending. Hopefully all is clear and I've made no calculation errors.
>
>
> _______________________________________________
>
> Seqfan Mailing list - http://list.seqfan.eu/
More information about the SeqFan
mailing list