Reputation
4,782
Top tag
Next privilege 5,000 Rep.
Approve tag wiki edits
Badges
1 13 28
Newest
 Steward
Impact
~89k people reached

Jun
12
comment How do you create a nonlinear game that the player can always win?
The way to maximise the non-linearity is to minimise the interdependence of the puzzles. The point I'm hoping that you'll take away is that you need to rethink your goal.
Jun
12
answered How do you create a nonlinear game that the player can always win?
Jun
11
reviewed Close Definition of standard functions
Jun
11
comment Gosper summable
The case $m=1$ is quite easy. The case $m>1$ seems to require showing that a set of simultaneous equations has no solution.
Jun
10
comment Hex game winning strategy
It's not clear from the question what the board layout is (you can do ASCII art by putting 4 spaces before each line, and there are online designs for ASCII art hexagons), or what the rules of the game are.
Jun
3
reviewed Close Absolute and Conditional Convergence of the integral $\frac{\sin(x)}{x^p}$ for real values of $p$
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.