# Tagged Questions

66 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 ...
53 views

### How to simplify the formula for $n$th Fibonacci number when $n=2$?

When n is equal to 2 how do I simplify when the $n=2$ is put into the equation below (by the way I have to prove this formula by induction that when n= any number it will equal that number) ...
76 views

### Proof by induction: $n$th Fibonacci number is at most $2^n$

I'm trying to find the proof by induction of the following claim: For all $n\in\mathbb N$, $\operatorname{fibonacci}(n) \le 2^n$ My Proof: Base case: $n = 1$ $\operatorname{fibonacci}(1) \le 2^ 1$ ...
68 views

### Introductory Induction Proof

I am in currently in a discrete mathematics class, and I've done well on every problem I've encountered. Unfortunately, I find myself weak at some of the seemingly straight forward induction problems. ...
56 views

### Induction on GCD problem [duplicate]

This is a two part question Given $\gcd(a,b) = 1$ consider $$\gcd \left( \frac{a^n - b^n }{a-b}, a- b\right)$$ It appears that the value of this is always equal to $n$ or $1$. How to prove it? ...
71 views

### Prove that $(2n+1)+(2n+3)+\dots +(4n-1) = 3n^2$ by induction

Note: This is for self study, the book is Elementary analysis by Kenneth. A. Ross How to prove the following by mathematical induction, I am stuck
26 views

### Expanding Base 2B representation of an integer

Consider an integer$L$ written in Base 2B which digits $$a_n a_{n-1} a_{n-2} ... a_1 B$$ Where $a_i$ are arbitrary constants such that $9 \le a_i < 2B$. I am attempting to prove that the square ...
277 views

### The largest integer less than $n$ is $n-1$

Let $n$ be a positive integer. Prove that the largest integer which is less than $n$ is $n-1$. Attempt of a solution: Since $n$ is a positive integer $n>0$. I think I have to use the well-ordering ...
33 views

43 views

### How to proof this: (m is odd ∧ n is odd)⇒ m + n is even

I don't quite understand why I can not proof the following: Assume that n,m ∈ N. Show: (m is odd ∧ n is odd)⇒ m + n is even. With this: Say n, m are odd. Then the remains of (m + n) / 2 is equal to ...
38 views

76 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 ...
31 views

### Induction question help.

Let $x$ and $y$ belong to a commutative ring $R$ with prime characteristic $p$. Show that, for all positive integers $n$ $$(( x + y )^p)^n = (x^p)^n + (y^p)^n$$ I hope you can can understand ...
38 views

### Divisibility proof by induction.

$169$ | $3^{3n+3}-26n-27$ ? Fulfilled for $n=0$. Induction to $n+1$: An integer $x$ exists so that $169x= 3^{3n+6}-26n-27-26$ $169x= 27*3^{3n+3}-26n-27-26$ $169x= 26*3^{3n+3}+3^{3n+3}-26n-27-26$ ...
49 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, ...
726 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 ...
18 views

### Prove that all elements in the set T is divisible by 3 using structural induction.

Let T be the set defined recursively as follows: (1) (0,3) $\in$ T (2) If (x, y) $\in$ T, then (x + 2, y - 1) $\in$ T and (x - 3, y) $\in$ T. (3) Every element of T can be obtained from (1) by ...
49 views

### When is there an $m$ that divides $u^{an+b}+v^{cn+d}$ for all $n$

This is a generalization of Prove by induction? which asks how to prove that $73$ divides $8^{n+2}+9^{2n+1}$for all $n$. Here is my generalization: Find conditions on positive integers $u, a, v, c$ ...
27 views

### Is this divisibility proof by induction correct/sufficient?

To show: 13 | $4^{2n+1}+3^{n+2}$ I used induction beginning successfully with n=0 (or n=1), then making the step to n+1: An x exists so that $13x = 4^{2n+3}+3^{n+3}$ $13x = 16*4^{2n+1}+3*3^{n+2}$ ...
77 views

### Proving divisibility by using induction: $133 \mid (11^{n+2} + 12^{2n+1})$ [duplicate]

If $n > 0$, then prove the following by using induction: $$133|(11^{n+2} + 12^{2n+1}).$$
89 views

### Prove by induction that for all $n$, $8$ is a factor of $7^{2n+1} +1$

I want to prove by induction that for all $n$, 8 is a factor of $$7^{2n+1}+1$$ I have proved it true for the base case and assumed it true for $n=k$, but when I cannot figure out when to go towards ...
31 views

### I'm not sure if my subscripts are lining up correctly in this elementary number theoretic induction proof

First, the motivation for the below lemma is to use in a proof that every number has a unique representation in a base. My question is that when using the inductive hypothesis, I'm not sure if my ...
108 views

### Proving $r!$ divides the product of r succesive positive integers

I have to prove the following theorem: Prove that the product of $r$ consecutive positive integers in divisible by $r!$ I am having a hard time getting a generalization down for the full set of ...
101 views

### Proving that $fib(n) < (5/3)^n$ for $n \ge 1$ by induction

I know this has been shown before here but no post really answered my question. I had this problem given to me as an induction practice problem and I couldn't solve it without help. When I got the ...
46 views

### Proving the base case for a problem in elementary number theory

I have a question about how to prove statements such as the following, using induction: If $p \mid a_1a_2 \cdots a_k$, then $p \mid a_i$ for some $i$, $i = 1, 2, \ldots, k$, where $p$ is prime. ...
125 views

### Prove by induction that $2^{2n} – 1$ is divisible by $3$ whenever n is a positive integer.

I am confused as to how to solve this question. For the Base case $n=1$, $(2^{2(1)} - 1)\,/\, 3 = 1$, base case holds My induction hypothesis is: Assume $2^{2k} -1$ is divisible by $3$ when $k$ is a ...
54 views

### I've got a small problem with induction

Let me take a quick example: We want to prove by induction that $3^n-1$ is a multiple of 2, where n is a positive integer. So we start with our "base case" and show that $3^1-1$ is indeed a multiple ...
43 views

### How Can I find the summation of divisors of $n^p$.

For Example $n=8$ and $p=2$. So $n^p=64$. And the summation of divisors is $1+2+4+8+16+32+64=127$. But the problem arises when $n=10^6$ and $p=10^6$. Remember u can modulus the result by $100$.
111 views

### Stuck while trying to prove $2k^3 \geq (k + 1)^3$…

how can I prove the following: $2k^3 \geq (k + 1)^3$ This is the final part of the elaborate proof for $2^n > n^3$ give $n \geq 10$ I have used induction and end up with: $2^{K+1} > 2k^3$ ...
67 views

### Divisibility Of Positve Integers [closed]

Suppose a,b and c are three positive integers which satisfy the condition that ($a$2+$b$2+$c$2) is divisible by $(a+b+c)$. Prove that there exists infinitely many positive integers $n$ for which ...
48 views