Focused on helping readers understand and construct proofs – and, generally, expanding their mathematical maturity – this best-seller is an accessible introduction to discrete mathematics. Takes an algorithmic approach that emphasizes problem-solving techniques. Expands discussion on how to construct proofs and treatment of problem solving. Increases number of examples and exercises throughout.
New edition of a time-tested text first published in 1984 in response to a need for a course that extended students' mathematical maturity and ability to deal with abstraction and included useful topics such as combinatorics, algorithms, and graphs. Intended for a one-or two- term introductory course, the text does not require knowledge of calculus, and there are no computer science prerequisites. Annotation c. by Book News, Inc., Portland, Or.