TonyK
Reputation
1,871
Next privilege 2,000 Rep.
 Mar 10 awarded Nice Answer Oct 19 awarded Yearling Jun 26 comment Travelling Salesman Problem: Can the nearest neighbor algorithm be $n$ times longer than the optimal solution? You're still saying No... Jun 26 comment Travelling Salesman Problem: Can the nearest neighbor algorithm be $n$ times longer than the optimal solution? Doesn't that mean that the answer to the first question is Yes? Given $n$, we can always choose $N$ so that $0.5(\lceil \log_2N\rceil+1) > n$. Jun 12 answered Is the diameter of a centrally symmetric convex body realized by a pair of antipodal points? Apr 14 comment Does the Brouwer fixed point theorem admit a constructive proof? @Arno: How can we compute such an interval, when we can't even decide whether a computable number is positive or negative? Apr 14 comment Does the Brouwer fixed point theorem admit a constructive proof? "Any computable function [...] has a computable root": I'm surprised by that. I'm pretty sure that not every such computable function has a constructively computable root. Apr 13 awarded Nice Answer Mar 2 awarded Good Answer Nov 26 comment A game of stones I have checked your claim on my computer: if your construction does generate an overcrowded node, it must be greater than 30,000. But I can't see how to prove it. Nov 26 comment A game of stones I would prefer 'conjecture' to 'claim'. A claim is usually something that you are going to prove later. Oct 19 awarded Yearling Oct 19 awarded Yearling Oct 19 awarded Yearling Jun 1 comment Maximum subset of set of Integers with minimum distance You have chosen the wrong forum for this! Try posting it on stackoverflow.com -- you will get dozens of answers explaining how to solve your problem using dynamic programming. May 21 comment Does a product of matrices have eigenvalue 1 This depends crucially on the set of sequences that you are interested in. Is it all sequences of length $k$? If not, what? Nov 27 comment Drawing lines and removing squares - an Alice and Bob game The proper questions to ask are: Given $N$, which player wins? And how? Nov 7 comment factorising an integer with certain bound on the factors Why do you want to do this? Oct 20 awarded Yearling Sep 6 comment Some weird “system” of inequalities in nonnegative integers. You should not have responded so quickly to SPG's question! $i≤j≤k≤l$ is not consistent with $1≤i,j,k,l≤17$.