Sidebar
opus:fall2012:tedmist1:discretepart3
Table of Contents
discrete Keyword 3
Permutation
Definition
A way, esp. one of several possible variations, in which a set or number of things can be ordered or arranged
References
discrete Keyword 3 Phase 2 Phase 1
De Morgan's Law
Definition
In propositional calculus form: where: *¬ is the negation operator (NOT) *∧ is the conjunction operator (AND) *∨ is the disjunction operator (OR) *⇔ means logically equivalent (if and only if).
References
discrete Keyword 3 Phase 2 Phase 2
Permutation
Definition
A way, esp. one of several possible variations, in which a set or number of things can be ordered or arranged
References
Demonstration
lab46:~$ Enter First Number For Permutation: 3 Enter Second Number For Permutation: 1 Permutation Results: 3! / 1! = 5 (3,1), (2,1), (1,1), (1,3), (1,2)
opus/fall2012/tedmist1/discretepart3.txt · Last modified: 2012/11/29 01:16 by tedmist1
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International
