Question

Prove that 1 + r + r^2 + … + r n = (1 – r^(n...

Prove that 1 + r + r^2 + … + r n = (1 – r^(n +1) )/(1 – r) for all n ∈ N, when r ≠ 1

Homework Answers

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
Exercise1.2.1: Prove that if t > 0 (t∈R), then there exists an n∈N such that 1/n^2...
Exercise1.2.1: Prove that if t > 0 (t∈R), then there exists an n∈N such that 1/n^2 < t. Exercise1.2.2: Prove that if t ≥ 0(t∈R), then there exists an n∈N such that n−1≤ t < n. Exercise1.2.8: Show that for any two real numbers x and y such that x < y, there exists an irrational number s such that x < s < y. Hint: Apply the density of Q to x/(√2) and y/(√2).
Prove that, for all n ∈N, (1 +√2)n ≥ 1 + n√2.
Prove that, for all n ∈N, (1 +√2)n ≥ 1 + n√2.
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.
Question 3. Let a1,...,an ∈R. Prove that (a1 + a2 + ... + an)2 /n ≤...
Question 3. Let a1,...,an ∈R. Prove that (a1 + a2 + ... + an)2 /n ≤ (a1)2 + (a2)2 + ... + (an)2. Question 5. Let S ⊆R and T ⊆R be non-empty. Suppose that s ≤ t for all s ∈ S and t ∈ T. Prove that sup(S) ≤ inf(T). Question 6. Let S ⊆ R and T ⊆ R. Suppose that S is bounded above and T is bounded below. Let U = {t−s|t ∈ T, s...
If kr<=n, where 1<r<=n. Prove that the number of permutations α ϵ Sn, where α is...
If kr<=n, where 1<r<=n. Prove that the number of permutations α ϵ Sn, where α is a product of k disjoint r-cycles is (1/k!)(1/r^k)[n(n-1)(n-2)...(n-kr+1)]
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 by induction that 1-1/2 + 1/3 -1/4 + ... - (-1)^n /n is always...
1) Prove by induction that 1-1/2 + 1/3 -1/4 + ... - (-1)^n /n is always positive 2) Prove by induction that for all positive integers n, (n^2+n+1) is odd.
Use Induction to prove that 1 + 2 + 2^2 +.... + 2^n= 2^(n+1)-1 for n...
Use Induction to prove that 1 + 2 + 2^2 +.... + 2^n= 2^(n+1)-1 for n in N.
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 ?
Define a function s : N → N as follows: s(0)=1 s(n+1)=s(n)+2·(n+1)+1 Prove that s(n)=(n+1)^2 for...
Define a function s : N → N as follows: s(0)=1 s(n+1)=s(n)+2·(n+1)+1 Prove that s(n)=(n+1)^2 for all n∈N. Proof. ?