Reputation
1,137
Top tag
Next privilege 2,000 Rep.
Edit questions and answers
Badges
1 13 27
Newest
 Explainer
Impact
~64k people reached

Nov
5
answered Prove $\forall K > 0: \lim_{n\rightarrow\infty} \sqrt[n]{K} = 1$
Nov
5
asked $\lim\limits_{n\to\infty}\frac{n^{n+1}}{n!}$ with sandwich rule
Oct
30
awarded  Citizen Patrol
Oct
22
comment Is it possible to make a graph eulerian by adding exactly one node?
This lemma and Michaels answer helped me out!
Oct
22
accepted Is it possible to make a graph eulerian by adding exactly one node?
Oct
22
comment Is it possible to make a graph eulerian by adding exactly one node?
The handshaking lemma and your edit gave me a good clue to solve this. Thanks!
Oct
22
revised Is it possible to make a graph eulerian by adding exactly one node?
changed path to cycle because I did not correctly translate it
Oct
22
comment Is it possible to make a graph eulerian by adding exactly one node?
I am sorry, then I have translated it wrong. I have to work with a cycle - editing it now!
Oct
22
comment Is it possible to make a graph eulerian by adding exactly one node?
I know that a connected graph has an Eulerian path iff all vertices have even degree. I even proved that yesterday, isn't that contradicting with your mentioned property?
Oct
22
asked Is it possible to make a graph eulerian by adding exactly one node?
Oct
22
comment Find the remainder of $128^{1000}/153$.
@Rain: One can add LaTeX code between dollar signs. If you know how to write LaTeX code you will profit here ;)
Oct
22
revised Find the remainder of $128^{1000}/153$.
improved the title with latex
Oct
22
suggested approved edit on Find the remainder of $128^{1000}/153$.
Oct
20
comment Relation of (un)bounded (in)finite sets and $\min$/$\max$
(1) As mentioned in fgp's answer I will reuse your idea. Quite easy, when being reminded of this fact with $1/n$. (2) I like $A=\{1\}$ more, but yeah quite complex what I did there. (3) I'm sorry, but I didn't really get everything you wanted to explain. fgp's description was more intuitive on the first look. (4) Ok :)
Oct
20
comment Relation of (un)bounded (in)finite sets and $\min$/$\max$
(1) I do not want to use injective maps as proof though I like your idea. However I will use Brians general approach with $\forall x\in\mathbb R,x>0:\exists n\in\mathbb N:0<1/n<x$. (2) My approach is waaaaay to complex :D (3) Good idea going through all elements and comparing them with a finite number of operations. I will reuse this one. (4) Thanks, however my idea was really easy and nothing special.
Oct
20
asked Relation of (un)bounded (in)finite sets and $\min$/$\max$
Oct
19
comment Prove equivalence of conditions for a tree
Ok I will keep that in mind. Thanks for now.
Oct
19
accepted Prove equivalence of conditions for a tree
Oct
19
comment Prove equivalence of conditions for a tree
I did work out extensions for both arguments based on your hints. Does the current version suffice now?
Oct
19
revised Prove equivalence of conditions for a tree
extended proof with suggestions based on hints