5,588 reputation
52040
bio website
location California
age
visits member for 3 years, 5 months
seen 18 hours ago

A mediocre professor at a top-notch university making mediocre contributions to this top-notch community


Apr
5
answered Intermediate Text in Combinatorics?
Mar
31
accepted Expected tail and head length of $\rho$ for a finite random function
Mar
30
revised Expected tail and head length of $\rho$ for a finite random function
added 99 characters in body; added 1 characters in body
Mar
30
awarded  Organizer
Mar
30
revised Why does $a_n = (1+\frac{2}{n})^{n}$ converge to $e^2$?
edited tags
Mar
29
revised Expected tail and head length of $\rho$ for a finite random function
added 22 characters in body
Mar
29
revised Expected tail and head length of $\rho$ for a finite random function
added 112 characters in body; edited body; added 34 characters in body
Mar
29
answered Expected tail and head length of $\rho$ for a finite random function
Mar
28
revised Expected tail and head length of $\rho$ for a finite random function
added 837 characters in body; added 39 characters in body
Mar
28
comment Prove that $n$ is a sum of two squares?
Have you looked at en.wikipedia.org/wiki/Fermat%27s_theorem_on_sums_of_two_squares ?
Mar
28
comment Sum the infinite series $ \sum_{n=0}^\infty (2n^7 + n^6 + n^5 + 2n^2)/n! $
Can you suggest some words that would clearly and politely indicate this? Saying, "By the way, I know the answer" seems awkward; I was hoping that using the "puzzle" tag was sufficient.
Mar
28
asked Expected tail and head length of $\rho$ for a finite random function
Mar
28
comment Sum the infinite series $ \sum_{n=0}^\infty (2n^7 + n^6 + n^5 + 2n^2)/n! $
Sigh, I was aiming at 2011e and overshot via a typo. Cheers for the answer.
Mar
28
accepted Sum the infinite series $ \sum_{n=0}^\infty (2n^7 + n^6 + n^5 + 2n^2)/n! $
Mar
28
asked Sum the infinite series $ \sum_{n=0}^\infty (2n^7 + n^6 + n^5 + 2n^2)/n! $
Mar
27
comment lower bond for $\log(n!)$
The log's in your question are superfluous. You are essentially lower-bounding $n!$. There are very good lower-bounds, notably Sterling's approximation gives $n! > \sqrt{2\pi n}(n/e)^n$.
Mar
25
awarded  Nice Question
Mar
23
accepted What's the best way to factor a 256-bit number?
Mar
23
answered What's the best way to factor a 256-bit number?
Mar
23
comment What's the goal of mathematics?
It's a great way to meet women.