meta user
network profile
| bio | website | |
|---|---|---|
| location | California | |
| age | ||
| visits | member for | 2 years, 3 months |
| seen | May 20 at 0:04 | |
| stats | profile views | 694 |
A mediocre professor at a top-notch university making mediocre contributions to this top-notch community
|
Apr 9 |
comment |
How many sides does a circle have? @Douglas Zare: C? |
|
Apr 9 |
awarded | Nice Question |
|
Apr 8 |
asked | How many sides does a circle have? |
|
Apr 8 |
comment |
$n=8\log_2(n)$, forgot basic math The best way to do this is write a 10-line program to find the cross-over point: n=2; while (1) { if 2^n > n^8: {print n; exit;} else n++;}. Since the answer is 44, this would run in < 1 msec. |
|
Apr 7 |
comment |
$n=8\log_2(n)$, forgot basic math @Clash: Then you simply want to show that the growth rate of $2^n$ is higher than $n^8$. You can do this from the definition of $O()$, and you certainly don't need Lambert's W function. |
|
Apr 7 |
answered | $n=8\log_2(n)$, forgot basic math |
|
Apr 7 |
comment |
$n=8\log_2(n)$, forgot basic math I'm confused. The Wikipedia link you gave for the W func says $z=W(z)e^{W(z)}$ is the defining equation and asserts that $W(e)=1$. But in your answer you say that $W(x)=z$ iff $z=xe^x$ which implies $W(1)=e$, an inverse of the Wikipedia def. |
|
Apr 6 |
comment |
Good resources (book or otherwise) to learn/study basic Combinatorics Brualdi is decent but so error-ridden that it's annoying to read. That was 15 years ago, however... maybe he's finally cleaned it up in the latest editions. |
|
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 |
