Record ID | marc_openlibraries_sanfranciscopubliclibrary/sfpl_chq_2018_12_24_run06.mrc:58272100:5508 |
Source | marc_openlibraries_sanfranciscopubliclibrary |
Download Link | /show-records/marc_openlibraries_sanfranciscopubliclibrary/sfpl_chq_2018_12_24_run06.mrc:58272100:5508?format=raw |
LEADER: 05508cgm a2200697Ia 4500
001 ocn703452813
003 OCoLC
005 20171219131231.0
007 vd cvaizu
008 110223s2009 vau720 vleng d
020 $a1598035738$q(DVDs and set)
020 $a9781598035735$q(DVDs and set)
028 42 $a1456$bTeaching Company
028 42 $aPD1456$bTeaching Company
035 $a(OCoLC)703452813
040 $aJQM$beng$cJQM$dTXI$dOCLCF$dOCLCA$dOCLCQ$dUtOrBLW
049 $aSFRA
050 4 $aQA39.3$b.D57 2009
092 $aDVD 511.1$bDISC
245 00 $aDiscrete mathematics$h[videorecording] /$cthe Teaching Company.
260 $aChantilly, VA :$bThe Teaching Company,$c©2009.
300 $a4 videodiscs (720 min.) :$bsound, color ;$c4 3/4 in. +$e1 course guidebook (vi, 148 pages ; 19 cm).
336 $atwo-dimensional moving image$btdi$2rdacontent
337 $avideo$bv$2rdamedia
338 $avideodisc$bvd$2rdacarrier
490 1 $aScience & mathematics
538 $aDVD.
511 0 $aTwenty-four thirty minute lectures by Dr. Arthur T. Benjamin, Professor of Mathematics at Harvey Mudd College.
504 $aCourse workbook includes professor biography, acknowledgments, statement of course scope, lecture outline with suggested readings and questions to consider, timeline, glossary, biographical notes, and bibliography.
520 $aDiscrete mathematics is a subject that--while off the beaten track--has vital applications in computer science, cryptography, engineering, and problem solving of all types. Discrete mathematics deals with quantities that can be broken into neat little pieces, like pixels on a computer screen, the letters or numbers in a password, or directions on how to drive from one place to another. Like a digital watch, discrete mathematics is that in which numbers proceed one at a time, resulting in fascinating mathematical results using relatively simple means, such as counting. This course delves into three of Discrete Mathematics most important fields: Combinatorics (the mathematics of counting), Number theory (the study of the whole numbers), and Graph theory (the relationship between objects in the most abstract sense). Professor Benjamin presents a generous selection of problems, proofs, and applications for the wide range of subjects and foci that are Discrete Mathematics.
505 00 $gPart 1: Disc 1. Lecture 1.$tWhat is discrete mathematics? ;$gLecture 2.$tBasic concepts of combinatorics ;$gLecture 3.$tThe 12-fold way of combinatorics ;$gLecture 4.$tPascal's triangle and the binomial theorem ;$gLecture 5.$tAdvanced combinatorics: Multichoosing ;$gLecture 6.$tThe principle of inclusion-exclusion --$gDisc 2. Lecture 7.$tProofs: Inductive, geometric, combinatorial ;$gLecture 8.$tLinear recurrences and Fibonacci Numbers ;$gLecture 9.$tGateway to number theory: Divisibility ;$gLecture 10.$tThe structure of numbers ;$gLecture 11.$tTwo principles: Pigeonholes and parity ;$g12.$tModular arithmetic: The math of remainders.
505 00 $gPart 2: Disc 3. Lecture 13.$tEnormous exponents and card shuffling ;$gLecture 14.$tFermat's "little" theorem and prime testing ;$gLecture 15.$tOpen secrets: Public key cryptography ;$gLecture 16.$tThe birth of graph theory ;$gLecture 17.$tWays to walk: Matrices and Markov chains ;$gLecture 18.$tSocial networks and stable marriages --$gDisc 4. Lecture 19.$tTournaments and King Chickens ;$gLecture 20.$tWeighted graphs and minimum spanning trees ;$gLecture 21.$tPlanarity: When can a graph be untangled? ;$gLecture 22.$tColoring graphs and maps ;$gLecture 23.$tShortest paths and algorithm complexity ;$gLecture 24.$tThe magic of discrete mathematics.
508 $aProducer, Matt Costanza ; academic content supervisor, Jay Tate ; editors, Dan Shine, Zach Rhodes.
650 0 $aMathematics.
650 0 $aCombinatorial analysis.
650 0 $aBinomial coefficients.
650 0 $aFibonacci numbers.
650 0 $aFactorials.
650 0 $aFermat's last theorem.
650 0 $aNumbers, Prime.
650 0 $aGroups of divisibility.
650 0 $aPublic key cryptography.
650 0 $aMatrices.
650 0 $aMarkov processes.
650 0 $aTrees (Graph theory)
650 0 $aRamsey theory.
650 0 $aComputer science$xMathematics.
700 1 $aBenjamin, Arthur.
710 2 $aTeaching Company.
830 0 $aGreat courses (DVD).$pScience & mathematics.
907 $a.b34512573$b11-10-18$c10-06-17
998 $axav$an4$ap7$ar3$af1aaa$b11-09-17$cm$dg $e-$feng$gvau$h0$i5
907 $a.b34512573$b12-14-17$c10-06-17
980 $a1117 jj
999 $yMARS
994 $aC0$bSFR
998 $ag4$ap1$a(2)r3$af1aaa$b11-09-17$cm$dg$e-$feng$gvau$h0$i5
945 $aDVD 511.1$bDISC$d - - $e12-10-2018 14:18$f0$g0$h12-13-18$i31223123743743$j503$0505$k - - $lx1aaa$n4 DISC + BOOK$ol$p$39.95$q-$r-$s- $t32$u10$v6$w4$x6$y.i92650399$z11-27-17
945 $aDVD 511.1$bDISC$d11-12-2018 15:51$e08-05-2018 14:25$f1$g0$h10-30-18$i31223123743735$j231$0800$k12-24-18$ln4aaa$n4 DISC + BOOK$ol$p$39.95$q-$r-$s- $t32$u6$v5$w2$x4$y.i92650429$z11-27-17
945 $aDVD 511.1$bDISC$d - - $e09-22-2018 12:20$f0$g0$h11-20-18$i31223123743669$j301$0800$k - - $lp7aaa$n4 DISC + BOOK$ol$p$39.95$q-$r-$s- $t32$u6$v9$w2$x4$y.i92650387$z11-27-17
945 $aDVD 511.1$bDISC$d - - $e10-29-2018 16:45$f0$g0$h10-31-18$i31223123743651$j321$0321$k - - $lr3aaa$n4 DISC + BOOK$ol$p$39.95$q-$r-$sw $t32$u7$v15$w3$x4$y.i92650430$z11-27-17