To prove that all positive integers less than 4 are prime numbers, we will use the method of exhaustive proof.
Proof by contradiction is a method that establishes the the validity of a proposition, by assuming the proposition to be false leads to a contradiction.
Trivial Proof implies that if q is true then p → q is true regardless of the
truth value of p.
Proof by Induction is a method for proving that a statement P(n) is true for every natural number n
Finally, Proof by exhaustion, also known as proof by cases, is a method of proof in which the statement to be proved is split into a finite number of cases, and each type is then checked to see if the proposition in question holds.
Here, as we can see, by definition, exhaustive proof will be most appropriate as we can easily split the statement into 3 cases, taking the integers 1, 2 and 3 in each.
Thus, we will use Exhaustive Proof.
Learn more about proofs here-
https://brainly.com/question/24672369
#SPJ4
