So right now I'm working on a discrete mathematics course and I've been having a bit of trouble figuring out how to prove certain equations using mathematical induction. I have very little trouble understanding how to use mathematical induction to prove equations such as this: $1 + 2 ... + n = \dfrac{n(n+1)}2$ for all integers $n \ge 1$. But when it comes to less straightforward proofs such as the one I am currently working on: "Prove that $2n + 1 \le 2^n$ for $n \ge 3$" give me real trouble. Are there any tips for proofs like this any could share? Any help is greatly appreciated.
Subscribe to:
Post Comments (Atom)
real analysis - How to find $lim_{hrightarrow 0}frac{sin(ha)}{h}$
How to find $\lim_{h\rightarrow 0}\frac{\sin(ha)}{h}$ without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...
-
How can one proof the equality $$\sum\limits_{v=0}^k \frac{k^v}{v!}=\sum\limits_{v=0}^k \frac{v^v (k-v)^{k-v}}{v!(k-v)!}$$ for $k\in\mathbb{...
-
Good evening, I have a question concerning the euclidean algorithm. One knows that for $a_1 , \ldots , a_n \in \mathbb{N} $ and $k\in \mathb...
-
Using mathematical induction, I have proved that $$1+ 5+ 9 + \cdots +(4n-3) = 2n^{2} - n$$ for every integer $n > 0$. I would like to kn...
No comments:
Post a Comment