# Analysis of Algorithms 2.1

 Inductive Reasoning Drawing a conclusion based on experience. Deductive Reasoning To verify the truth of falsity of a conjecture. Counterexample To disprove a conjecture, such as "P implies Q" where in this case P is True but Q is False. Factorial The products of 1 up to and including a given integer. Proof by Exhaustion A situation in which all possible cases have been exhausted. Direct Proof In a conjecture such as "P implies Q," assume the hypotheses P and deduce the conclusion Q. Even Number A number that is an integral multiple of 2. Odd Number A number 1 more than an integral multiple of 2. Contrapositive In a conjecture such as "P implies Q," would be "not Q implies not P." Proof by Contraposition To prove a conjecture in the form of "P implies Q" by doing a direct proof of "not Q implies not P." Proof by Cases A form of exhaustive proof. Authoreaavendano ID121773 Card SetAnalysis of Algorithms 2.1 DescriptionProof Techniques Updated2011-12-08T06:06:08Z Show Answers