I just learned from the textbook that apparently whether the series

converges is still open, which I find rather surprising. The reference the book lists is the book Mazes for the Mind by Clifford Pickover, St. Martin Press, NY, from 1992, but Dr. Pickover has informed me that he believes the problem is still unresolved; he also discusses it in his book The Mathematics of Oz, Cambridge University Press, 2002. I would be very curious to hear from updates or suggestions, if you have any.

Here is a slightly technical (and very quick, and not particularly deep) observation: The issue seems to be to quantify how small is, when it is small, or more precisely, how sparse the set of values of is for which the sine function is “significantly small.” One could start by looking at so that is small for some , so we are led to consider the standard convergent approximations to , satisfying . This means that is close to, but slightly larger than, and so the question leads us to the problem of how sparse the sequence of numerators of the rational approximations to actually is, something about which I don’t know of any results.

Below I display some graphs for the partial sums of the series. Let . The first graph shows vs. for . In the other graphs, goes up to 300, 1000, and 100000. (Thanks to Richard Ketchersid for the code.) It is not clear to me that the last graph is accurate or that it allows us to draw any conclusions (it certainly seems to suggest that the series converges to a number slightly larger than 30); it may well be that further jumps are beyond the range I chose, or that the approximations Maple uses in its computations are not fine enough to examine very large values of the series.

Notice that examination of just the first few values of would suggest that the series converges to a number near 4.8. In fact, for many “natural” series, the 300-th partial sum gives an accurate approximation of their value. However, as the third graph reveals, a jump suddenly occurs, slightly after we pass the 350-th partial sum. The jump occurs at notice that 355 is very close to an integer multiple of , in fact

Even though the fourth graph does not reveal any further jumps, it is not clear that they won’t occur at certain values of past the 10000 mark.

Advertisements

Like this:

LikeLoading...

Related

This entry was posted on Monday, November 10th, 2008 at 3:55 pm and is filed under 175: Calculus II. You can follow any responses to this entry through the RSS 2.0 feed.
You can leave a response, or trackback from your own site.

Craig: For a while, there was some research on improving bounds on the number of variables or degree of unsolvable Diophantine equations. Unfortunately, I never got around to cataloging the known results in any systematic way, so all I can offer is some pointers to relevant references, but I am not sure of what the current records are. Perhaps the first pape […]

Yes. Consider, for instance, Conway's base 13 function $c$, or any function that is everywhere discontinuous and has range $\mathbb R$ in every interval. Pick continuous bijections $f_n:\mathbb R\to(-1/n,1/n)$ for $n\in\mathbb N^+$. Pick a strictly decreasing sequence $(x_n)_{n\ge1}$ converging to $0$. Define $f$ by setting $f(x)=0$ if $x=0$ or $\pm x_n […]

(1) Patrick Dehornoy gave a nice talk at the Séminaire Bourbaki explaining Hugh Woodin's approach. It omits many technical details, so you may want to look at it before looking again at the Notices papers. I think looking at those slides and then at the Notices articles gives a reasonable picture of what the approach is and what kind of problems remain […]

The description below comes from József Beck. Combinatorial games. Tic-tac-toe theory, Encyclopedia of Mathematics and its Applications, 114. Cambridge University Press, Cambridge, 2008, MR2402857 (2009g:91038). Given a finite set $S$ of points in the plane $\mathbb R^2$, consider the following game between two players Maker and Breaker. The players alternat […]

Yes. This is a consequence of the Davis-Matiyasevich-Putnam-Robinson work on Hilbert's 10th problem, and some standard number theory. A number of papers have details of the $\Pi^0_1$ sentence. To begin with, take a look at the relevant paper in Mathematical developments arising from Hilbert's problems (Proc. Sympos. Pure Math., Northern Illinois Un […]

It is easy to see without choice that if there is a surjection from $A$ onto $B$, then there is an injection from ${\mathcal P}(B)$ into ${\mathcal P}(A)$, and the result follows from Cantor's theorem that $B

Only noticed this question today. Although the selected answer is quite nice and arguably simpler than the argument below, none of the posted answers address what appeared to be the original intent of establishing the inequality using the Arithmetic Mean-Geometric Mean Inequality. For this, simply notice that $$ 1+3+\ldots+(2n-1)=n^2, $$ which can be easily […]

First of all, $f(z)+e^z\ne 0$ by the first inequality. It follows that $e^z/(f(z)+e^z)$ is entire, and bounded above. You should be able to conclude from that.

Yes. The standard way of defining these sequences goes by assigning in an explicit fashion to each limit ordinal $\alpha$, for as long as possible, an increasing sequence $\alpha_n$ that converges to $\alpha$. Once this is done, we can define $f_\alpha$ by diagonalizing, so $f_\alpha(n)=f_{\alpha_n}(n)$ for all $n$. Of course there are many possible choices […]

I disagree with the advice of sending a paper to a journal before searching the relevant literature. It is almost guaranteed that a paper on the fundamental theorem of algebra (a very classical and well-studied topic) will be rejected if you do not include mention on previous proofs, and comparisons, explaining how your proof differs from them, etc. It is no […]