Practice problems with hints and solutions · ProofAnvil Browsing still works.Sign in to use progress, saved problems and private labels. Problem search and previews remain available. Progress labels
IndependentSolved with helpIncorrect / unresolvedDraft in progressNot attemptedReview due
Problem results
ProblemCourse & topicStatus
DM Hasse Cover ExtractionDM Maximal Meet Join Lattice Audit
Sets, functions, relations, and equivalence classesDiscrete Mathematics · Mixed review
—DM Structural Induction FormulasDM Formation Tree Leaf Invariant
Induction, recursion, and invariantsDiscrete Mathematics · Mixed review
—DM Constructive Crt BezoutDM Crt Uniqueness Modulus
Divisibility, modular arithmetic, and elementary number theoryDiscrete Mathematics · Mixed review
—DM Euler Totient Units PermutationDM Rsa Coprime Message Correctness
Divisibility, modular arithmetic, and elementary number theoryDiscrete Mathematics · Mixed review
—DM Surjection Inclusion ExclusionDM Stirling Second Kind Type Audit
Combinatorics and inclusion-exclusionDiscrete Mathematics · Mixed review
—DM Bounded Stars And BarsDM Inclusion Exclusion Generating Function Audit
Combinatorics and inclusion-exclusionDiscrete Mathematics · Mixed review
—DM Burnside Cycle Index DihedralDM Bracelet Listing Chiral Audit
Combinatorics and inclusion-exclusionDiscrete Mathematics · Mixed review
—DM Derangement Inclusion ExclusionDM Derangement Recurrence Consistency
Combinatorics and inclusion-exclusionDiscrete Mathematics · Mixed review
—DM Reflection Principle BarrierDM Catalan Two Formula Audit
Combinatorics and inclusion-exclusionDiscrete Mathematics · Mixed review
—DM Prefix Residue PigeonholeDM Consecutive Block Divisibility
Combinatorics and inclusion-exclusionDiscrete Mathematics · Mixed review
—DM Prufer Encode Decode AuditDM Cayley Count From Word Bijection
Graphs, trees, connectivity, and matchingsDiscrete Mathematics · Mixed review
—DM Euler Trail Exact CriterionDM Hierholzer Splice Certificate
Graphs, trees, connectivity, and matchingsDiscrete Mathematics · Mixed review
—DM Euler Formula Plane InductionDM Bipartite Face Bound Nonplanarity
Graphs, trees, connectivity, and matchingsDiscrete Mathematics · Mixed review
—DM Bipartite Odd Cycle CharacterizationDM Bfs Layer 2color Certificate
Graphs, trees, connectivity, and matchingsDiscrete Mathematics · Mixed review
—DM Kirchhoff Cofactor ArithmeticDM Weighted Spanning Tree Audit
Graphs, trees, connectivity, and matchingsDiscrete Mathematics · Mixed review
—DM:9919001Mathematical problem title
Logic ProofDiscrete Mathematics Problem Solving
Propositional and predicate logic with proof methodsDiscrete Mathematics · Calculation
—Logic ProofDiscrete Mathematics Problem Solving
Propositional and predicate logic with proof methodsDiscrete Mathematics · Calculation
—Logic ProofDiscrete Mathematics Problem Solving
Propositional and predicate logic with proof methodsDiscrete Mathematics · Calculation
—Logic ProofDiscrete Mathematics Problem Solving
Propositional and predicate logic with proof methodsDiscrete Mathematics · Calculation
—Logic ProofDiscrete Mathematics Problem Solving
Propositional and predicate logic with proof methodsDiscrete Mathematics · Calculation
—Logic ProofDiscrete Mathematics Problem Solving
Propositional and predicate logic with proof methodsDiscrete Mathematics · Calculation
—Logic ProofDiscrete Mathematics Problem Solving
Propositional and predicate logic with proof methodsDiscrete Mathematics · Calculation
—Logic ProofDiscrete Mathematics Problem Solving
Propositional and predicate logic with proof methodsDiscrete Mathematics · Calculation
—Logic ProofDiscrete Mathematics Problem Solving
Propositional and predicate logic with proof methodsDiscrete Mathematics · Calculation
—Showing 24 of 315 matching problems.
A six-set inclusion order has two peaks and a missing join
Formation trees keep one more atom than binary connective
Three coprime clocks determine a unique residue modulo 504
RSA decryption needs Euler, and Euler needs a coprime message
Six patches onto four queues: the surjection count survives a type audit
Four labs sharing ten hours cannot exceed a per-lab cap
Six-bead two-color bracelets split one chiral necklace pair
The sixth derangement number is 265 by two independent recurrences
A first-touch reflection subtracts the lattice paths that cross the diagonal
Prefix residues force a consecutive block divisible by n
A Prüfer word rebuilds its labeled tree and counts all of them
Hierholzer certifies an Euler trail that Hamiltonicity cannot replace
Four-sided faces make Euler's formula refuse a specified K3,3 BFS two-coloring is the certificate that no odd cycle exists
A Laplacian cofactor enumerates the weighted spanning trees
Let p, q, and r be propositions.
Let p, q, and r be propositions.
Negate the compound proposition (¬p∨q)∧(r→¬q) and simplify the result so that negation… Determine, with a truth table, whether the argument…
Express the English sentence “A student passes the course if and only if the student attends every lecture and…
Let P(x) denote “x is prime” and E(x) denote “x is even”, where the domain of discourse is the set of positive…
Let the domain of discourse be the set of all real numbers.
Let the domain be the set of all people, and let L(x,y) mean “x likes y”.
Let the domain of discourse be the integers.