Sarah was presenting. She was analyzing a complex graph theory algorithm for network routing. She moved with confidence, her slides impeccable.
Before submitting any proof, check: ☐ Is the proof type (direct, contrapositive, contradiction, induction) clearly stated? ☐ Are all variables introduced? (“Let (x) be an arbitrary integer…”) ☐ Is each step justified by a definition, axiom, or previous step? ☐ Did I avoid starting with what I need to prove? ☐ Is the concluding sentence present? (“Therefore, (P \to Q) holds.”) Sarah was presenting