meta user
network profile
| bio | website | synchronicity.sourceforge.net |
|---|---|---|
| location | ||
| age | 21 | |
| visits | member for | 2 years, 1 month |
| seen | Mar 28 at 23:43 | |
| stats | profile views | 26 |
|
Aug 25 |
comment |
Finding a paper by John von Neumann written in 1951 Done, thanks again! |
|
Aug 25 |
accepted | Finding a paper by John von Neumann written in 1951 |
|
Aug 25 |
comment |
Finding a paper by John von Neumann written in 1951 Awesome, thanks! |
|
Aug 25 |
comment |
Which is the “fastest” paper-pencil method to compare $\sqrt[17]{6}$ and $\sqrt[16]{4}$? Note that you were rather lucky here, since sour simplification (using $3^{12} > 2^{12}$) wouldn't always yield a result. Consider for example $3^{13}$ and $2^{14}$ : $ 3^1 < 2^2 $, and yet $3^{13} > 2^{14}$. Thus writing "Now $3^{12}>2^{12}$ and so you need to compare (...)" is not really rigorous (it implies it is necessary, while it is just sufficient); instead I think you should write something like "Now $3^{12}>2^{12}$ and so proving $3^{4}=81 > 2^{6}=64$ would be sufficient". |
|
Aug 25 |
comment |
Finding a paper by John von Neumann written in 1951 Brilliant, thanks Michael. If you'll post your comment as an answer I'll accept it; otherwise I'll mark this one as the accepted answer. How did you find it? Did you directly think of the BNF? |
|
Aug 25 |
comment |
Finding a paper by John von Neumann written in 1951 Thanks mt_, I didn't know librarians did that :) |
|
Aug 25 |
awarded | Editor |
|
Aug 25 |
revised |
Finding a paper by John von Neumann written in 1951 added 467 characters in body |
|
Aug 25 |
comment |
Finding a paper by John von Neumann written in 1951 Thanks. However, NIST archives (nist.gov/nvl/journal-of-research-past-issues.cfm) do not seem to include volume 51, and the largest library of my city (Paris, France) doesn't have it. Perhaps I should have mentioned this. |
|
Aug 25 |
awarded | Yearling |
|
Aug 25 |
asked | Finding a paper by John von Neumann written in 1951 |
|
Mar 19 |
comment |
Recurrence equation for central trinomial coefficients I was hoping for a combinatorial proof actually, one which would involve counting objects or elements. |
|
Mar 19 |
comment |
Recurrence equation for central trinomial coefficients Right, but it surprises me that you need to find an explicit formula for the coefficients before searching for a recurrence equation... +1 anyway. |
|
Mar 18 |
asked | Recurrence equation for central trinomial coefficients |
|
Oct 1 |
awarded | Nice Question |
|
Oct 1 |
comment |
Fun math for young, bored kids? Interesting resource indeed! I'll buy it =) |
|
Oct 1 |
comment |
Fun math for young, bored kids? Quite nice indeed! |
|
Oct 1 |
comment |
Fun math for young, bored kids? @ZevChonoles Thanks! |
|
Oct 1 |
comment |
Fun math for young, bored kids? Thanks for that! Unfortunately, I can't speak German at all (I'm French, and English is my second language) |
|
Oct 1 |
asked | Fun math for young, bored kids? |
