Show simple item record

dc.contributor.authorKleitman, Danielen_US
dc.coverage.temporalSpring 2006en_US
dc.date.issued2006-06
dc.identifier18.304-Spring2006
dc.identifierlocal: 18.304
dc.identifierlocal: IMSCP-MD5-0f59190f6bbbe4bba8d047b6b4876075
dc.identifier.urihttp://hdl.handle.net/1721.1/100853
dc.description.abstractThis course is a student-presented seminar in combinatorics, graph theory, and discrete mathematics in general. Instruction and practice in written and oral communication is emphasized, with participants reading and presenting papers from recent mathematics literature and writing a final paper in a related topic.en_US
dc.languageen-USen_US
dc.rights.uriUsage Restrictions: This site (c) Massachusetts Institute of Technology 2016. Content within individual courses is (c) by the individual authors unless otherwise noted. The Massachusetts Institute of Technology is providing this Work (as defined below) under the terms of this Creative Commons public license ("CCPL" or "license") unless otherwise noted. The Work is protected by copyright and/or other applicable law. Any use of the work other than as authorized under this license is prohibited. By exercising any of the rights to the Work provided here, You (as defined below) accept and agree to be bound by the terms of this license. The Licensor, the Massachusetts Institute of Technology, grants You the rights contained here in consideration of Your acceptance of such terms and conditions.en_US
dc.rights.uriUsage Restrictions: Attribution-NonCommercial-ShareAlike 3.0 Unporteden_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/en_US
dc.subjectdiscrete math; discrete mathematics; discrete; math; mathematics; seminar; presentations; student presentations; oral; communication; stable marriage; dych; emergency; response vehicles; ambulance; game theory; congruences; color theorem; four color; cake cutting; algorithm; RSA; encryption; numberical integration; sorting; post correspondence problem; PCP; ramsey; van der waals; fibonacci; recursion; domino; tiling; towers; hanoi; pigeonhole; principle; matrix; hamming; code; hat game; juggling; zero-knowledge; proof; repeated games; lewis carroll; determinants; infinitude of primes; bridges; konigsberg; koenigsberg; time series analysis; GARCH; rational; recurrence; relations; digital; image; compression; quantum computingen_US
dc.subjectdiscrete mathen_US
dc.subjectdiscrete mathematicsen_US
dc.subjectdiscreteen_US
dc.subjectmathen_US
dc.subjectmathematicsen_US
dc.subjectseminaren_US
dc.subjectpresentationsen_US
dc.subjectstudent presentationsen_US
dc.subjectoralen_US
dc.subjectcommunicationen_US
dc.subjectstable marriageen_US
dc.subjectdychen_US
dc.subjectemergencyen_US
dc.subjectresponse vehiclesen_US
dc.subjectambulanceen_US
dc.subjectgame theoryen_US
dc.subjectcongruencesen_US
dc.subjectcolor theoremen_US
dc.subjectfour coloren_US
dc.subjectcake cuttingen_US
dc.subjectalgorithmen_US
dc.subjectRSAen_US
dc.subjectencryptionen_US
dc.subjectnumberical integrationen_US
dc.subjectsortingen_US
dc.subjectpost correspondence problemen_US
dc.subjectPCPen_US
dc.subjectramseyen_US
dc.subjectvan der waalsen_US
dc.subjectfibonaccien_US
dc.subjectrecursionen_US
dc.subjectdominoen_US
dc.subjecttilingen_US
dc.subjecttowersen_US
dc.subjecthanoien_US
dc.subjectpigeonholeen_US
dc.subjectprincipleen_US
dc.subjectmatrixen_US
dc.subjecthammingen_US
dc.subjectcodeen_US
dc.subjecthat gameen_US
dc.subjectjugglingen_US
dc.subjectzero-knowledgeen_US
dc.subjectproofen_US
dc.subjectrepeated gamesen_US
dc.subjectlewis carrollen_US
dc.subjectdeterminantsen_US
dc.subjectinfinitude of primesen_US
dc.subjectbridgesen_US
dc.subjectkonigsbergen_US
dc.subjectkoenigsbergen_US
dc.subjecttime series analysisen_US
dc.subjectGARCHen_US
dc.subjectrationalen_US
dc.subjectrecurrenceen_US
dc.subjectrelationsen_US
dc.subjectdigitalen_US
dc.subjectimageen_US
dc.subjectcompressionen_US
dc.subjectquantum computingen_US
dc.subjectdiscrete mathen_US
dc.subjectdiscrete mathematicsen_US
dc.subjectdiscreteen_US
dc.subjectmathen_US
dc.subjectmathematicsen_US
dc.subjectseminaren_US
dc.subjectpresentationsen_US
dc.subjectstudent presentationsen_US
dc.subjectoralen_US
dc.subjectcommunicationen_US
dc.subjectstable marriageen_US
dc.subjectdychen_US
dc.subjectemergencyen_US
dc.subjectresponse vehiclesen_US
dc.subjectambulanceen_US
dc.subjectgame theoryen_US
dc.subjectcongruencesen_US
dc.subjectcolor theoremen_US
dc.subjectfour coloren_US
dc.subjectcake cuttingen_US
dc.subjectalgorithmen_US
dc.subjectRSAen_US
dc.subjectencryptionen_US
dc.subjectnumberical integrationen_US
dc.subjectsortingen_US
dc.subjectpost correspondence problemen_US
dc.subjectPCPen_US
dc.subjectramseyen_US
dc.subjectvan der waalsen_US
dc.subjectfibonaccien_US
dc.subjectrecursionen_US
dc.subjectdominoen_US
dc.subjecttilingen_US
dc.subjecttowersen_US
dc.subjecthanoien_US
dc.subjectpigeonholeen_US
dc.subjectprincipleen_US
dc.subjectmatrixen_US
dc.subjecthammingen_US
dc.subjectcodeen_US
dc.subjecthat gameen_US
dc.subjectjugglingen_US
dc.subjectzero-knowledgeen_US
dc.subjectproofen_US
dc.subjectrepeated gamesen_US
dc.subjectlewis carrollen_US
dc.subjectdeterminantsen_US
dc.subjectinfinitude of primesen_US
dc.subjectbridgesen_US
dc.subjectkonigsbergen_US
dc.subjectkoenigsbergen_US
dc.subjecttime series analysisen_US
dc.subjectGARCHen_US
dc.subjectrationalen_US
dc.subjectrecurrenceen_US
dc.subjectrelationsen_US
dc.subjectdigitalen_US
dc.subjectimageen_US
dc.subjectcompressionen_US
dc.subjectquantum computingen_US
dc.title18.304 Undergraduate Seminar in Discrete Mathematics, Spring 2006en_US
dc.title.alternativeUndergraduate Seminar in Discrete Mathematicsen_US
dc.typeLearning Object
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mathematics


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record