User talk:Tomtom2357

Hi, I'm Thomas. I'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'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.

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.