## 305 -8. Irreducibility

April 20, 2009

In this lecture I want to present a couple of short results that are nevertheless very useful in practice when trying to show that a given polynomial in ${{\mathbb Q}[x]}$ is irreducible. Of course, we may assume that the polynomial actually has integer coefficients. In this case, it turns out that analyzing whether the polynomial factors over ${{\mathbb Z}[x]}$ suffices.

## 580 -Cardinal Arithmetic

April 20, 2009

Here is a pdf file with the contents of the lectures on cardinal arithmetic. As with the previous chapter, it follows closely the style of the notes. There are fewer typos than in the posts, and once again I made a minuscule tidying up. Please let me know of comments, corrections, and suggestions.