The problem is: show that $n! \geq 2^{n-1}$ given that $n\geq 1$.

So I started by checking the smallest case $p(1)$ and it evaluated to be true and then I assumed that $p(k)$ for the above given equation was true.

Following those two steps I plugged in $(n+1)$ to prove for the above claim
$(n+1)! \geq 2^{(n+1)-1}$. I’m not entirely sure where to go from here to prove the equation. 

Also in addition to all of this, I was wondering if anyone could provide me with resources to really lock down proofs and practice? Thanks for any and all help in advance