Questions: Introduction to Discrete Mathematics

Question 1

A calculus student who excels at integrating functions needs to prove: 'For all integers n, if n² is even, then n is even.' What is the core challenge for this student?

• A. Number theory requires more advanced calculus techniques than the student has learned
• B. The problem requires constructing a logical argument — not applying a formula or computing a value
• C. Integers are harder to work with than real numbers because they have no continuous structure
• D. Discrete problems always have harder numerical answers than continuous problems

Answer: (B)

The challenge is not mathematical difficulty in the traditional sense — it is a different kind of task entirely. Proving this statement requires constructing a logical argument (a proof by contrapositive or contradiction) that holds for all integers, not computing any numerical value. A calculus student who succeeded by pattern-matching formulas must shift to a mode of reasoning where 'close enough' does not exist, every step must be logically justified, and no formula will do the work for them.

Question 2

A student says: 'Discrete math is just regular math where we avoid fractions and decimals.' What is fundamentally wrong with this characterization?

• A. It's wrong only because discrete math sometimes does use fractions in probability
• B. Discrete math requires a fundamentally different reasoning style — constructing proofs — not just different number types
• C. The characterization is mostly correct but fails to mention that discrete math includes graph theory
• D. Discrete math is actually more general than calculus, not a restricted special case

Answer: (B)

The misconception is that discrete math is defined by the type of numbers used. In reality, the defining feature is the mode of reasoning: constructing logically airtight arguments rather than computing approximate or limiting values. You will encounter integers, yes, but the hard part is writing proofs — by induction, contradiction, or cases — where every step must be justified. A student who thinks avoiding fractions is the main adjustment will be unprepared for the proof-writing demands.

Question 3

A question like 'How many ways can 5 students be arranged in a row?' has an exact integer answer that requires no approximations or limits.

• T. True
• F. False

Answer: True

True. 5! = 120 exactly. This is what makes it a discrete question: the answer is a precise, finite count, not an approximation. The tools that answer it (combinatorics, permutations) are entirely different from calculus tools. You count arrangements, you don't integrate them. This kind of exact, finite reasoning is characteristic of discrete mathematics across all its pillars.

Question 4

A student who succeeds in calculus by memorizing integration formulas will find the same approach effective in discrete mathematics.

• T. True
• F. False

Answer: False

False. Discrete mathematics is primarily about constructing proofs, not applying formulas. While some formulas exist (e.g., n(n+1)/2 for the sum of the first n integers), the core skill is being able to prove why they are true and to reason from first principles when no formula applies. A student who has never had to justify their steps will find discrete math disorienting at first — and will discover that the reasoning habits it builds are transferable to software correctness, algorithm analysis, and mathematical maturity generally.

Question 5

What does it mean for discrete mathematics to require 'constructing arguments' rather than 'computing answers,' and why does this distinction matter?

Model answer: In calculus, a correct procedure applied correctly yields a numerical answer that can be checked by plugging in values. In discrete math, many results are universal claims ('for all n, ...') or existential claims ('there exists a ...') that cannot be verified by trying examples — you need a proof that covers all cases at once. 'Constructing an argument' means producing a chain of logically valid steps from premises to conclusion, where every step is justified and no case is left unchecked. This matters because the claims of computer science — algorithm correctness, protocol security, data structure invariants — are exactly this kind of universal claim. Discrete math builds the reasoning habits needed to make and verify such claims rigorously.

The contrast with calculus is sharp: computing ∫x² dx = x³/3 + C checks out by differentiation. But proving 'for every graph G, if G has no odd cycles then G is bipartite' requires a different kind of argument — one that covers all possible graphs simultaneously. This is what proof-writing trains, and why discrete math is the mathematical prerequisite for theoretical computer science.