Direct proof, proof by contradiction, contrapositive, mathematical induction
Day 5 of Discrete Math in 5 Days brings everything together. You'll synthesize what you've built across the week into a complete, working implementation. This is the hardest day — and the most satisfying.
Understanding direct proof is the core goal of Day 5. The concept is straightforward once you see it in practice — most confusion comes from skipping the mental model and jumping straight to implementation. Start with the model, then write the code.
# direct proof — Working Example
# Study this pattern carefully before writing your own version
class directproofExample:
"""
Demonstrates core direct proof concepts.
Replace placeholder values with your real implementation.
"""
def __init__(self, config: dict):
self.config = config
self._validate()
def _validate(self):
required = ['name', 'type']
for field in required:
if field not in self.config:
raise ValueError(f"Missing required field: {field}")
def process(self) -> dict:
# Core logic goes here
result = {
'status': 'success',
'topic': 'direct proof',
'data': self.config
}
return result
# Usage
example = directproofExample({
'name': 'my-implementation',
'type': 'direct proof'
})
output = example.process()
print(output)
induction is the practical application of direct proof in real projects. Once you understand the underlying model, induction becomes the natural next step.
contradiction rounds out today's lesson. It connects direct proof and induction into a complete picture. You'll use all three concepts together in the exercise below.
Extend today's exercise by adding one feature that wasn't in the instructions. Document what you built in a comment at the top of the file. This habit of going one step further is what separates engineers who grow fast from those who stay stuck.