Discrete math, taught interactively

Discretica

Interactive discrete math for CS students: topics, proof trainer, practice, and browser-native tools.

Start practiceOpen truth tableBrowse topics
7topics
534problems
54formulas
60proof tasks
0 learned0 saved0 practice attempts0% accuracy0 proof checks

Proof trainer

Fill, order, and choose methods

Exercises persist local completion history and mirror the mobile proof modes.

Direct Proof

If n is odd, then n² is odd

Prove: If n is odd, then n² is odd.

Assume n is odd. for some integer k. = 2(2k² + 2k) + 1