Click here to edit contents of this page.
Click here to toggle editing of individual sections of the page (if possible). Watch headings for an "edit" link when available.
Append content without editing the whole page source.
Check out how this page has evolved in the past.
If you want to discuss contents of this page - this is the easiest way to do it.
View and manage file attachments for this page.
A few useful tools to manage this Site.
See pages that link to and include this page.
Change the name (also URL address, possibly the category) of the page.
View wiki source for this page without editing.
View/set parent page (used for creating breadcrumbs and structured layout).
Notify administrators if there is objectionable content in this page.
Something does not work as expected? Find out what you can do.
General Wikidot.com documentation and help section.
Wikidot.com Terms of Service - what you can, what you should not etc.
Wikidot.com Privacy Policy.
Consider the set of fractions listed in Figure 7.3 on page 165. Let's call this set $F$. Notice that $\mathbb{Q}\subseteq F$ (we're not reducing the fractions in $F$). If we can show that $F$ is countable, then we're done (by Theorem 7.3.4). The general strategy here is to construct a function $f: \mathbb{N}\to F$ that is onto and then appeal to Theorem 7.3.5. Doing this is rather tricky and probably best to do by drawing a picture. Try to find a path through the grid in Figure 7.3 that hits every fraction exactly once. Define $f: \mathbb{N}\to F$ via $f(n)$ is the fraction that you hit on the $n\text{th}$ step in your path.
If you can figure out the path by drawing a picture, I can help you scan it and post it here.