| Record ID | ia:conceptsindiscre0000sahn |
| Source | Internet Archive |
| Download MARC XML | https://archive.org/download/conceptsindiscre0000sahn/conceptsindiscre0000sahn_marc.xml |
| Download MARC binary | https://www.archive.org/download/conceptsindiscre0000sahn/conceptsindiscre0000sahn_meta.mrc |
LEADER: 01745cam 2200409 a 4500
001 ocm08236720
003 OCoLC
005 20181016035824.0
008 830323s1981 mnua b 001 0 eng
010 $a 83104061
040 $aDLC$beng$cDLC$dBAKER$dBTCTA$dLVB$dHIL$dLGG$dNIALS$dQE2$dMCW$dOCLCF$dOCLCQ$dI8M$dOCLCQ
020 $a0942450000
020 $a9780942450002
035 $a(OCoLC)8236720
050 00 $aQA39.2$b.S22 1981
082 00 $a510$219
100 1 $aSahni, Sartaj.
245 10 $aConcepts in discrete mathematics /$cSartaj Sahni.
260 $aFridley, Minn. :$bCamelot Pub. Co.,$c℗♭1981.
300 $ax, 437 pages :$billustrations ;$c24 cm
336 $atext$btxt$2rdacontent
337 $aunmediated$bn$2rdamedia
338 $avolume$bnc$2rdacarrier
504 $aIncludes bibliographical references and index.
505 0 $aLogic -- Constructive proofs and mathematical induction -- Sets -- Relations -- Functions, recursion, and computability -- Analysis of algorithms -- Recurrence relations -- Combinatorics and discrete probability -- Graphs -- Modern algebra -- Appendix A: Symbols -- Appendix B: Algorithmic language.
650 0 $aMathematics.
650 6 $aMathe matiques.
650 7 $aMathematics.$2fast$0(OCoLC)fst01012163
776 08 $iOnline version:$aSahni, Sartaj.$tConcepts in discrete mathematics.$dFridley, Minn. : Camelot Pub. Co., ℗♭1981$w(OCoLC)624472868
938 $aBaker & Taylor$bBKTY$c42.00$d42.00$i0942450000$n0000651574$sactive
938 $aBaker and Taylor$bBTCP$n83104061 //r89
029 1 $aAU@$b000002663996
029 1 $aGBVCP$b024399167
029 1 $aNLGGC$b831529741
029 1 $aNZ1$b4065344
994 $aZ0$bP4A
948 $hNO HOLDINGS IN P4A - 361 OTHER HOLDINGS