[seqfan] Re: More terms for needed for A086748, Numbers m such that when C(2k, k) == 1 (mod m) then k is necessarily even.

[Max Alekseyev]

My script binomod.gp from
https://oeis.org/wiki/User:Max_Alekseyev/gpscripts#Binomial_coefficients_modulo_integers
can be used for computing C(2k,k) mod m.
Specifically for m=1001, I've tested all odd k <= 2.2*10^10 without luck.
Regards,
Max


On Sat, Jul 13, 2024 at 5:39 PM Don Reble via SeqFan <seqfan at list.seqfan.eu>
wrote:

> > What does your code say about m = 1001 = 7 * 11 * 13 ?
>
>     Especially, what does it say for that M,
>     when K reaches 9788349978563 ?
>     (That would be a good double-check; but I don't know
>      whether Maple can do that binomial modulo M.)
>
> --
> Don Reble  djr at nk.ca
>
>
> --
> Seqfan Mailing list - http://list.seqfan.eu/
>