Problem 1 is Exercise 7.7.64 from the book. It asks to determine the convergence of

There are several ways of approaching this problem.

Method 1: Begin by noting that

and so

can be evaluated by using the substitution so which transforms the integral into

that can be solved with the trig. substitution so and

Now we return to the problem:

We have found the value of the integral, so in particular, it converges.

Method 2: First,

We use comparison for both and

If Since

we have by comparison that is finite.

If Since

we have by comparison that is also finite.

Hence, converges.

Method 3: As before,

The change of variables transforms into

and

which of course is the same as

So all we need to do is to show that converges, and for this we can use comparison, because

and

Problem 2 is an easier version of Exercise 7.7.63 from the book. It asks to determine the convergence of

The problem here is that we cannot find so we are forced to use comparison. A natural thing to try would be to compare with

Since we have

The problem is that has an asymptote at 0. However, we can split the integral as

The first integral is finite, simply because it is the integral of a continuous function on some finite interval, there is nothing improper here. The second converges by comparison with the -integral with

It follows that the whole integral converges.

A slightly different approach is to use limit comparison rather than direct comparison:

It follows that converges because does; and we have to treat

as above. We cannot just compare with (which happens to diverge), because the limit comparison test requires that the functions that we compare are continuous, and is not continuous at 0.

Typeset using LaTeX2WP. Here is a printable version of this post.

43.614000-116.202000

Advertisements

Like this:

LikeLoading...

Related

This entry was posted on Friday, November 13th, 2009 at 2:32 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.

The technique of almost disjoint forcing was introduced in MR0289291 (44 #6482). Jensen, R. B.; Solovay, R. M. Some applications of almost disjoint sets. In Mathematical Logic and Foundations of Set Theory (Proc. Internat. Colloq., Jerusalem, 1968), pp. 84–104, North-Holland, Amsterdam, 1970. Fix an almost disjoint family $X=(x_\alpha:\alpha

At the moment most of those decisions come from me, at least for computer science papers (those with a 68 class as primary). The practice of having proceedings and final versions of papers is not exclusive to computer science, but this is where it is most common. I've found more often than not that the journal version is significantly different from the […]

The answer is no in general. For instance, by what is essentially an argument of Sierpiński, if $(X,\Sigma,\nu)$ is a $\sigma$-finite continuous measure space, then no non-null subset of $X$ admits a $\nu\times\nu$-measurable well-ordering. The proof is almost verbatim the one here. It is consistent (assuming large cardinals) that there is an extension of Le […]

I assume by $\aleph$ you mean $\mathfrak c$, the cardinality of the continuum. You can build $D$ by transfinite recursion: Well-order the continuum in type $\mathfrak c$. At stage $\alpha$ you add a point of $A_\alpha$ to your set, and one to its complement. You can always do this because at each stage fewer than $\mathfrak c$ many points have been selected. […]

Stefan, "low" cardinalities do not change by passing from $L({\mathbb R})$ to $L({\mathbb R})[{\mathcal U}]$, so the answer to the second question is negative. More precisely: Assume determinacy in $L({\mathbb R})$. Then $2^\omega/E_0$ is a successor cardinal to ${\mathfrak c}$ (This doesn't matter, all we need is that it is strictly larger. T […]

Yes, the suggested rearrangement converges to 0. This is a particular case of a result of Martin Ohm: For $p$ and $q$ positive integers rearrange the sequence $$\left(\frac{(−1)^{n-1}} n\right)_{n\ge 1} $$ by taking the ﬁrst $p$ positive terms, then the ﬁrst $q$ negative terms, then the next $p$ positive terms, then the next $q$ negative terms, and so on. Th […]

Yes, by the incompleteness theorem. An easy argument is to enumerate the sentences in the language of arithmetic. Assign to each node $\sigma $ of the tree $2^{

A simple example is the permutation $\pi$ given by $\pi(n)=n+2$ if $n$ is even, $\pi(1)=0$, and otherwise $\pi(n)=n−2$. It should be clear that $\pi$ is computable and has the desired property. By the way, regarding the footnote: if a bijection is computable, so is its inverse, so $\pi^{-1}$ is computable as well. In general, given a computable bijection $\s […]

The question is asking to find all polynomials $f$ for which you can find $a,b\in\mathbb R$ with $a\ne b$ such that the displayed identity holds. The concrete numbers $a,b$ may very well depend on $f$. A priori, it may be that for some $f$ there is only one pair for which the identity holds, it may be that for some $f$ there are many such pairs, and it may a […]

The reflection principle is a theorem schema in ZFC, meaning that for each formula $\phi(\vec x)$ we can prove in ZFC a version of the principle for $\phi$. In particular, it gives us that if $\phi$ holds (in the universe of sets) then there is some ordinal $\alpha$ such that $V_\alpha\models \phi$. It follows from this that (assuming its consistency) $\math […]