# Discrete Math text before a proof course

Our department has decided to offer a "Discrete Math" course that students would take before their "Intro to Proofs" course. The idea is that the Discrete Math course would focus on the computations and techniques that are used in discrete settings similar to how a typical Calculus I course focuses on the computations and techniques of continuous situations. The problem I'm having in preparing for this course is that every Discrete Math textbook I look at spends a lot of time on proof technique and contains many "Prove that..." exercises.

Question: Does anyone know a Discrete Math textbook that emphasizes computations and applications instead of proof? (Or at least, proof at a level analogous to Calculus I.)

Here is a basic run-down of the topics chosen by the department: Boolean logic, Basic Set Theory, Counting/Combinatorics, Modular Arithmetic, Relations, Graphs/Digraphs (Eulerian Circuits, Hamiltonian Cycles, Dijkstra’s Algorithm), Trees (Minimal Spanning Tree), Sequences (Finite Difference Methods).

Bonus Points: Such a text that allows use of an online homework system (WebAssign, MyMathLab, WeBWorK, etc.)

Edit: The course has only Calculus I as a prerequisite and it will be taken by freshman/sophomore majors in Math or Math Ed.

Update: I've found that the text "Discrete Mathematics" by Dossey, Otto, Spence and Vanden Eynden seems to strike the right balance. However the latest edition is over a decade old and, hence, the internet is rife with solution manuals and the Amazon.com reviews are poor. Does anyone know of a newer/better text similar to this one?

• Just for some further information: who is the class aimed at? What is the expected prior knowledge? Feb 17, 2015 at 17:43
• Good question. I added that info in an edit above. Feb 17, 2015 at 17:52
• An aside: Do you think your department's decision was wise? To me, proofs are easier to understand in discrete math than in, say, linear algebra. Mar 23, 2015 at 0:18