| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 8 months |
| seen | 3 hours ago | |
| stats | profile views | 877 |
|
5h |
comment |
How can prove this inequality(8) Are you sure that the inequality you invented is true ? |
|
2d |
answered | A matrix w/integer eigenvalues and trigonometric identity |
|
2d |
answered | Formula for the sum of the value of a rational function over roots of unity |
|
2d |
revised |
Formula for the sum of the value of a rational function over roots of unity added 40 characters in body |
|
May 19 |
asked | Formula for the sum of the value of a rational function over roots of unity |
|
May 19 |
comment |
If $\omega$ is a complex cube root of unity, show that the following equals null matrix. Hint : factor $w^3-1$. |
|
May 19 |
awarded | Nice Answer |
|
May 19 |
comment |
Properties of the Cone of Positive Semidefinite Matrices @Yury What do you use to produce those animations ? LaTeX ? |
|
May 18 |
comment |
Complexity of transforming an indirect proof into a direct one To answer your second question : $f(n)=m$ expresses that if we a have an indirect proof of length $\leq n$, then there is a corresponding direct proof of length $\leq m$ (where “indirect proof of $\phi$” means a proof in ZFC' of $ZFC \vdash \phi$, and a “direct proof of $\phi$” means simply a proof in ZFC of $\phi$). |
|
May 18 |
comment |
Complexity of transforming an indirect proof into a direct one Before answering more fully your questions, let me say that the main idea is this : we have an “indirect” proof of length $n$, i.e. a “proof that a proof exists”. If we convert it into a “direct” proof (and we know we can, in theory), can we control the size of the new proof in terms of $n$ ? |
|
May 18 |
comment |
Complexity of transforming an indirect proof into a direct one You’ve indeed answered the initial question I asked, but as usual I misstated what I had in mind, I was actually thinking about another function $f_3$, I’ve just corrected the OP, sorry about that. |
|
May 18 |
revised |
Complexity of transforming an indirect proof into a direct one added 283 characters in body |
|
May 18 |
asked | Complexity of transforming an indirect proof into a direct one |
|
May 18 |
answered | what is the sum of this?$\frac12+ \frac13+\frac14+\frac15+\frac16 +\dots\frac{1}{2012}+\frac{1}{2013} $ |
|
May 17 |
comment |
Some Results in $\mathbb{Z} [\sqrt{10}]$ Yes, your answer to (1) is OK. You got it wrong about (2) : the ring ${\mathbb Z}[\sqrt{10}]$ is not a principal ideal domain (this is what (3) shows) |
|
May 17 |
answered | Maximum size of k-uniform set family that satisfies a condition |
|
May 17 |
comment |
Maximum size of k-uniform set family that satisfies a condition What does “$k$-uniform” mean ? Simply that there are $k$ elements in the set ? |
|
May 17 |
comment |
$x^2+x+1$ is the cube of a prime. @Hecke In what book ? Mordell's? |
|
May 15 |
comment |
The path of complex structure. Nice! I didn't expect a solution that simple. |
|
May 15 |
answered | Multiplication of determinants |