Base case: n=1
2^1 < 3^1, we confirmed that 2^n < 3^n holds for the base case n=1.
Induction:
If 2^n < 3^n, then 2^(n+1) < 3^(n+1), for positive integer n
2^(n+1) = 2^n * 2, 3^(n+1) = 3^n * 3
2^n < 3^n, therefore 2^n * 2 < 3^n * 2
3^n * 3 can be re-written as 3^n * 2 + 3^n.
We know 3^n > 0, and 2^n * 2 < 3^n * 2.
So 2^n * 2 < 3^n * 2 + 3^n still holds true.
Because we proved that 2^n < 3^n with our base case n=1.
We also proved If 2^n < 3^n, then 2^(n+1) < 3^(n+1).
Therefore, 2^n < 3^n is true for any integer n >= 1.
You need to have both the base case and induction.
The base case determines the lower limit of your answer (if you picked n=2 as your base case, your answer becomes 2^n < 3^n is true for any integer n >= 2, even though it's very easy to prove that it is true for n=1).
The induction part has the form of "If (equation involving n) then (equation involving n+1)". "If" is crucial for the induction step, and proving "(equation involving n)" is true with the base case is also crucial because "If false then true/false" is also true and we don't want that.