ma111 contemporary mathematics
play

MA111: Contemporary mathematics Jack Schmidt University of Kentucky - PowerPoint PPT Presentation

MA111: Contemporary mathematics Jack Schmidt University of Kentucky December 1, 2015 Entrance Slip (due 5 min past the hour): Can you go through all the doors exactly once? Foy Bed Liv Yard Sun Kit Din Write down the path (labelled by


  1. MA111: Contemporary mathematics Jack Schmidt University of Kentucky December 1, 2015 Entrance Slip (due 5 min past the hour): Can you go through all the doors exactly once? Foy Bed Liv Yard Sun Kit Din Write down the path (labelled by rooms) or explain why there is no such path. Today we introduce routing problems.

  2. Garbage truck route The garbage truck enters and leaves from the right edge. How should it go through the neighborhood so its claw can get all the trash?

  3. The dragon’s tour When I move to a new place, I like to walk through every doorway It loses some newness if I go through a doorway more than once Can I tour the interior doors of the house without repeats? A C E B D F

  4. The dragon’s tour with toilets too When I move to a new place, I need to walk through every doorway I forgot the toilets and closets. Can I tour the interior doors of the house without repeats now? a e A C E b B D F f

  5. On patrol again Can the postal carrier walk every street exactly once They should start and end at the Post Office

  6. These are all the same question Mathematics looks at many different problems and finds the common structure A strategy to win all similar games The truck route has roads that connect intersections The house has doors that connect rooms The postal carrier has roads between intersections The generic has edges between vertices we want to travel over all edges

  7. The house as a graph A simpler picture A C E A C E B D F B D F The connections are the same in both pictures

  8. The house with toilets as a graph A simpler picture a e a e A C E A C E b B D F f b B D F f The connections are the same in both pictures

  9. The postal patrol Here is the city as a graph P

  10. You draw them Draw a graph that can be traced Draw a graph that obviously can’t be traced Draw a graph that can’t be traced, but that might take a 5 yr old a little time to figure out Be prepared to draw at the board!

  11. Can these be traced? C D C B B E W X X A D Z A Z E V W Y V Y

  12. Can these be traced? a2 a1 a1 b a3 a0 a3 a0 a4 a5 a2

  13. Assignments and exit slip Exit slip: Can you go through all the doors exactly once? Foy Bed Liv Yard Sun Kit Din Write down the path (labelled by rooms) or explain why there is no such path.

Recommend


More recommend