User talk:Tomtom2357: Difference between revisions
From Polymath Wiki
Jump to navigationJump to search
Tomtom2357 (talk | contribs) Created page with "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..." |
Tomtom2357 (talk | contribs) No edit summary |
||
| Line 1: | Line 1: | ||
Hi, I'm Thomas. I'm currently working on a [[ | Hi, I'm Thomas. I'm currently working on a proof that FUNC is true in the case where m=13 (see [[m=13 case of FUNC]]). So far I have proved that if m=13 the smallest nonempty set must be of size 3, 4, or 5, and if the smallest nonempty set has size 5, then there must be two of those intersecting in at least 3 elements. I haven't quite gotten around to posting all of the proofs on the site yet, but I'll try to get that done in the next couple of weeks. | ||
Latest revision as of 19:14, 3 December 2016
Hi, I'm Thomas. I'm currently working on a proof that FUNC is true in the case where m=13 (see m=13 case of FUNC). So far I have proved that if m=13 the smallest nonempty set must be of size 3, 4, or 5, and if the smallest nonempty set has size 5, then there must be two of those intersecting in at least 3 elements. I haven't quite gotten around to posting all of the proofs on the site yet, but I'll try to get that done in the next couple of weeks.
