Choose the main technique to prove the following statement:
If n is an integer and 2 \leq n \leq 4 , then n^2 \geq 2^n .

Question

Choose the main technique to prove the following statement: 
 If   n  is an integer and   2 \leq n \leq 4 , then   n^2 \geq 2^n .

Answer

T5: Proof by cases to show    \displaystyle \left(\left(\bigvee_{i=1}^n p_i ight) 	o q ight) \equiv T

Answer

T6: Constructive proof to show   \exists x P(x) \equiv T

Answer

T7: Two-step proof to show   \exists ! x P(x) \equiv T

Answer

T1: Direct proof to show   (p 	o q) \equiv T

Crowdly