4,311 reputation
1025
bio website
location
age
visits member for 3 years, 8 months
seen 14 hours ago

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.
Apr
15
comment Proof that 12 in a row tic-tac-toe is a tie game?
Tic-tae-toe on an infinite grid can never end in a tie. Presumably you mean that neither player has a winning strategy.
Apr
11
comment closed form of a specific crazy summation?
It looks like you have a closed form already.
Apr
8
answered Round Robin for Team Matches
Apr
8
comment Round Robin for Team Matches
Does en.wikipedia.org/wiki/… help?
Apr
8
comment Making 7 vertices triangle free graph bipartite by deleting an edge
There's a trivial counter-example: the graph with $|V|=7$ and $|E|=0$.
Apr
7
comment Characterizing a certain set of matrices arising from binary trees
Your diagram doesn't look like a binary tree. It could be converted into a binary tree by inserting three non-leaf nodes, but if this is done symmetrically then the distances between leaf nodes would be $2$ and $4$. What is the actual tree structure?
Apr
4
comment Josephus Variant
You might want to check your results against oeis.org/A032434.
Apr
4
revised Physics Related Watt Question
edited tags
Apr
2
comment Minimal DFA for a given regular expression
Are you familiar with the Myhill-Nerode theorem?
Apr
1
reviewed Edit suggested edit on Order and element set of the group with presentation $\langle a,b \;|\; a^9=1, b^3=a^3, [a,b]=a^3\rangle$
Apr
1
revised Order and element set of the group with presentation $\langle a,b \;|\; a^9=1, b^3=a^3, [a,b]=a^3\rangle$
deleted 2 characters in body