| Line 68: | Line 68: | ||
! Topic Number | ! Topic Number | ||
! Topic Description | ! Topic Description | ||
| − | ! Team | + | ! Team Members |
|- | |- | ||
| 1 | | 1 | ||
| − | | Primes numbers in arithmetic progressions | + | | [[Walther375Spring2014 Primes numbers in arithmetic progressions|Prime numbers in arithmetic progressions]] |
| − | | | + | | Names: |
|- | |- | ||
| 2 | | 2 | ||
| − | | Cardinals versus ordinals: size and counting | + | | [[Walther375Spring2014 Cardinals versus ordinals: size and counting|Cardinals versus ordinals: size and counting]] |
| − | | | + | | Names: |
|- | |- | ||
| 3 | | 3 | ||
| − | | P=NP and complexity of algorithms | + | | [[Walther375Spring2014 P=NP and complexity of algorithms|P=NP and complexity of algorithms]] |
| − | | | + | | Names: |
|- | |- | ||
| 4 | | 4 | ||
| − | | Unique factorization: how special are the integers? | + | | [[Walther375Spring2014 Unique factorization: how special are the integers?|Unique factorization: how special are the integers?]] |
| − | | | + | | Names: |
|- | |- | ||
| 5 | | 5 | ||
| − | | Markov chains: what and how? | + | | [[Walther375Spring2014 Markov chains: what and how?|Markov chains: what and how?]] |
| − | | | + | | Names: |
|- | |- | ||
| 6 | | 6 | ||
| − | | | + | | [[Walther375Spring2014 antor's "continuum hypothesis", what is it about?|Cantor's "continuum hypothesis", what is it about?]] |
| − | | | + | | Names: |
|- | |- | ||
| 7 | | 7 | ||
| − | | | + | | [[Walther375Spring2014 lows and cuts in graphs: Menger's theorem|Flows and cuts in graphs: Menger's theorem]] |
| − | | | + | | Names: |
|- | |- | ||
| 8 | | 8 | ||
| − | | How do Hamming codes correct errors? | + | | [[Walther375Spring2014 How do Hamming codes correct errors?|How do Hamming codes correct errors?]] |
| − | | | + | | Names: |
|- | |- | ||
| 9 | | 9 | ||
| − | | Coloring regular polygons: the theorems of Burnside and Polya | + | | [[Walther375Spring2014 Coloring regular polygons: the theorems of Burnside and Polya|Coloring regular polygons: the theorems of Burnside and Polya]] |
| − | | | + | | Names: |
|- | |- | ||
| 10 | | 10 | ||
| − | | Simplicial complexes: higher dimensional versions of graphs | + | | [[Walther375Spring2014 Simplicial complexes: higher dimensional versions of graphs|Simplicial complexes: higher dimensional versions of graphs]] |
| − | | | + | | Names: |
|- | |- | ||
| 11 | | 11 | ||
| − | | Generalizing Kuratowski's theorem: drawing graphs on a doughnut | + | | [[Walther375Spring2014 Generalizing Kuratowski's theorem: drawing graphs on a doughnut|Generalizing Kuratowski's theorem: drawing graphs on a doughnut]] |
| − | | | + | | Names: |
|- | |- | ||
| 12 | | 12 | ||
| − | | What exactly is "1"? Defining integers from scratch. | + | | [[Walther375Spring2014 What exactly is "1"? Defining integers from scratch.|What exactly is "1"? Defining integers from scratch.]] |
| − | | | + | | Names: |
|- | |- | ||
| 13 | | 13 | ||
| − | | How many lines meet 3 given lines in 3-space? | + | | [[Walther375Spring2014 How many lines meet 3 given lines in 3-space?|How many lines meet 3 given lines in 3-space?]] |
| − | | | + | | Names: |
|} | |} | ||
Revision as of 07:47, 3 February 2014
Contents
Rhea Section for MA375: "Discrete Mathematics"
Professor Walther, Spring 2014
Welcome!
Please write [[Category:MA375Spring2014Walther]] at the bottom of each of your pages,
OTHERWISE NO CREDIT !
Course Info
- Instructor: Prof. Walther
- Office: MATH 746
- email: walther at math dot purdue
- Office hours: WRITE OFFICE HOURS HERE
- Book: WRITE BOOK HERE
Important Links
Course Web Page
Discussion
- Discussion of Homework Problems (Just keep adding to it!)
- Spring 2014 Study Group Meetings
Other Links
Your turn! Student Projects
As per the syllabus, 5% of your grade will be based on contributing a Rhea page on a subject related to the course. To pick a subject, simply write your name next to "names". No more than 5 students per topic! Note: don't try to erase other people from a topic. I will know about it.
If you have an idea for another topic that you like, just add a new row and fill it.
Your page will be graded based on content as well as interactions with other people (page views, comments/questions on the page, etc.). The number of links to other courses and subjects will also be taken into account: the more the merrier! Please do not simply copy the lecture notes. What I am looking for is a story in you OWN words, not smart comments by an expert. I want to see you digested the topic, not that you can quote other people on it.
Do not plagiarize. Read Rhea's copyright policy before proceeding.
For some lovely contributions, see Honors Project 2011 by Daniel Lee
Deadline: Sunday before dead week (May 4, 2014)
| Topic Number | Topic Description | Team Members |
|---|---|---|
| 1 | Prime numbers in arithmetic progressions | Names: |
| 2 | Cardinals versus ordinals: size and counting | Names: |
| 3 | P=NP and complexity of algorithms | Names: |
| 4 | Unique factorization: how special are the integers? | Names: |
| 5 | Markov chains: what and how? | Names: |
| 6 | Cantor's "continuum hypothesis", what is it about? | Names: |
| 7 | Flows and cuts in graphs: Menger's theorem | Names: |
| 8 | How do Hamming codes correct errors? | Names: |
| 9 | Coloring regular polygons: the theorems of Burnside and Polya | Names: |
| 10 | Simplicial complexes: higher dimensional versions of graphs | Names: |
| 11 | Generalizing Kuratowski's theorem: drawing graphs on a doughnut | Names: |
| 12 | What exactly is "1"? Defining integers from scratch. | Names: |
| 13 | How many lines meet 3 given lines in 3-space? | Names: |
