Site hosted by Angelfire.com: Build your free website today!
« November 2008 »
S M T W T F S
1
2 3 4 5 6 7 8
9 10 11 12 13 14 15
16 17 18 19 20 21 22
23 24 25 26 27 28 29
30
Entries by Topic
All topics  «
Blog Tools
Edit your Blog
Build a Blog
RSS Feed
View Profile
You are not logged in. Log in
My Blog
Thursday, 18 October 2007
math review paper thingy.

Monday, October 22 – Historical Mathematician Papers / Presentations are due.

Attendance is mandatory!  Failure to attend class will result in a deduction of 50 points.

 

Friday, October 19 – Test 2

You are allowed to bring 1 8.5” x 11” sheet of paper with anything written on it and a calculator.

Below is a brief review of topics and homework covered for this test.

 

The test covers chapters 5 and 10, more specifically 5.1 – 5.5 and 10.1 – 10.5.

 

The assigned homework for these chapters is:

5.1 – Set 1 (omit #20 – 22)

5.2 – Set 1

5.3 – Set 1

5.4 – Set 1 #1 – 5

- Set 2

5.5 – Set 1

 

10.1 – Sets 1 & 2

10.2 – Set 1

10.3 – Set 1 #1 – 10 and #15 – 22

   - Set 2 #4 – 7

10.4 – Set 1 #6 – 10

         - Set 2

 

 

Topics covered:

 

5.1 – Rotational and line symmetries (when various figures have them, e.g. 5.1 Set 1 #23-30)

5.2 – Regular Polygons (n-sided)

            Know the names of the most popular (n = 3, 4, 5, 6, 8, 10, 12)

            Internal (mirror) angles and external angles

5.3 – Regular and Semi-regular Mosaics

            What determines when a regular polygon can be used to form a mosaic (e.g. 5.3 Set 1 #4-9)

5.4 – Regular Polyhedra

            How many are there?  What are their names? What is the Euler Characteristic (relating V, F, and E)?

5.5 – Semi-regular Polyhedra

            How do they differ from regular polyhedra?

 

10.1 – What is a simple closed curve?

            When are two figures topologically equivalent (as it applies to graphs)?

            What is the Euler Characteristic of a graph (relating V, E, and R)?

10.2 – Graphs (Networks)

            What is the degree of a vertex?

10.3 – Eulerian and Hamiltonian Paths

            What are they?

            When does a graph have an Eulerian Path?

10.4 – Trees

            What is the diameter of a tree?

 


Posted by tkorulesdaworld at 2:54 AM EDT
Post Comment | Permalink | Share This Post

Newer | Latest | Older