From 323ba95313391508b7c8e678845c9c6603f3536d Mon Sep 17 00:00:00 2001
From: joshuab <>
Date: Sun, 11 Jul 2010 19:56:14 +0000
Subject: d

---
 ClassJune28.page | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/ClassJune28.page b/ClassJune28.page
index f2b1c23..40799dc 100644
--- a/ClassJune28.page
+++ b/ClassJune28.page
@@ -24,7 +24,7 @@ A set is called countable if it has the same cardinality as the natural numbers,
 
 Cardinality holds some surprises, though. For example, there are as many pairs of natural numbers as there are natural numbers; the set $\mathbb{N}\times\mathbb{N}$ is countable. They can be enumerated by following the zig-zag path through the cartesian grid of pairs below.
 
-![alt text](/orderedpairs.0.png)
+![](/orderedpairs.0.png)
 
 1-->0.
 ## Proof that no. of available functions is greater than number of functions required to define the periodic function
-- 
cgit v1.2.3