DM:010222A six-set inclusion order has two peaks and a missing joinView access optionsDM Hasse Cover ExtractionDM Maximal Meet Join Lattice AuditSets, functions, relations, and equivalence classesDiscrete Mathematics · Mixed review—
DM:010326Formation trees keep one more atom than binary connectiveView access optionsDM Structural Induction FormulasDM Formation Tree Leaf InvariantInduction, recursion, and invariantsDiscrete Mathematics · Mixed review—
DM:010423Three coprime clocks determine a unique residue modulo 504View access optionsDM Constructive Crt BezoutDM Crt Uniqueness ModulusDivisibility, modular arithmetic, and elementary number theoryDiscrete Mathematics · Mixed review—
DM:010424RSA decryption needs Euler, and Euler needs a coprime messageView access optionsDM Euler Totient Units PermutationDM Rsa Coprime Message CorrectnessDivisibility, modular arithmetic, and elementary number theoryDiscrete Mathematics · Mixed review—
DM:010517Six patches onto four queues: the surjection count survives a type auditView access optionsDM Surjection Inclusion ExclusionDM Stirling Second Kind Type AuditCombinatorics and inclusion-exclusionDiscrete Mathematics · Mixed review—
DM:010518Four labs sharing ten hours cannot exceed a per-lab capView access optionsDM Bounded Stars And BarsDM Inclusion Exclusion Generating Function AuditCombinatorics and inclusion-exclusionDiscrete Mathematics · Mixed review—
DM:010519Six-bead two-color bracelets split one chiral necklace pairView access optionsDM Burnside Cycle Index DihedralDM Bracelet Listing Chiral AuditCombinatorics and inclusion-exclusionDiscrete Mathematics · Mixed review—
DM:010520The sixth derangement number is 265 by two independent recurrencesView access optionsDM Derangement Inclusion ExclusionDM Derangement Recurrence ConsistencyCombinatorics and inclusion-exclusionDiscrete Mathematics · Mixed review—
DM:010521A first-touch reflection subtracts the lattice paths that cross the diagonalView access optionsDM Reflection Principle BarrierDM Catalan Two Formula AuditCombinatorics and inclusion-exclusionDiscrete Mathematics · Mixed review—
DM:010525Prefix residues force a consecutive block divisible by nView access optionsDM Prefix Residue PigeonholeDM Consecutive Block DivisibilityCombinatorics and inclusion-exclusionDiscrete Mathematics · Mixed review—
DM:010727A Prüfer word rebuilds its labeled tree and counts all of themView access optionsDM Prufer Encode Decode AuditDM Cayley Count From Word BijectionGraphs, trees, connectivity, and matchingsDiscrete Mathematics · Mixed review—
DM:010728Hierholzer certifies an Euler trail that Hamiltonicity cannot replaceView access optionsDM Euler Trail Exact CriterionDM Hierholzer Splice CertificateGraphs, trees, connectivity, and matchingsDiscrete Mathematics · Mixed review—
DM:010729Four-sided faces make Euler's formula refuse a specified K_{3,3}View access optionsDM Euler Formula Plane InductionDM Bipartite Face Bound NonplanarityGraphs, trees, connectivity, and matchingsDiscrete Mathematics · Mixed review—
DM:010730BFS two-coloring is the certificate that no odd cycle existsView access optionsDM Bipartite Odd Cycle CharacterizationDM Bfs Layer 2color CertificateGraphs, trees, connectivity, and matchingsDiscrete Mathematics · Mixed review—
DM:010731A Laplacian cofactor enumerates the weighted spanning treesView access optionsDM Kirchhoff Cofactor ArithmeticDM Weighted Spanning Tree AuditGraphs, trees, connectivity, and matchingsDiscrete Mathematics · Mixed review—
DM:9919001Let p, q, and r be propositions.View problem statementLogic ProofDiscrete Mathematics Problem SolvingPropositional and predicate logic with proof methodsDiscrete Mathematics · Calculation—
DM:9919002Let p, q, and r be propositions.View access optionsLogic ProofDiscrete Mathematics Problem SolvingPropositional and predicate logic with proof methodsDiscrete Mathematics · Calculation—
DM:9919003Negate the compound proposition and simplify the result so that negation appears only immediately before atomic pro…View access optionsLogic ProofDiscrete Mathematics Problem SolvingPropositional and predicate logic with proof methodsDiscrete Mathematics · Calculation—
DM:9919004Determine, with a truth table, whether the argument is valid.View access optionsLogic ProofDiscrete Mathematics Problem SolvingPropositional and predicate logic with proof methodsDiscrete Mathematics · Calculation—
DM:9919005Express the English sentence “A student passes the course if and only if the student attends every lecture and subm…View access optionsLogic ProofDiscrete Mathematics Problem SolvingPropositional and predicate logic with proof methodsDiscrete Mathematics · Calculation—
DM:9919006Let P(x) denote “x is prime” and E(x) denote “x is even”, where the domain of discourse is the set of positive inte…View access optionsLogic ProofDiscrete Mathematics Problem SolvingPropositional and predicate logic with proof methodsDiscrete Mathematics · Calculation—
DM:9919007Let the domain of discourse be the set of all real numbers.View access optionsLogic ProofDiscrete Mathematics Problem SolvingPropositional and predicate logic with proof methodsDiscrete Mathematics · Calculation—
DM:9919008Let the domain be the set of all people, and let L(x,y) mean “x likes y”.View access optionsLogic ProofDiscrete Mathematics Problem SolvingPropositional and predicate logic with proof methodsDiscrete Mathematics · Calculation—
DM:9919009Let the domain of discourse be the integers.View access optionsLogic ProofDiscrete Mathematics Problem SolvingPropositional and predicate logic with proof methodsDiscrete Mathematics · Calculation—