=====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====

  * http://www.mathsisfun.com/combinatorics/combinations-permutations.html
  * http://mathworld.wolfram.com/Permutation.html
  * http://rosettacode.org/wiki/Permutations



=====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====
  * http://en.wikipedia.org/wiki/De_Morgan's_laws
  * http://planetmath.org/DeMorgansLaws.html
  * http://en.wikibooks.org/wiki/A-level_Computing/AQA/Computer_Components,_The_Stored_Program_Concept_and_the_Internet/Fundamental_Hardware_Elements_of_Computers/De_Morgan's_Laws


=====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====

  * http://www.mathsisfun.com/combinatorics/combinations-permutations.html
  * http://mathworld.wolfram.com/Permutation.html
  * http://rosettacode.org/wiki/Permutations


====Demonstration====

<cli>
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)
</cli>