User contributions for Mark Bennet
From Polymath Wiki
A user with 28 edits. Account created on 22 July 2009.
26 July 2010
- 04:0404:04, 26 July 2010 diff hist +2 m Imo 2010 →Compound moves: typo current
20 July 2010
- 12:0612:06, 20 July 2010 diff hist +34 Imo 2010 →World records: Correcting inaccurate statement and clarifying formulae
16 July 2010
- 13:4813:48, 16 July 2010 diff hist +412 Imo 2010 →World records: lowest scores
12 July 2010
- 14:0414:04, 12 July 2010 diff hist +12 Imo 2010 No edit summary
- 14:0314:03, 12 July 2010 diff hist 0 Imo 2010 typo
- 13:3413:34, 12 July 2010 diff hist +1,254 Imo 2010 Adding some observations on patterns and records
30 January 2010
- 03:1303:13, 30 January 2010 diff hist +57 m Human proof that completely multiplicative sequences have discrepancy greater than 2 Heading
- 03:0903:09, 30 January 2010 diff hist −1,876 Human proof that completely multiplicative sequences have discrepancy greater than 2 Contradiction at value 123 ends case f(2)=f(37)=+1
- 02:4402:44, 30 January 2010 diff hist 0 m Human proof that completely multiplicative sequences have discrepancy greater than 2 Deduction of 141 - typo: 137 and 139 rather than 107 and 109
11 January 2010
- 23:4823:48, 11 January 2010 diff hist +845 Sequence of length 1112 Subsequence analysis
- 11:1411:14, 11 January 2010 diff hist +20 T m(x) = (+/-)T n(x) Correcting oversight on 11-sequence
- 10:5710:57, 11 January 2010 diff hist +623 T m(x) = (+/-)T n(x) Analysis of 974 sequence
- 09:1409:14, 11 January 2010 diff hist +641 N Talk:T m(x) = (+/-)T n(x) New page: The cases Tm(x)=±Tn(x)=±x and C=2 are providing some interesting structure when the values of m and n are primes (2 and 5 were a good choice, and 11 and 13 got added to the mix). It is a... current
- 00:1900:19, 11 January 2010 diff hist +358 T m(x) = (+/-)T n(x) Subsequence analysis of sequence length 854
10 January 2010
- 21:2921:29, 10 January 2010 diff hist +518 T m(x) = (+/-)T n(x) No edit summary
- 14:3814:38, 10 January 2010 diff hist +97 Experimental results No edit summary
- 10:1610:16, 10 January 2010 diff hist −1 m Experimental results No edit summary
- 10:1510:15, 10 January 2010 diff hist +457 Experimental results An additional wish for investigation of finite sets of primes including 2
4 August 2009
- 12:4412:44, 4 August 2009 diff hist +397 N Talk:Kolmogorov complexity New page: Simple observation. As with algorithms for compressing files for data transmission, there may be a number of different ways of setting up a Turing Machine to do the job, and different mach... current
25 July 2009
- 09:1809:18, 25 July 2009 diff hist +86 Talk:Imo 2009 q6 Adding reference to proof #5 current
24 July 2009
- 00:5600:56, 24 July 2009 diff hist +1,475 Talk:Imo 2009 q6 No edit summary
23 July 2009
- 00:3600:36, 23 July 2009 diff hist +1,086 N Talk:Imo 2009 q6 New page: It seems to me that proof #1 says 'let's make as much progress as possible', and by working with sets of partial paths extends the counting approach used in proof #2 case 4 to do more work...
22 July 2009
- 22:5922:59, 22 July 2009 diff hist +340 Imo 2009 q6 →Notation
- 22:5322:53, 22 July 2009 diff hist +63 m Imo 2009 q6 →Proof #2
- 22:4722:47, 22 July 2009 diff hist 0 m Imo 2009 q6 →Proof #2
- 22:4122:41, 22 July 2009 diff hist +19 m Imo 2009 q6 →Proof #2
- 22:3822:38, 22 July 2009 diff hist +6 m Imo 2009 q6 →Proof #2
- 22:3322:33, 22 July 2009 diff hist +3,808 Imo 2009 q6 →Proof #2
