4,441 reputation
1027
bio website
location
age
visits member for 3 years, 9 months
seen 2 hours ago

Jun
3
reviewed Close Absolute and Conditional Convergence of the integral $\frac{\sin(x)}{x^p}$ for real values of $p$
Jun
3
revised Geometry-Straight lines and triangles
deleted 1 character in body
Jun
3
answered Probability a polynomial has a root which is a root of unity
May
21
comment Deterministic Push-Down Automata
Is $U$ a terminal? And as a hint: have you tried building a non-deterministic push-down automaton to recognise this language?
May
21
comment What is one way to prove that there exists no ellipse that matches the exact curvature of the sin wave?
That doesn't rule out the sine wave being less than half of an ellipse.
May
16
comment what is the minimum value of the angles inside these triangles?
I think the question is: what is the smallest angle $\alpha$ such that there exists a dissection of the square into triangles satisfying two properties: that none of the triangles has an internal angle greater than $\alpha$; and that no vertex of a triangle touches another triangle except at a vertex. If so, there's an easy lower bound of 67.5 degrees.
May
15
answered Turing Machine Decidability
May
13
answered Non-inductive, not combinatorial proof of $\sum_{i \mathop = 0}^n \binom n i^2 = \binom {2 n} n$
May
13
answered Unbounded sequence with convergent subsequence
May
12
awarded  Nice Question
May
6
comment Calculate the Probability for Binary Matrix
I assume that the second sentence means that each element of the matrix is $1$ with probability $p$, but is the third sentence talking about independence of random variables or about linear independence (i.e. the matrix is non-singular)?
Apr
25
answered Repeating cycles in the $3n-1$ problem
Apr
23
comment Repeating cycles in the $3n-1$ problem
Your cycles have a very close link with the cycles of $3n+1$ starting with negative $n$.
Apr
19
comment Return of the lost ant 3D
That such paths exist isn't an problem. Whether or not they have a length is another matter.
Apr
17
comment Maximum number of edges in a (n,n) bipartite graph, that doens't have a complete bipartite subgraph $K_{r,r}$
$c=0$ works for every $r$.
Apr
17
comment Maximum number of edges in a (n,n) bipartite graph, that doens't have a complete bipartite subgraph $K_{r,r}$
There's a trivial solution: let $c=0$. If $r=1$ then that's tight.
Apr
17
comment Prove that there are two frogs in one square.
Harry Dunlop's answer already provides a solution: this is essentially just Hilbert's Hotel backwards.
Apr
16
revised an intriguing integral $I=\int\limits_{0}^{4} \frac{dx}{4+2^x} $
edited tags
Apr
16
revised Inverse quantile function for $\sin^2(x)$
edited tags
Apr
15
comment Game Theory - Voting
The procedure as described doesn't seem to always select a winner. If A gets 51%, B gets 49%, C gets 0%, and D gets 0% then the first round of eliminations should ditch C and D, but neither A or B can be eliminated.