15-344/Homework Assignment 6 - Revision history

Octopusheng: /* Scanned Solution to Homework6 P85 in 5.2, P5 in 5.3 */

2015-12-16T06:47:00Z

Scanned Solution to Homework6 P85 in 5.2, P5 in 5.3

← Older revision		Revision as of 02:47, 16 December 2015
Line 33:		Line 33:
	== Scanned Solution to Homework6 P85 in 5.2, P5 in 5.3 ==		== Scanned Solution to Homework6 P85 in 5.2, P5 in 5.3 ==
	<gallery>		<gallery>
	15-344-HW6-Yunheng Chen\|Page 1		15-344-HW6-Yunheng Chen.jpg\|Page 1
	</gallery>		</gallery>

Octopusheng at 06:46, 16 December 2015

2015-12-16T06:46:27Z

← Older revision		Revision as of 02:46, 16 December 2015
Line 30:		Line 30:

	A solution by student [[Media:15-344-Hw6.pdf\|HW6_Solution]]		A solution by student [[Media:15-344-Hw6.pdf\|HW6_Solution]]

			== Scanned Solution to Homework6 P85 in 5.2, P5 in 5.3 ==
			<gallery>
			15-344-HW6-Yunheng Chen\|Page 1
			</gallery>

Guanyi.lin at 02:53, 16 December 2015

2015-12-16T02:53:02Z

← Older revision		Revision as of 22:53, 15 December 2015
Line 28:		Line 28:

	{{15-344:Dror/Students Divider}}		{{15-344:Dror/Students Divider}}

			A solution by student [[Media:15-344-Hw6.pdf\|HW6_Solution]]

Tonglin at 00:39, 16 December 2015

2015-12-16T00:39:39Z

← Older revision		Revision as of 20:39, 15 December 2015
Line 28:		Line 28:

	{{15-344:Dror/Students Divider}}		{{15-344:Dror/Students Divider}}

	In Problem 85, Section 5.2, we were asked to find the number of triangles formed by pieces of diagonals or outside edges of an n-gon, assuming throughout that no three lines were collinear. What if there is no such constraint? Attached are two papers that presented some general results.

	[https://cs.uwaterloo.ca/journals/JIS/sommars/newtriangle.html 15-344/The Number of Triangles Formed by Intersecting Diagonals of a Regular Polygon]

	[http://www-math.mit.edu/~poonen/papers/ngon.pdf 15-344/The Number of Intersection Points Made by the Diagonals of a Regular Polygon]

Tonglin at 04:25, 13 November 2015

2015-11-13T04:25:22Z

← Older revision		Revision as of 00:25, 13 November 2015
Line 29:		Line 29:
	{{15-344:Dror/Students Divider}}		{{15-344:Dror/Students Divider}}

	In Problem 85, Section 5.2, we were asked to find the number of triangles formed by pieces of diagonals or outside edges of an n-gon, assuming throughout that no three lines were collinear. What if there is no such constraint? Attached are two ~~articles~~ that presented some general results.		In Problem 85, Section 5.2, we were asked to find the number of triangles formed by pieces of diagonals or outside edges of an n-gon, assuming throughout that no three lines were collinear. What if there is no such constraint? Attached are two papers that presented some general results.

	[https://cs.uwaterloo.ca/journals/JIS/sommars/newtriangle.html 15-344/The Number of Triangles Formed by Intersecting Diagonals of a Regular Polygon]		[https://cs.uwaterloo.ca/journals/JIS/sommars/newtriangle.html 15-344/The Number of Triangles Formed by Intersecting Diagonals of a Regular Polygon]

Tonglin at 01:09, 13 November 2015

2015-11-13T01:09:32Z

← Older revision		Revision as of 21:09, 12 November 2015
Line 29:		Line 29:
	{{15-344:Dror/Students Divider}}		{{15-344:Dror/Students Divider}}

	In Problem 85, Section 5.2, we were asked to find the number of triangles formed by pieces of diagonals or outside edges of an n-gon, assuming throughout that no three lines were collinear. What if there if no such constraint? Attached are two articles that presented some general results.		In Problem 85, Section 5.2, we were asked to find the number of triangles formed by pieces of diagonals or outside edges of an n-gon, assuming throughout that no three lines were collinear. What if there is no such constraint? Attached are two articles that presented some general results.

	[https://cs.uwaterloo.ca/journals/JIS/sommars/newtriangle.html 15-344/The Number of Triangles Formed by Intersecting Diagonals of a Regular Polygon]		[https://cs.uwaterloo.ca/journals/JIS/sommars/newtriangle.html 15-344/The Number of Triangles Formed by Intersecting Diagonals of a Regular Polygon]

Tonglin at 01:08, 13 November 2015

2015-11-13T01:08:44Z

← Older revision		Revision as of 21:08, 12 November 2015
Line 28:		Line 28:

	{{15-344:Dror/Students Divider}}		{{15-344:Dror/Students Divider}}

			In Problem 85, Section 5.2, we were asked to find the number of triangles formed by pieces of diagonals or outside edges of an n-gon, assuming throughout that no three lines were collinear. What if there if no such constraint? Attached are two articles that presented some general results.

			[https://cs.uwaterloo.ca/journals/JIS/sommars/newtriangle.html 15-344/The Number of Triangles Formed by Intersecting Diagonals of a Regular Polygon]

			[http://www-math.mit.edu/~poonen/papers/ngon.pdf 15-344/The Number of Intersection Points Made by the Diagonals of a Regular Polygon]

Drorbn at 15:28, 9 November 2015

2015-11-09T15:28:45Z

← Older revision		Revision as of 11:28, 9 November 2015
Line 7:		Line 7:

	Sorry for again posting an assignment a bit late.		Sorry for again posting an assignment a bit late.

			----

			An unrelated matter - I was asked to distribute the following, and I hereby comply:

			Subject: COMC Markers Needed

			We need people to help us mark the 2015 Canadian Open Mathematics Contest. Anyone can help mark (including non-math students so please feel free to pass this message onto your friends and invite them to help too).

			We are having a marking party on November 21 and 22 complete with pizza, pop and other snacks. However we need markers to help the week before and after this as well. Anyone who assists will gain hours towards CCR recognition and certificates are provided to those that wish them.

			If you are able to help please send an email to outreach@math.toronto.edu with "COMC Marker" as the subject and we'll add your name to the list. We're also happy to answer any questions you may have.

			Sincerely,

			Pamela Brittain
			<br/>Outreach and Special Projects Officer
			<br/>Department of Mathematics
			<br/>University of Toronto

	{{15-344:Dror/Students Divider}}		{{15-344:Dror/Students Divider}}

Drorbn at 18:34, 6 November 2015

2015-11-06T18:34:42Z

← Older revision		Revision as of 14:34, 6 November 2015
Line 1:		Line 1:
	{{15-344/Navigation}}		{{15-344/Navigation}}
	{{In Preparation}}
	This assignment is due <span style="color: blue;">at the tutorials on Thursday November 12</span>. Here and everywhere, '''neatness counts!!''' You may be brilliant and you may mean just the right things, but if the teaching assistants will be having hard time deciphering your work they will give up and assume it is wrong.		This assignment is due <span style="color: blue;">at the tutorials on Thursday November 12</span>. Here and everywhere, '''neatness counts!!''' You may be brilliant and you may mean just the right things, but if the teaching assistants will be having hard time deciphering your work they will give up and assume it is wrong.

Drorbn at 17:56, 6 November 2015

2015-11-06T17:56:48Z

← Older revision		Revision as of 13:56, 6 November 2015
Line 5:		Line 5:
	'''Reread''' sections 5.1-5.4 of our textbook. Remember that reading math isn't like reading a novel! If you read a novel and miss a few details most likely you'll still understand the novel. But if you miss a few details in a math text, often you'll miss everything that follows. So reading math takes reading and rereading and rerereading and a lot of thought about what you've read. Also, '''preread''' sections 5.5 and 6.1, just to get a feel for the future.		'''Reread''' sections 5.1-5.4 of our textbook. Remember that reading math isn't like reading a novel! If you read a novel and miss a few details most likely you'll still understand the novel. But if you miss a few details in a math text, often you'll miss everything that follows. So reading math takes reading and rereading and rerereading and a lot of thought about what you've read. Also, '''preread''' sections 5.5 and 6.1, just to get a feel for the future.

	'''Solve''' problems ~~???~~ in section 5.1, problems ~~???~~ in section 5.1, and ~~???~~ but submit only your solutions of the underlined problems.		'''Solve''' problems 4, 8, <u>18</u>, <u>39</u>, <u>46</u>, and 49 in section 5.1, problems 4, 9, 16, 23, <u>31</u>, 38, <u>56</u>, 68, <u>72</u>, and <u>85</u> in section 5.2, and problems <u>5</u>, and 29 in section 5.3, but submit only your solutions of the underlined problems.

			Sorry for again posting an assignment a bit late.

	{{15-344:Dror/Students Divider}}		{{15-344:Dror/Students Divider}}