Question

Prove that 1−2+ 2^2 −2^3 +···+(−1)^n 2^n =2^n+1(−1)^n+1 for all nonnegative integers n.

Prove that 1−2+ 2^2 −2^3 +···+(−1)^n 2^n =2^n+1(−1)^n+1 for all nonnegative integers n.

Homework Answers

Answer #1

To calculate the sum we will use G.P.

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
3. Let N denote the nonnegative integers, and Z denote the integers. Define the function g...
3. Let N denote the nonnegative integers, and Z denote the integers. Define the function g : N→Z defined by g(k) = k/2 for even k and g(k) = −(k + 1)/2 for odd k. Prove that g is a bijection. (a) Prove that g is a function. (b) Prove that g is an injection . (c) Prove that g is a surjection.
Prove that for all positive integers n, (1^3) + (2^3) + ... + (n^3) = (1+2+...+n)^2
Prove that for all positive integers n, (1^3) + (2^3) + ... + (n^3) = (1+2+...+n)^2
1. Prove that 21 divides 3n7 + 7n3 + 11n for all integers n. 2. Prove...
1. Prove that 21 divides 3n7 + 7n3 + 11n for all integers n. 2. Prove that n91 ≡ n7 (mod 91) for all integers n. Is n91 ≡ n (mod 91) for all integers n ?
Problem 1. Prove that for all positive integers n, we have 1 + 3 + ....
Problem 1. Prove that for all positive integers n, we have 1 + 3 + . . . + (2n − 1) = n ^2 .
Use Mathematical Induction to prove that 3 | (n^3 + 2n) for all integers n =...
Use Mathematical Induction to prove that 3 | (n^3 + 2n) for all integers n = 0, 1, 2, ....
Prove: If A is an n × n symmetric matrix all of whose eigenvalues are nonnegative,...
Prove: If A is an n × n symmetric matrix all of whose eigenvalues are nonnegative, then xTAx ≥ 0 for all nonzero x in the vector space Rn.
prove that n^3+2n=0(mod3) for all integers n.
prove that n^3+2n=0(mod3) for all integers n.
Exercise 1. Prove that floor[n/2]ceiling[n/2] = floor[n2/4], for all integers n.
Exercise 1. Prove that floor[n/2]ceiling[n/2] = floor[n2/4], for all integers n.
Statement: "For all integers n, if n2 is odd then n is odd" (1) prove the...
Statement: "For all integers n, if n2 is odd then n is odd" (1) prove the statement using Proof by Contradiction (2) prove the statement using Proof by Contraposition
Prove that n − 1 and 2n − 1 are relatively prime, for all integers n...
Prove that n − 1 and 2n − 1 are relatively prime, for all integers n > 1.
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT