Groups > comp.soft-sys.math.mathematica > #3062

Seaching in Pi a sequence. Looking for a faster method

From	Guillermo Sanchez <guillermo.sanchez@hotmail.com>
Newsgroups	comp.soft-sys.math.mathematica
Subject	Seaching in Pi a sequence. Looking for a faster method
Date	2011-06-10 10:38 +0000
Organization	Steven M. Christensen and Associates, Inc and MathTensor, Inc.
Message-ID	<isss68$jdf$1@smc.vnet.net> (permalink)

Show all headers | View raw

Dear Group

I have developed this function

piesimo[n_, m_, r_] := Module[{a}, a = Split[RealDigits[Pi - 3, 10, n]
[[1]]]; Part[Accumulate[Length /@ a], Flatten[Position[a, Table[m,
{r}]]] - 1] + 1]

n is the digits of Pi, after 3, where to search a sequence of m digit
r times consecutives.
For instance:

piesimo[10^7, 9, 7]

Gives that the sequence 9999999 happens in positions:

{1722776, 3389380, 4313727, 5466169}

I know that in this group I will find  faster methods. Any idea?

Guillermo

Back to comp.soft-sys.math.mathematica | Previous | Next — Next in thread | Find similar | Unroll thread

Thread

Seaching in Pi a sequence. Looking for a faster method Guillermo Sanchez <guillermo.sanchez@hotmail.com> - 2011-06-10 10:38 +0000
  Re: Seaching in Pi a sequence. Looking for a faster method rafapa <rafapa@us.es> - 2011-06-12 09:07 +0000

csiph-web