0708-1300/Homework Assignment 10 - Revision history

Franklin: /* Just for Fun */

2008-02-28T20:59:52Z

Just for Fun

← Older revision		Revision as of 16:59, 28 February 2008
Line 23:		Line 23:
	# In class we have shown that <math>I\times\Delta_p</math>, that is, <math>\Delta_1\times\Delta_p</math>, is a union of <math>\Delta_{p+1}</math>'s in a nice and natural way. Can you show that <math>\Delta_q\times\Delta_p</math> is a union of <math>\Delta_{p+q}</math>'s in a nice and natural way, for general <math>p</math> and <math>q</math>?		# In class we have shown that <math>I\times\Delta_p</math>, that is, <math>\Delta_1\times\Delta_p</math>, is a union of <math>\Delta_{p+1}</math>'s in a nice and natural way. Can you show that <math>\Delta_q\times\Delta_p</math> is a union of <math>\Delta_{p+q}</math>'s in a nice and natural way, for general <math>p</math> and <math>q</math>?
	# Can you show that the <math>p</math>-cube <math>I^p</math> is a union of <math>\Delta_p</math>'s in a nice and natural way?		# Can you show that the <math>p</math>-cube <math>I^p</math> is a union of <math>\Delta_p</math>'s in a nice and natural way?



	[[0708-1300/Just_for_Fun10\|Here]] is a idea for problem 1 but don't look at it until you have think on it for a while.		[[0708-1300/Just_for_Fun10\|Here]] is a idea for problem 1 but don't look at it until you have think on it for a while.

Franklin: /* Just for Fun */

2008-02-28T20:44:42Z

Just for Fun

← Older revision		Revision as of 16:44, 28 February 2008
Line 24:		Line 24:
	# Can you show that the <math>p</math>-cube <math>I^p</math> is a union of <math>\Delta_p</math>'s in a nice and natural way?		# Can you show that the <math>p</math>-cube <math>I^p</math> is a union of <math>\Delta_p</math>'s in a nice and natural way?

	[[~~Here\|~~0708-1300/Just_for_Fun10]] is a idea for problem 1 but don't look at it until you have think on it for a while.		[[0708-1300/Just_for_Fun10\|Here]] is a idea for problem 1 but don't look at it until you have think on it for a while.

Franklin: /* Just for Fun */

2008-02-28T20:44:17Z

Just for Fun

← Older revision		Revision as of 16:44, 28 February 2008
Line 23:		Line 23:
	# In class we have shown that <math>I\times\Delta_p</math>, that is, <math>\Delta_1\times\Delta_p</math>, is a union of <math>\Delta_{p+1}</math>'s in a nice and natural way. Can you show that <math>\Delta_q\times\Delta_p</math> is a union of <math>\Delta_{p+q}</math>'s in a nice and natural way, for general <math>p</math> and <math>q</math>?		# In class we have shown that <math>I\times\Delta_p</math>, that is, <math>\Delta_1\times\Delta_p</math>, is a union of <math>\Delta_{p+1}</math>'s in a nice and natural way. Can you show that <math>\Delta_q\times\Delta_p</math> is a union of <math>\Delta_{p+q}</math>'s in a nice and natural way, for general <math>p</math> and <math>q</math>?
	# Can you show that the <math>p</math>-cube <math>I^p</math> is a union of <math>\Delta_p</math>'s in a nice and natural way?		# Can you show that the <math>p</math>-cube <math>I^p</math> is a union of <math>\Delta_p</math>'s in a nice and natural way?

			[[Here\|0708-1300/Just_for_Fun10]] is a idea for problem 1 but don't look at it until you have think on it for a while.

Drorbn at 16:47, 28 February 2008

2008-02-28T16:47:58Z

@@ Line 1: / Line 1: @@
 {{0708-1300/Navigation}}
 ==Reading==
@@ Line 11: / Line 10: @@
 ==Doing==
-Solve the following problems from Bredon's book, but submit only the solutions of the problems marked with an "S":
+Solve the following problems from Bredon's book, but submit only the solutions of the problems marked with an "S" - problems 1, 2, S3 on pages 176-177, problems S2, 3 on page 182, and problem S5 on page 190.
 Also, solve and submit the following question:
@@ Line 36: / Line 20: @@
 ==Just for Fun==
 [[Image:0708-1300-MaximalTree.png|frame|left|A maximal tree in the 9x9 integer lattice.]]
-A maximal tree is chosen within the edges of the <math>n\times n</math> integer lattice. Show that there are two neigboring points on the lattice whose distance from each other, measured only along the tree, is at least <math>n</math>.
+# A maximal tree is chosen within the edges of the <math>n\times n</math> integer lattice. Show that there are two neigboring points on the lattice whose distance from each other, measured only along the tree, is at least <math>n</math>.

Drorbn at 16:38, 28 February 2008

2008-02-28T16:38:30Z

@@ Line 4: / Line 4: @@
 ==Reading==
 Read, reread and rereread your notes to this point, and make sure that you really, really really, really really really understand everything in them. Do the same every week!
 ==Doing==
 ==Due Date==
@@ Line 11: / Line 35: @@
 ==Just for Fun==

Drorbn at 15:59, 28 February 2008

2008-02-28T15:59:17Z

New page

{{0708-1300/Navigation}}
{{In Preparation}}

==Reading==
Read, reread and rereread your notes to this point, and make sure that you really, really really, really really really understand everything in them. Do the same every week!

==Doing==

==Due Date==
This assignment is due in class on Thursday March 13, 2008.

==Just for Fun==