bio | website | |
---|---|---|
location | ||
age | ||
visits | member for | 5 years, 6 months |
seen | 5 hours ago | |
stats | profile views | 805 |
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$. |
Aug 16 |
comment |
What is the protocol for making modifications to someone else's proof to prove something slightly stronger?
Erdős, not Erdös. |
Aug 4 |
comment |
what is the meaning of “consecutive triple points”?
Are you sure it said that? It's not proper English. |
Jul 29 |
comment |
Reducing factoring prime products to factoring integer products (in average-case)
You are being sloppy here. N = PQ can always be factorised -- it just can't be factorised (as far as we know) in polynomial time (with non-negligible probability). |
Jul 28 |
awarded | Enlightened |
Jul 27 |
comment |
Which conjectures only need the Grand Riemann Hypothesis to become genuine theorems?
The Wikipedia article (en.wikipedia.org/wiki/Grand_Riemann_hypothesis) has this wonderful remark: "The Siegel zero, conjectured not to exist, is a possible real zero of a Dirichlet L-series, rather near s = 1." |