Question

Prove the following using induction:

(a) For all natural numbers n>2, 2n>2n+1

(b) For all positive integersn, 1^3+3^3+5^3+···+(2^n−1)^3=n^2(2n^2−1)

(c) For all positive natural numbers n,5/4·8^n+3^(3n−1) is divisible by 19

Answer #1

a)

i think you have written something wrong

you wrote

2n> 2n+1

which is clearly wrong, post the correct question again

b)

we check for n= 1

LHS = 1

RHS = 1^2 * (2*1^2 -1) = 1

suppose it is true for n = k

that is 1^3 + 3^3 + .. (2k -1) ^3 = k^2(2k^2−1)

we will show if it is true for n = k, then it is true for n = k+1

now

1^3 + 2^3 + .. (2^k -1)^3 + ((2(k+1) -1))^3 = k^2(2k^2−1) + ((2(k+1) -1))^3

= 2k^4 -k^2 + (2k+1)^3

= 2k^4 -k^2 + 8k^3 + 12 k^2 + 6k+1

= 2k^4 + 8k^3 +11 k^2 + 6k+1

= 2(k^4 + 4k^3 + 6 k^2 + 4k+1) - (k^2 +2k+1)

= 2 (k+1)^4 -(k+1)^2

= (k+1)^2 (2(k+1)^2 -1)

hence it is true for n = k+1

hence proved

similarly do c) part

Please rate

prove that 2^2n-1 is divisible by 3 for all natural numbers n ..
please show in detail trying to learn.

Show by induction that 1+3+5+...+(2n-1) = n^2 for all n in the
set of Natural Numbers

Exercise 6.6. Let the inductive set be equal to all natural
numbers, N. Prove the following propositions. (a) ∀n, 2n ≥ 1 +
n.
(b) ∀n, 4n − 1 is divisible by 3.
(c) ∀n, 3n ≥ 1 + 2 n.
(d) ∀n, 21 + 2 2 + ⋯ + 2 n = 2 n+1 − 2.

. Prove that 2^(2n-1) + 3^(2n-1) is divisible by 5 for
every natural number n.

Prove by induction on n that 13 | 2^4n+2 + 3^n+2 for all natural
numbers n.

Using induction, prove the following:
i.) If a > -1 and n is a natural number, then (1 + a)^n >=
1 + na
ii.) If a and b are natural numbers, then a + b and ab are also
natural

Use the principle of Mathematics Induction to prove that for all
natural numbers 3^(3n)-26n-1 is a multiple of 169.

(10) Use mathematical induction to prove that
7n – 2n is divisible by 5
for all n >= 0.

Show all the steps...
Prove by induction that 3n < 2n for all
n ≥ ______. (You should figure out what number goes in the
blank.)

Prove by induction.
a ) If a, n ∈ N and a∣n then a ≤ n.
b) For any n ∈ N and any set S = {p1, . . . , pn} of prime
numbers, there is a prime number which is not in S.
c) Prove using strong induction that every natural number n >
1 is divisible by a prime.

ADVERTISEMENT

Get Answers For Free

Most questions answered within 1 hours.

ADVERTISEMENT

asked 3 minutes ago

asked 3 minutes ago

asked 9 minutes ago

asked 13 minutes ago

asked 17 minutes ago

asked 17 minutes ago

asked 25 minutes ago

asked 25 minutes ago

asked 29 minutes ago

asked 30 minutes ago

asked 42 minutes ago

asked 55 minutes ago