Reputation
10,658
Top tag
Next privilege 15,000 Rep.
Protect questions
Badges
2 22 54
Newest
 Nice Answer
Impact
~257k people reached

May
31
comment On doubly graceful permutations
Vote for Yuval's answer! He actually solves the problem instead of just idly speculating.
May
31
answered On doubly graceful permutations
May
24
answered Fibonacci/Lucas Number Congruences
May
20
awarded  Fanatic
May
17
comment Finding the measure of an angle
It doesn't matter, though; your two solutions are just mirror images of each other.
May
14
comment Generating functions for combinatorics
A good point. But there are worse publishers to give your money to than A K Peters.
May
14
comment A simple problem about partition function and Young diagram
Nicolas: you're on the right track.
May
14
answered A simple problem about partition function and Young diagram
May
14
comment Intuitive understanding of why the sum of nth roots of unity is $0$
I came here to give this explanation but I see I was beaten to it. Good job.
May
13
awarded  Nice Answer
May
9
comment If you randomly choose a subset of the real line, what is the probability that it will be measurable?
The answer has to be zero. If not, I don't believe in choice.
May
7
answered Variance for summing over distinct random integers
May
6
comment Is there an unambiguous way to define the average (and higher moments) for a probability density on a circle?
@Didier: basically all I know about directional statistics is that they have a Wikipedia article.
May
6
comment Is there an unambiguous way to define the average (and higher moments) for a probability density on a circle?
There exists something called "directional statistics": en.wikipedia.org/wiki/Directional_statistics .
May
6
comment Does another chain of three squares in this manner exist?
See oeis.org/A031150 and oeis.org/A023110, although there doesn't seem to be a huge amount to work with there.
May
5
comment Optimizing the expectancy
That is, what Ross said.
May
5
comment Optimizing the expectancy
Obvious generalization time: for $k$ stations, I'm guessing that the optimal locations are at $1/(2k), 3/(2k), \ldots, (2k-1)/(2k)$, by this same proof but with more variables.
May
4
answered A combinatorial card problem
May
3
comment Is the $\sum\sin(n)/n$ convergent or divergent?
How does one prove that formula for the sum? I'm guessing that writing $sin(n) = (e^{in} - e^{-in})/(2i)$ and then following your nose gives the result, but I haven't tried it.
May
3
comment Need a result of Euler that is simple enough for a child to understand
There's a nice bijection between the two, as well, which usually goes under the name of "Glaisher's bijection".