# Tagged Questions

34 views

### Proving by induction, if the base case fails to meet the main condition, what do we do?

I have to determine the number $x$ of subsets with odd cardinalities of a set $S$ and then prove that I'm correct. I determined the number $x$ is obtained using the formula $2^{n-1}$ where $|S| = n$. ...
306 views

### Proof by induction involving inequalities

Problem: If $n$ is a natural number and $n\geq4$, then $3^n \geq 2n^2 + 3n$. (Prove by Induction.) Attempt at solution: 1) Given: $n$ is a natural number, $n \geq 4$. 2) Let $P(n)$ be the statement ...
33 views

### Proof By Induction that $3^{(2^n)} -1$ is divisible by $2^{(n+2)}$ [on hold]

How do I prove the $(n+1)$-th case for this equation?
71 views

### Proper way to make transition from $k$ to $k+1$ in proofs by induction

First off my apologies for asking really simple questions, but I'm having some trouble wrapping my head around proof of induction when trying to prove a statement involving a natural number n holds ...
40 views

### Proving $2^{2n}-1$ is divisible by $3$ for $n\ge 1$

So I decided to use induction. First, I started with my base case, $P(1) = 2^{2(1)}-1=3,$ so it's true. That means if $n = k$ is true, then $n = k+1$ is true also. So, $P(n+1)-P(n)$ would also be ...
51 views

### Show that $f^{[n]}(0)=0$ for all $n=0,1,2…$

Let $$f(x)=\left\{ {\matrix{ {{e^{ - {1 \over {{x^2}}}}},x \ne 0} \cr {0,x = 0} \cr } } \right.$$ Show that $f^{[n]}(0)=0$ for all $n=0,1,2,\cdots$ The proof: First note that for ...
46 views

### Proof of the inequality $F_i<(5/3)^i$ for the Fibonacci numbers

The example states: As an example, we prove that the Fibonacci numbers, F0 = 1, F1 = 1, F2 = 2, F3 = 3, F4 = 5,..., Fi = Fi - 1 + Fi - 2, satisfy Fi < (5/3)i, for all i >= 1. To do this, we ...
83 views

### Prove that $133$ divides $11^{n+1} + 12^{2n−1}$ for all $n > 1$? [duplicate]

I have tried this question so hard but still stuck here. It seems like easily provable if all $n$ are all positive numbers but in this question, the $n$ is bigger than $1$. original question : prove ...
39 views

62 views

38 views

### Proof by induction and inequalities

I am stuck on this question: given $a_1a_2≤(\frac{a_1+a_2}{2})^2$ prove by induction of m that $$a_1a_2...a_p≤(\frac{a_1+a_2+...+a_p}{p})^p$$ where $a_i$ are all positive and real and $p=2^m$ (an ...
44 views

### Proof by Induction for Fundamental Thm of Arithmetic

Use induction to make our proof of the Fundamental Theorem of Arithmetic more rigorous. Recall that $p$ is prime iff for all $a,b\in\mathbb Z:p\mid(ab)$ implies $p\mid a$ or $p\mid b$. Prove that ...
63 views

### Use induction to prove that $2^n$ divides $(2n)!$ for any $n\in\mathbb{Z}_{\geq0}.$ [duplicate]

Use induction to prove that $2^n$ divides $(2n)!$ for any $n\in\mathbb{Z}_{\geq0}.$ How would you do the inductive step for this proof? I have the base case done.
28 views

45 views

### Fibonacci Proof with Induction [duplicate]

$$f(n) = \left\{\begin{matrix} 0 & n=1\\ 1 & n=2\\ f_{n-1} + f_{n-2} & n\geqslant 2\end{matrix}\right.$$ How can I prove by induction that $$f_{n} \geq \left ( 1.5 \right )^{n-1}$$ ...
61 views

62 views

### Proof by induction: $2^n > n$

Base is $2^1 > 1$. Now we assume $2^n > n$ and try to obtain $2^{n+1} > (n+1)$. If I can use $2^n > 1$, I could just add that to $2^n > n$ and get $2^{n+1} > (n+1)$ but I don't ...
233 views

### Can I use Strong Induction to prove graph theory? - Hamilton Path/Tournament Graphs

I am working on the below proof. I am still new to proves so I am wondering if you guys can answer the following questions: 1) Did I use the inductive hypothesis correctly here? (By the inductive ...
34 views

109 views

### is it wrong to do this to solve an induction question

When doing an induction problem is it wrong to simply add the next variable to both sides? for example for all natural numbers $$4+9+14+19....+(5n-1)=\frac{n}{2}(3+5n)$$ assume true for k ...
139 views

### Prove that, for any positive integer n: $(a + b)^{n} \leq 2^{n-1}(a^{n}+b^{n})$

Prove that, for any positive integer n: $(a + b)^{n} \leq 2^{n-1}(a^{n}+b^{n})$ I tried induction theorem, when $n = 1$ it is obviously right. But, say $n=k$, It does not make sense since I cannot ...
### prove by induction: $3 + 5 + 7 + … + (2n+1) = n(n+2)$
Use the principle of mathematical induction to prove that $$3 + 5 + 7 + ... + (2n+1) = n(n+2)$$ for all n in $\mathbb N$. I have a problem with induction. If anyone can give me a little insight ...