https://michaelnielsen.org/polymath/index.php?action=history&feed=atom&title=User_talk%3ATomtom2357 2026-04-07T20:46:40Z Revision history for this page on the wiki MediaWiki 1.42.3 https://michaelnielsen.org/polymath/index.php?title=User_talk:Tomtom2357&diff=9936&oldid=prev 2016-12-04T03:14:57Z

<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 20:14, 3 December 2016</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" 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: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div>Hi, I'm Thomas. I'm currently working on a [[<del style="font-weight: bold; text-decoration: none;">Human proof that completely multiplicative sequences have discrepancy greater than 3</del>]]. <del style="font-weight: bold; text-decoration: none;">This is probably a futile project</del>, <del style="font-weight: bold; text-decoration: none;">because it is already known (by computer search)</del>, <del style="font-weight: bold; text-decoration: none;">that </del>the <del style="font-weight: bold; text-decoration: none;">longest such sequence </del>has <del style="font-weight: bold; text-decoration: none;">length 127645</del>. I <del style="font-weight: bold; text-decoration: none;">probably won</del>'t <del style="font-weight: bold; text-decoration: none;">get that far. However, I have managed </del>to <del style="font-weight: bold; text-decoration: none;">find a sequence </del>of <del style="font-weight: bold; text-decoration: none;">length 1000 while working </del>on the <del style="font-weight: bold; text-decoration: none;">sequences</del>, <del style="font-weight: bold; text-decoration: none;">so </del>I <del style="font-weight: bold; text-decoration: none;">may be able </del>to <del style="font-weight: bold; text-decoration: none;">do a significant portion </del>of <del style="font-weight: bold; text-decoration: none;">the proof. Feel free to edit if you spot any errors.</del></div></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>Hi, I'm Thomas. I'm currently working on a <ins style="font-weight: bold; text-decoration: none;">proof that FUNC is true in the case where m=13 (see </ins>[[<ins style="font-weight: bold; text-decoration: none;">m=13 case of FUNC</ins>]]<ins style="font-weight: bold; text-decoration: none;">)</ins>. <ins style="font-weight: bold; text-decoration: none;">So far I have proved that if m=13 the smallest nonempty set must be of size 3, 4</ins>, <ins style="font-weight: bold; text-decoration: none;">or 5</ins>, <ins style="font-weight: bold; text-decoration: none;">and if </ins>the <ins style="font-weight: bold; text-decoration: none;">smallest nonempty set </ins>has <ins style="font-weight: bold; text-decoration: none;">size 5, then there must be two of those intersecting in at least 3 elements</ins>. I <ins style="font-weight: bold; text-decoration: none;">haven</ins>'t <ins style="font-weight: bold; text-decoration: none;">quite gotten around </ins>to <ins style="font-weight: bold; text-decoration: none;">posting all </ins>of <ins style="font-weight: bold; text-decoration: none;">the proofs </ins>on the <ins style="font-weight: bold; text-decoration: none;">site yet</ins>, <ins style="font-weight: bold; text-decoration: none;">but </ins>I<ins style="font-weight: bold; text-decoration: none;">'ll try </ins>to <ins style="font-weight: bold; text-decoration: none;">get that done in the next couple </ins>of <ins style="font-weight: bold; text-decoration: none;">weeks</ins>.</div></td></tr> <tr><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: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div> </div></td><td colspan="2" class="diff-side-added"></td></tr> <tr><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: #ffe49c; vertical-align: top; white-space: pre-wrap;"><div><del style="font-weight: bold; text-decoration: none;">I use a python depth first search (with a programmable start sequence) and an excel spreadsheet to spot the blocks, but the actual proving bit is just me</del>.</div></td><td colspan="2" class="diff-side-added"></td></tr> </table>

Tomtom2357 https://michaelnielsen.org/polymath/index.php?title=User_talk:Tomtom2357&diff=9645&oldid=prev 2015-05-22T06:38:59Z

<p>Created page with &quot;Hi, I&#039;m Thomas. I&#039;m currently working on a <a href="/polymath/index.php?title=Human_proof_that_completely_multiplicative_sequences_have_discrepancy_greater_than_3" title="Human proof that completely multiplicative sequences have discrepancy greater than 3">Human proof that completely multiplicative sequences have discrepancy greater than 3</a>. This is probably a futile project, because...&quot;</p> <p><b>New page</b></p><div>Hi, I&#039;m Thomas. I&#039;m currently working on a [[Human proof that completely multiplicative sequences have discrepancy greater than 3]]. This is probably a futile project, because it is already known (by computer search), that the longest such sequence has length 127645. I probably won&#039;t get that far. However, I have managed to find a sequence of length 1000 while working on the sequences, so I may be able to do a significant portion of the proof. Feel free to edit if you spot any errors.<br /> <br /> I use a python depth first search (with a programmable start sequence) and an excel spreadsheet to spot the blocks, but the actual proving bit is just me.</div>

Tomtom2357