Page 1 of 1
A Repeat of Pi (ambiguity)
Posted: Sat Jun 07, 2008 6:37 pm
by Allosentient
I am trying to figure out exactly what kind of repeating sequence you are looking for. I know it is not something like 1111111 since that would be too easy.
I tried searching for a string of x length that appears more than once in the sequence, but that either didn't find an answer or ate an extreme amount of cpu.
Now I am trying to find something such as 123456123456 (appearing consecutively). I know it must be at least 12 digits (there was more than one that was 10 digits). but that is also eating a lot of cpu and I do not even know if I am doing this the correct way.
Sorry to ask so many questions but hopefully this will help anyone else who might have a similar problem
Posted: Sat Jun 07, 2008 9:05 pm
by adum
you're looking for any repeated sequence.
so if your digits were
123654323653
your answer would be '2365'
some approaches will require more cpu time than others =)
good luck,
adum
Posted: Sat Jun 21, 2008 6:09 am
by the_impaler
Can the sequences overlap ? E.g. 234562345623456 can be treated as 2345623456 twice with overlapping and 23456 3 times without overlapping.
Posted: Sat Jun 21, 2008 5:16 pm
by adum
the sequence can overlap, but i'll give you the hint that it's pretty unlikely on a random sequence of digits =)
adum
Posted: Tue Dec 01, 2009 9:45 pm
by haX0r1337
How many digits have the answer? > 10 ?
(Sorry for bad english).
Posted: Tue Dec 01, 2009 9:57 pm
by smutley
That is part of the challenge to find out. And is it important to know?
Posted: Wed Dec 02, 2009 7:13 am
by haX0r1337
Yes it's important.
Then my program runs faster.
Posted: Wed Dec 02, 2009 12:42 pm
by DaymItzJack
Then do something smart and you'll get the right answer fast.
Confirmation
Posted: Fri Mar 12, 2010 10:15 pm
by laz0r
Can anyone confirm that for sequences first appearing in the first hundred thousand digits, there are several candidates with the top length 10 digits?
Posted: Sat Mar 13, 2010 1:06 am
by megabreit
I can't confirm that, but it's likely, that there are some candidates with 10 digits length. Why do you want to know that? The challenge scope is 1 million digits and with today's computing power (and the right algorithm) it's possible to search 1 million digits nearly as fast as 100000 digits...
Posted: Sat Mar 13, 2010 10:17 am
by laz0r
I don't think I have the right algorithm... for each digit, I'm going through the longest repeating sequence from that digit. It's taking a very long time to go through all the digits.
Posted: Sat Mar 13, 2010 12:36 pm
by laz0r
Ah! Got it now. Better algorithm
Posted: Wed Jul 27, 2011 12:14 pm
by moose
Lets make a rather short example. For 100 digits of pi the correct solution would be 592, would it?
Posted: Wed Jul 27, 2011 2:28 pm
by laz0r
moose wrote:Lets make a rather short example. For 100 digits of pi the correct solution would be 592, would it?
Indeed
Posted: Thu Jul 28, 2011 4:24 pm
by AMindForeverVoyaging
moose wrote:Lets make a rather short example. For 100 digits of pi the correct solution would be 592, would it?
If my program works correctly, your answer is not wrong, but incomplete:
Code: Select all
i: 3, j: 60, search_length: 3, pattern match: 592 592
i: 71, j: 81, search_length: 3, pattern match: 628 628
i: 73, j: 80, search_length: 3, pattern match: 862 862