00990nam a22002057a 450000500170000002000180001704000140003508200170004910000200006624500900008626000360017630000490021233600290026133700300029033800300032052003250035065000280067565000450070365000360074820220914124615.0  a9780495831747  aNabta-Lib40221a511bFKD1 aFerland, Kevin.  aDiscrete Mathematics :bAn Introduction to Proofs and Combinatorics /cKevin Ferland.  aAmerica :bBrooks/ cole,c2009.  aVIII,  632 Pages :bILLustrations ; c26 cm.  2rdacontent atext btxt   2rdamedia aunmediated bn  2rdacarrier avolume bnc   aSuitable for one- or two-semester courses and for students who are typically mathematics, mathematics education, or computer science majors. This title teaches student how to write proofs, and focuses on computation and problem solving. It may also be suitable for introductory courses in combinatorics and graph theory.  aMathematics vTextbooks  aComputer sciencevTextbooksxMathematics  a Computer sciencex Mathematics