# Tagged Questions

49 views

57 views

### am i cheating in this number theory proof?

the question (from burton's elementary number theory); $verify\ that\ \forall n\ge 1,$ $$2\cdot6\cdot10\cdots(4n-2)=\frac{(2n)!}{n!}$$ my work/proof; this is obviously true for $n=1$, so assume ...
39 views

### Inductive proof of inequality $a\le ab$ for nonnegative integers

I reading about of proof of the claim "If $a \ge 0$ and $b > 0$, then $a \le ab$. (Here $a$ and $b$ are integers.) The proof the author is employing is inductive. I understand the basis case; ...
21 views

68 views

### My first proof that uses the well-ordering principle (very simple number theory). Please mark/grade.

What do you think about my first proof that uses the well-ordering principle? Please mark/grade. Theorem The sum of the cubes of three consecutive natural numbers is a multiple of 9. Proof ...
71 views

### Prove by induction $1 + \frac{1}{2} + \frac{1}{2} + \frac{1}{3} + \ldots + \frac{1}{2^n} \ge 1 + \frac {n}{2}$

Prove by induction $1 + \frac{1}{2} + \frac{1}{3} + \frac{1}{4} + \ldots + \frac{1}{2^n} \ge 1 + \frac {n}{2}$ I can't explain in words how the left hand side of the equation is achieved soI shall ...
48 views

### My first proof employing strong induction / complete induction (very simple number theory). Please mark/grade.

What do you think about my first proof employing strong induction? What mark/grade would you give me? Theorem Every natural number greater than 1 is a product of one or more primes. Proof First, ...
712 views

What do you think about my first induction proof? Please mark/grade. Theorem The sum of the cubes of three consecutive natural numbers is a multiple of 9. Proof First, introducing a predicate ...
41 views

### Proving this property of a tournament graph by induction?

I am working on practicing proofs by induction. Can you please take a look at the proof below and tell me if I proved it correctly? I am particularly worried about the inductive step. Definition ...
59 views

177 views

### basic induction probs

Hello guys I have this problem which has been really bugging me. And it goes as follows: Using induction, we want to prove that all human beings have the same hair colour. Let S(n) be the ...
83 views

### Prove by induction that $n < 2 ^n$ where $n \in \mathbb{N}$ [duplicate]

Example question in a textbook that I don't understand. Proof works for n = 1 Setting for k makes $k < 2^k$ Setting for k + 1 makes $k+1 < 2^{k+1}$. Here, I would be stuck, the book ...
75 views

### Prove that $1^2-2^2+3^2-…+(-1)^{n-1} n^2$=$(-1)^{n-1}\frac{ n(n+1)}{2}$ whenever n is a positive integer using mathematical induction.

I am wondering if the third to last equation is correct, where i factored out the $(-1)^k$. The first term is inside the parenthesis is $(-1)^{-1}$. Is this correct? If I multiply it out again,, wont ...
6k views

### Proof by induction: $2^n > n^2$ for all integer $n$ greater than $4$ [duplicate]

I am a CS undergrad and I'm studying for the finals in college and I saw this question in an exercise list: Prove, using mathematical induction, that $2^n > n^2$ for all integer n greater than ...
1k views

### Strong Induction Proof: Fibonacci number even if and only if 3 divides index

The Fibonacci sequence is defined recursively by $F_1 = 1, F_2 = 1, \; \& \; F_n = F_{n−1} + F_{n−2} \; \text{ for } n ≥ 3.$ Prove that $2 \mid F_n \iff 3 \mid n.$ Proof by Strong Induction : ...
918 views

### The cardinality of the power set with $N$ elements is equal to $2^N$ [duplicate]

Let $\mathcal{P}(X_N)$ be the power set of a set $X$ with $N$ elements. I am trying to prove by induction that its cardinality $\mid \mathcal{P}(X_N) \mid = 2^N$. Firstly, I think it helps to ...
364 views

### Prove that $1^3 + 2^3 + \cdots + n^3 < n^4$.

I am trying to prove the following: $1^3 + 2^3 + \cdots + n^3 < n^4$ if $n \in \mathbb{N}, n>1$ by induction. From there, I am to prove that the sum is $< \frac{n^4}{2}$ if $n>2$. My ...
91 views

### Critique on a proof by induction that $\sum_{i=1}^n i^2= n(n+1)(2n+1)/6$?

I need to make the proof for this 1:$$1^2 + 2^2 + 3^2 + ... + n^2=\frac{(n(n+1)(2n+1))}{6}$$ By mathematical induction I know that, If P(n) is true for $n>3^2$ then P(k) is also true for k=N and ...
284 views

### What is wrong with my induction proof?

The Fibonacci sequence is defined by $a_1 = 1, a_2 = 1$ and for all $n \ge 2, a_{n+1} = a_n + a_{n-1}$. Thus the sequence begins $$1,1,2,3,5,8,13,21,...$$ prove that for all \$n \ge 1, a_n < ...