Reputation
29,127
Next tag badge:
367/400 score
265/80 answers
Badges
3 38 88
Impact
~295k people reached

Jun
22
comment Why can only those younger than 40 years old win the Fields Medal?
I understand the first part, how does he achieve stimulating other's renewed effort?
Jun
22
comment Why can only those younger than 40 years old win the Fields Medal?
"If you haven't done ground-breaking research by age 40, chances are you never will". This argument is true, it is also true if we change 40 for any other integer. The chances someone make a Ground Breaking contribution in today's world are very slim regardless their age.
Jun
22
revised picking coprime numbers from the numbers 1-100
added 122 characters in body
Jun
21
comment Partition graph into disjoint beams
Well, I guess it's different, but it uses the Eulerian cycle and it uses the notion of going in vs coming out of a vertex which I think is key.
Jun
21
comment Partition graph into disjoint beams
Very nice,it reminded me of the proof of the following problem: Prove a $2k$ regular graph is $2$-factorizable.
Jun
20
revised Number of n-words such that a and b are not neighbors.
deleted 1 character in body
Jun
20
comment Example of a continuous non-lipschitz function with domain $[0,1]$ and co-domain $\mathbb R$
$\sqrt x$ seems to do the trick
Jun
20
asked Example of a continuous non-lipschitz function with domain $[0,1]$ and co-domain $\mathbb R$
Jun
19
comment Another olympiad question related to External principle (regarding geometry problem)
The numbers for line are known as the Lazy Caterer's sequence, the numbers for the plane are known as the cake numbers !
Jun
18
answered Proving that planar, triangle free graph has vertex v with deg(v) $\leq$ 3
Jun
18
comment Euclidean Algorithm
It's pretty straightforward.
Jun
18
comment Recursive equation in graph theory
The recursion is only valid for deducing $f(5)$ and above.
Jun
18
comment Number of n-words such that a and b are not neighbors.
I don't think a non-recurrence relation closed formula will be possible. This sequence is very similar to the Fibonacci sequence. The Fibonacci sequence has a closed form formula, it can be obtained by taking the recursion, finding the generating and reading of the terms. However the formula for the fibnacci sequence is almost never used since it requires approximating an irrational number first.
Jun
18
revised Number of n-words such that a and b are not neighbors.
edited body
Jun
18
answered Number of n-words such that a and b are not neighbors.
Jun
18
comment Number of n-words such that a and b are not neighbors.
If I manage to solve it gladly :)
Jun
18
comment Number of n-words such that a and b are not neighbors.
oh, that is wrong because what you have to count is the number of sequences in which there is at least one appearance of consecutive a and b's.
Jun
18
comment Number of n-words such that a and b are not neighbors.
Can you explain the logic for $2$? it is wrong
Jun
18
comment Proof of a more general correspondence theorem
Oh, they are the same thing. the image of the morphism $\varphi$ with kernel $N$ is isomorphic to $\frac{G}{N}$ by the first isomorphism theorem.
Jun
18
comment Proof of a more general correspondence theorem
Isn't this just the usual correspondence theorem?