Reputation
38,769
Next tag badge:
97/100 score
44/20 answers
Badges
4 52 113
Newest
 Nice Answer
Impact
~452k people reached

Jan
6
revised Sum and product of k real numbers > 0 is unique?
added 1 character in body
Jan
6
answered Sum and product of k real numbers > 0 is unique?
Jan
6
answered Variant of “prisoners and hats” puzzle with more than two colors
Jan
5
comment A combinatoric $gcd$ problem
If you want to solve that project euler problem you would be better of reading the wikipedia pythagorean triples page carefully
Jan
5
comment Complete group multiplication table with 6 elements.
yes${}{}{}{}{}{}$
Jan
5
comment Complete group multiplication table with 6 elements.
The two groups are $S_3$ and $\mathbb Z_6$
Jan
5
comment $K_3$ subgraph in a random graph
It is a lot easier to find the expected number of triangles.
Jan
5
answered What method can I use to determine continuity of squares on a 2d grid?
Jan
5
comment What method can I use to determine continuity of squares on a 2d grid?
use a union-find.
Jan
5
comment What method can I use to determine continuity of squares on a 2d grid?
connected is a better word
Jan
5
comment Prove that there exists bipartite graph with this degree sequence: $(3,3,3,3,3,5,6,6,6,6,6,6,6,6)$
Nice, I think the following argument as to why $34$ cant be made is easier. The side without $5$ adds up to a multiple of $3$, which $34$ is not.
Jan
5
accepted Metric space with two similar points which are not in the same orbit.
Jan
4
asked Metric space with two similar points which are not in the same orbit.
Jan
4
comment Break the connection between two edges by removing the minimum amount of edges
This is also related: en.wikipedia.org/wiki/…
Jan
4
comment Break the connection between two edges by removing the minimum amount of edges
I think this is what you want: stackoverflow.com/questions/15991701/…
Jan
4
comment Break the connection between two edges by removing the minimum amount of edges
anyways, your problem is most likely determining the conectivity of a graph
Jan
4
comment Break the connection between two edges by removing the minimum amount of edges
Can you please revise your question? I think that you are swapping "edge" and "cities" and it makes it confusing
Jan
4
comment Set of the vertex sets to make connected graph into disjoint sets of vertices?
Wait, do you want to have zero edges after removing the vertices? Or do you just want it to be disconnected? If it is the first option what you want is a dominating set
Jan
4
comment Countable-infinity-to-one function
do you have any examples which come close ? the function $x\cos(x)$ with $x\neq0$ and $f(0)=0$ get us at least one point with countable preimage and everything elsse with finite preimage. Using this we can extend it to have any finite subset with finite preimage and everything else with finite preimage. Do you have examples that come closer (for example, on which gives an infinite set with uncountably infinite preimages)?
Jan
4
comment Evaluate $\lim_{n\to\infty} \left( \frac{n!}{n^n} \right)^{1/n}$
yeah, I gave a small sketch of proof above, I agree this is a more direct approach.