https://michaelnielsen.org/polymath/index.php?action=history&feed=atom&title=Talk%3ALength_1124_sequencesTalk:Length 1124 sequences - Revision history2026-07-02T07:23:02ZRevision history for this page on the wikiMediaWiki 1.42.3https://michaelnielsen.org/polymath/index.php?title=Talk:Length_1124_sequences&diff=2495&oldid=prevSuneJ at 19:15, 9 January 20102010-01-09T19:15:15Z<p></p>
<table style="background-color: #fff; color: #202122;" data-mw="interface">
<col class="diff-marker" />
<col class="diff-content" />
<col class="diff-marker" />
<col class="diff-content" />
<tr class="diff-title" lang="en">
<td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">← Older revision</td>
<td colspan="2" style="background-color: #fff; color: #202122; text-align: center;">Revision as of 12:15, 9 January 2010</td>
</tr><tr><td colspan="2" class="diff-lineno" id="mw-diff-left-l1">Line 1:</td>
<td colspan="2" class="diff-lineno">Line 1:</td></tr>
<tr><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>I think the method used to find it was the same as for the first one. A I understand it, Klas has a program that searches for sequences of length over <math>100n</math> extended from a list of sequences of length <math>25</math> that he already knows are extendable to length <math>100(n-1)</math>. So far he's posted three sequences of length over <math>1000</math> generated in this way, of which two have yielded sequences of length <math>1124</math> by using them as initial nodes in a depth-first search.</div></td><td class="diff-marker"></td><td style="background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;"><div>I think the method used to find it was the same as for the first one. A I understand it, Klas has a program that searches for sequences of length over <math>100n</math> extended from a list of sequences of length <math>25</math> that he already knows are extendable to length <math>100(n-1)</math>. So far he's posted three sequences of length over <math>1000</math> generated in this way, of which two have yielded sequences of length <math>1124</math> by using them as initial nodes in a depth-first search.</div></td></tr>
<tr><td colspan="2" class="diff-side-deleted"></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;"></ins></div></td></tr>
<tr><td colspan="2" class="diff-side-deleted"></td><td class="diff-marker" data-marker="+"></td><td style="color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;"><div><ins style="font-weight: bold; text-decoration: none;">Ok, I thought you used a (p,q) trick that you didn't use the first time? I no one minds, I will keep two pages about 1124 sequences: One about the first (since we have lot about that one), and one about all of them. Perhaps they will turn into one page about our analyses of the sequences and one page about how we found them. --[[User:SuneJ|SuneJ]] 19:15, 9 January 2010 (UTC)</ins></div></td></tr>
</table>SuneJhttps://michaelnielsen.org/polymath/index.php?title=Talk:Length_1124_sequences&diff=2486&oldid=prevAlec: New page: I think the method used to find it was the same as for the first one. A I understand it, Klas has a program that searches for sequences of length over <math>100n</math> extended from a lis...2010-01-09T18:49:29Z<p>New page: I think the method used to find it was the same as for the first one. A I understand it, Klas has a program that searches for sequences of length over <math>100n</math> extended from a lis...</p>
<p><b>New page</b></p><div>I think the method used to find it was the same as for the first one. A I understand it, Klas has a program that searches for sequences of length over <math>100n</math> extended from a list of sequences of length <math>25</math> that he already knows are extendable to length <math>100(n-1)</math>. So far he's posted three sequences of length over <math>1000</math> generated in this way, of which two have yielded sequences of length <math>1124</math> by using them as initial nodes in a depth-first search.</div>Alec