Instructor: Andres Caicedo. Contact Information: See here. Time: MWF 10:30-11:45 am. Place: Business, Room 204. Office Hours: Th 3-4:30 (starting Jan. 31), or by appointment (email me a few times/dates you have available).

Text: Calculus (Michael Spivak), fourth edn. Publish or Perish, Inc. Here are some reviews.

If you want an additional text to supplement your reading, I suggest Calculus. Whitman College (David Guichard and others). The text is distributed under a Creative Commons license. It can be downloaded from Whitman’s page. You may also want to consider as an amusing, quick reference, The cartoon guide to Calculus (Larry Gonick).

Contents: The department’s course description reads:

Definitions of limit, derivative and integral. Computation of the derivative, including logarithmic, exponential and trigonometric functions. Applications of the derivative, approximations, optimization, mean value theorem. Fundamental Theorem of Calculus, brief introduction to applications of the integral and to computations of antiderivatives.

We will see some applications, but our emphasis is on understanding the theory. The material to cover is roughly the first 18-and-a-bit chapters of Spivak’s book.

The grade will be decided based on homework, quizzes, and a final exam (20%). The date of the final is Monday, May 13, 12-2 pm. Details of homework and quiz policy will be given in due time.

I post links to supplementary material on Google+. Circle me and let me know if you are interested, and I’ll add you to my Calculus circle.

43.614000-116.202000

Advertisements

Like this:

LikeLoading...

Related

This entry was posted on Wednesday, January 23rd, 2013 at 4:33 pm and is filed under 170: Calculus I. 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 […]