University of Illinois at 
Urbana-Champaign

Math 118. A Mathematical World
Section X1
Fall 2006

Instructor
Zoi Rapti
366 Altgeld Hall
Phone: (217) 333-6625
Email: zrapti@math.uiuc.edu

Instructor's Office Hours: M 5:00-6:30 PM.

Section X1 meets: MWF 12:00-12:50 PM in 140 Henry Building.

Text and Study Guide
"For All Practical Purposes: Introduction to Contemporary Mathematics", 7th ed., W.H. Freeman and Company, NY, NY, 2000, ISBN 0-7167-4783-9.

Course Description
Introduction to selected areas of mathematical sciences through application to modeling and solution of problems involving networks, circuits, trees, game theory, symmetry and tilings, and geometric growth. The material will be taken from units I through VI in the text.

Prerequisite
Three years of high school mathematics, including two years of algebra and one year of geometry.

Make-Up Policy

Grading Policy
Your grade will be based on homework, quizzes, three hour exams and the final exam. Your work should be readable and organized. All work must be shown-a bare answer is not enough.
Homework: 10%
Quizzes: 15%
Hour Exams 45%, (15% each)
Final Exam 30%

Exams
Exam 1: 12:00-12:50 PM, Friday, September 29
Exam 2: 12:00-12:50 PM, Friday, October 27
Exam 3: 12:00-12:50 PM, Friday, December 1
Final Exam: 7:00-10:00 PM, Tuesday, December 12, Room 138 Henry Administration Building.

Quizzes
A short quiz will be given weekly- unless an exam is scheduled on that week. The lowest quiz score will be dropped at the end of the semester. The first quiz will be on Friday, September 1.

Homework
A number of problems will be assigned each week to be handed in. No late homework will be collected or graded. At the end of the semester the three lowest homework scores will be dropped.
HW1 due 09/01/06: Chapter 1, pages 25-33, problems 7, 11, 12, 21, 24, 30, 32, 33, 34.
HW2 due 09/11/06: Chapter 1, pages 25-33, problems 43, 44, 47, 50 and Chapter 2, pages 64-77, problems 6b, 7, 17a.
HW3 due 09/18/06: Chapter 2, pages 64-77, problems 24, 26, 33, 40, 44.
HW4 due 09/27/06: Chapter 2, pages 64-77, problems 51d, 54, 67, 68 b, 69 a, 75.
HW5 due 10/09/06: Chapter 3, pages 110-122, problems 5, 6, 9, 12, 19, 29, 37 a, b and c.
HW6 due 10/20/06: Chapter 3, pages 110-122, problems 44, 46, 58, 64a, 67, 76.
HW7 due 10/30/06: Chapter 15, pages 584-588, parts a and b only for problems 2 through 5, problems 6, 10, 19.
HW8 due 11/13/06: Chapter 15, pages 584-588, problems 20, 21, 24, 26, 29.
HW9 due 11/29/06: Chapter 19, pages 743-752, problems 4, 13, 17, 19, 21, 26, 27, 28, 31.

Scores
to check your scores click here and then select 'Score reports'.

Other Announcements
The coordinator for this class is A. Ahlgren.

On Friday, December 1, you'll take the 3rd test. It will cover sections 15.3- 15.5, and Chapter 19. There will be a review for the test on Thursday 11/30 from 5 to 6 pm in room 345 AH. HW problems that will be covered but have not been assigned, are # 34, 35, 40 parts abc, 51, 53, 59 and 63 (pages 748-752).

Final Exam : 7:00-10:00 pm, Tuesday, December 12, Room 138 Henry.
Review: Friday, December 8, 12:00 - 12:50pm, room 140 Henry.
Coverage : Chapters 1-3, 15, 19 and 20.
Topics : graphs, circuits, euler circuits, eulerization, chinese postman problem, hamiltonian circuits, traveling salesman problem, minimum-cost hamiltonian circuits, fundamental principle of counting, nearest-neighbor algorithm, sorted-edges algorithm, kruskal's algorithm, critical path analysis, trees, minimum-cost spanning tree, list-processing algorithm, ready tasks, critical-path scheduling, independent tasks, decreasing-time-list algorithm, bin-packing, vertex coloring, chromatic number, resolving conflict via coloring, first fit, first fit decreasing, next fit, next fit decreasing, worst fit, worst fit decreasing, priority list, order requirement digraph, chicken game, prisoner's dilemma, constant-sum games, dominant and dominated strategies, expected values, fair games, maximin, minimax, pure and mixed strategies, nash equilibria, partial and total conflict games, payoff matrix, saddlepoints, status-quo paradox, variable-sum and zero-sum games, sincere and sophisticated voting, value of a game, golden ratio, fibonacci numbers, generator, geometric mean, all rigid motions, groups, rosette, strip and wallpaper patterns, strip and rosette pattern notation, tiling, edge-to-edge tiling, exterior and interior angles, monohedral tilings, polygons and regular polygons, regular and semiregular tilings, vertex figures, periodic tilings, using traslations and half-turns to tile.
Problems : all the assigned problems, the review problems for the 3rd test, and problems 1, 2, 3, 10, 12, 18, 19, 24, 27, 28, 29, 30 (pages 785 - 791).

Bonus Material
Fleury's Algorithm for Finding Euler Circuits
Chromatic Numbers of Various Graphs