Which of the following is an example of a proof by contradiction?
-
A
Assuming P is true and deriving Q directly
-
B
Assuming ¬P and showing this leads to a logical impossibility
-
C
Proving P true for a base case and an inductive step
-
D
Testing P for several specific values of n