[seqfan] Re: A242927

[Sean A. Irvine]

Yes, such a number is well within reach of standard elliptic curve
primality proving software such as Primo .  However, it is still a fairly
lengthy computation, it would likely take days to complete (at least with
my resources).

See: http://www.ellipsa.eu/public/primo/top20.html

On 24 March 2018 at 14:36, Don Reble <djr at nk.ca> wrote:

> Seqfans:
>
> %I A242927
>> %S 1,2,6,42
>> %N Numbers n such that k^n + (k+1)^n + ... + (k+n-1)^n is prime for some
>> k.
>>
>
>    There's only one more term of A242927: a(5)=1806. A resulting
>    "prime" (k=3081) has 6663 digits: so far it's just a rather strong
>    (Miller-Rabin) probable prime.
>    Is it possible to prove primality for such a big number?
>
> --
> Don Reble  djr at nk.ca
>
>
> --
> Seqfan Mailing list - http://list.seqfan.eu/
>