[seqfan] Re: A071901: Mmca code for large n's?
mathstutoring
mathstutoring at ntlworld.com
Tue Nov 17 15:34:16 CET 2009
I just ran your first MMCA code in version 7.0.1.0 and it took just 6.724
seconds to compute the first 10000 terms
Ant
----- Original Message -----
From: "zak seidov" <zakseidov at yahoo.com>
To: "seqfaneu" <seqfan at seqfan.eu>
Sent: Tuesday, November 17, 2009 1:30 PM
Subject: [seqfan] A071901: Mmca code for large n's?
> In
> A071901 n-th decimal digit of the fractional part of the square root of
> the n-th prime. ,
>
> Mmca code is OK up to n=114
>
> q[n_] := Mod[Floor[10^n*Sqrt[Prime[n]]], 10]; Table[q[n], {n, 114}]
>
> but at n=115 (and larger n's) Mmca complains:
> q[115]
> Internal precision limit $MaxExtraPrecision ... reached while
> evaluating...
>
> This version happlily gives even 100000th term
> in no time:
> Table[rd=RealDigits[N[Sqrt[Prime[n]],2*n]];
> rd[[1,rd[[2]]+n]],{n,10000,100000,10000}]
> {4,5,2,6,2,2,6,7,2,3}
>
> Any ideas?
> C++? PARI?
>
> Zak
>
>
>
>
>
> _______________________________________________
>
> Seqfan Mailing list - http://list.seqfan.eu/
More information about the SeqFan
mailing list