User contributions for Tomtom2357

25 May 2015

• 00:1000:10, 25 May 2015 diff hist +260‎ Side Proof 4 ‎ Finished case 1.1.1

23 May 2015

• 05:3905:39, 23 May 2015 diff hist 0‎ Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎No edit summary
• 05:3805:38, 23 May 2015 diff hist +1,360‎ Side Proof 4 ‎ →‎Case 1.1.1: f(2)=f(7)=f(19)=f(23)=f(37)=f(53)=f(67)=f(71)=f(79)=1, f(29)=f(31)=f(43)=-1
• 04:2004:20, 23 May 2015 diff hist +669‎ Side Proof 4 ‎ Continued case 1.1.1

22 May 2015

• 21:2321:23, 22 May 2015 diff hist +101‎ Side Proof 4 ‎ →‎Case 1.1.1: f(2)=f(7)=f(19)=f(23)=f(37)=f(53)=f(67)=f(71)=f(79)=1, f(29)=f(31)=f(43)=-1
• 20:4520:45, 22 May 2015 diff hist +41‎ Side Proof 4 ‎ →‎Case 1.1.1: f(2)=f(7)=f(19)=f(23)=f(37)=f(53)=f(67)=f(71)=f(79)=1, f(29)=f(31)=f(43)=-1

21 May 2015

• 23:3823:38, 21 May 2015 diff hist +645‎ N User talk:Tomtom2357 ‎ 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..."
• 21:4621:46, 21 May 2015 diff hist +2‎ Side Proof 4 ‎ →‎Case 1.1.1: f(2)=f(7)=f(19)=f(23)=f(37)=f(53)=f(67)=f(71)=f(79)=1, f(29)=f(31)=f(43)=-1
• 21:4521:45, 21 May 2015 diff hist 0‎ Side Proof 4 ‎ →‎Case 1.1.1: f(2)=f(7)=f(19)=f(23)=f(37)=f(53)=f(67)=f(71)=f(79)=1, f(29)=f(31)=f(43)=-1
• 21:4521:45, 21 May 2015 diff hist +1,280‎ Side Proof 4 ‎ Continued Case 1.1.1
• 20:2120:21, 21 May 2015 diff hist −66‎ Side Proof 4 ‎No edit summary
• 20:1320:13, 21 May 2015 diff hist 0‎ Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎ →‎Case 1.1: f(2)=f(7)=1
• 17:1617:16, 21 May 2015 diff hist +1‎ Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎ →‎Case 1.1.3: f(2)=f(7)=f(19)=f(23)=f(37)=1, f(29)=f(31)=-1
• 04:3404:34, 21 May 2015 diff hist 0‎ Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎No edit summary
• 04:0204:02, 21 May 2015 diff hist −3,646‎ Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎No edit summary
• 03:5803:58, 21 May 2015 diff hist +4‎ Side Proof 4 ‎No edit summary
• 03:5803:58, 21 May 2015 diff hist +4,030‎ N Side Proof 4 ‎ Created page with "This page will handle one of the long cases in the Human proof that completely multiplicative sequences have discrepancy greater than 3, so that the page can be shorter and no..."
• 03:5203:52, 21 May 2015 diff hist +165‎ Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎ →‎Case 1.1.3: f(2)=f(7)=f(19)=f(23)=f(37)=1, f(29)=f(31)=-1
• 03:4403:44, 21 May 2015 diff hist +8,653‎ N Side Proof 3 ‎ Created page with "This page will handle one of the long cases in the Human proof that completely multiplicative sequences have discrepancy greater than 3, so that the page can be shorter an..." current
• 03:4403:44, 21 May 2015 diff hist −8,309‎ Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎No edit summary
• 03:3503:35, 21 May 2015 diff hist −59‎ Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎No edit summary
• 03:3103:31, 21 May 2015 diff hist +12‎ Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎ →‎Case 1.1.1: f(2)=f(7)=f(19)=f(23)=f(29)=1
• 03:2903:29, 21 May 2015 diff hist +4,853‎ N Side Proof 2 ‎ Created page with "This page will handle one of the long cases in the Human proof that completely multiplicative sequences have discrepancy greater than 3, so that the page can be shorter and no..." current
• 02:3102:31, 21 May 2015 diff hist −4,433‎ Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎ →‎Case 1.1.2: f(2)=f(7)=f(19)=f(23)=f(31)=1, f(29)=-1
• 02:2602:26, 21 May 2015 diff hist +3,474‎ N Side Proof 1 ‎ Created page with "This page will handle one of the long cases in the Human proof that completely multiplicative sequences have discrepancy greater than 3, so that the page can be shorter an..." current
• 02:2502:25, 21 May 2015 diff hist −3,108‎ Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎ moved proof to other page
• 02:1802:18, 21 May 2015 diff hist +737‎ Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎ started case 1.1.3.2.1.1.1

20 May 2015

• 04:5904:59, 20 May 2015 diff hist +436‎ Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎No edit summary

17 May 2015

• 02:3002:30, 17 May 2015 diff hist +730‎ Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎No edit summary

14 May 2015

• 22:0922:09, 14 May 2015 diff hist +1,199‎ Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎No edit summary
• 21:1621:16, 14 May 2015 diff hist +688‎ Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎ Started case 1.1.3.2

13 May 2015

• 15:4715:47, 13 May 2015 diff hist +702‎ Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎ Completed all of case 1.1.3.1
• 06:2906:29, 13 May 2015 diff hist +360‎ Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎ Completed Case 1.1.3.1.2

12 May 2015

• 23:5623:56, 12 May 2015 diff hist +1,587‎ Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎ Added further deductions

8 May 2015

• 04:4704:47, 8 May 2015 diff hist +3,996‎ Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎No edit summary

5 May 2015

• 23:0123:01, 5 May 2015 diff hist +852‎ Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎ →‎Case 1.1.3.1: f(2)=f(7)=f(19)=f(23)=f(37)=f(43)=1, f(29)=f(31)=-1
• 21:4321:43, 5 May 2015 diff hist +907‎ Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎No edit summary

2 May 2015

• 21:3721:37, 2 May 2015 diff hist +655‎ Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎ Started case 1.1.3
• 20:2520:25, 2 May 2015 diff hist +120‎ Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎No edit summary
• 20:2220:22, 2 May 2015 diff hist +320‎ Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎No edit summary
• 20:1920:19, 2 May 2015 diff hist −73‎ Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎ Removed cases 1.1.2.1 and 1.1.2.2 due to simplifications
• 20:1420:14, 2 May 2015 diff hist +63‎ Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎ →‎Case 1.1.2.1: f(2)=f(7)=f(19)=f(23)=f(31)=f(47)=1, f(29)=-1
• 20:1220:12, 2 May 2015 diff hist +849‎ Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎ Completed case 1.1.2.1
• 04:5504:55, 2 May 2015 diff hist +150‎ Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎ →‎Case 1.1.2.1: f(2)=f(7)=f(19)=f(23)=f(31)=f(47)=1, f(29)=-1

30 April 2015

• 23:4823:48, 30 April 2015 diff hist −3‎ Different upper and lower bound ‎No edit summary current
• 23:2923:29, 30 April 2015 diff hist +1,397‎ Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎No edit summary
• 22:0322:03, 30 April 2015 diff hist +662‎ Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎No edit summary

27 April 2015

• 06:4806:48, 27 April 2015 diff hist +1,228‎ Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎ →‎Case 1.1.2: f(2)=f(7)=f(19)=f(23)=1, f(29)=-1

26 April 2015

• 04:4704:47, 26 April 2015 diff hist +330‎ Human proof that completely multiplicative sequences have discrepancy greater than 3 ‎ Continued Section 1.1.2

25 April 2015

• 23:2723:27, 25 April 2015 diff hist +131‎ The Erdős discrepancy problem ‎ Added link