Algebra II

The problem is:Prove that the statement 1/5+1/5^2+1/5^3+...1/5^n=1/4(1-1/5^n) is true for all positive integers n. Write your proof in the space below.

How do I start this? I have looked at the only example in the book but it did not help me.

Any help in this would be great!!

  1. 👍 0
  2. 👎 0
  3. 👁 29
asked by Lucy

Respond to this Question

First Name

Your Response

Similar Questions

  1. Algebra II

    The problem is:Prove that the statement 1/5+1/5^2+1/5^3+...1/5^n=1/4(1-1/5^n) is true for all positive integers n. Write your proof in the space below. How do I start this? I have looked at the only example in the book but it did

    asked by Lucy on April 5, 2008
  2. Algebra II

    In an induction proof of the statement 4+7+10+...+(3n-1)=n(3n+5)/2 the first step is to show that the statement is true for some integers n. Note:3(1)+1=1[3(1)+5]/2 is true. Select the steps required to complete the proof. A)Show

    asked by Jon on December 15, 2007
  3. Math

    Prove that the statement: (1/5)+(1/5^2)+(1/5^3)+...+(1/5^n)=(1/4)(1-1/5^n) is true for all positive integers n. Write your proof in the space below.

    asked by Jon on March 4, 2008
  4. 12th grade

    prove that the statement 1/5+1/5^2+1/5^3 +...+1/5^n=1/4(1-1/5^n) is true for all positive integers n, write your proof in the space below

    asked by Kathryn on September 22, 2010
  5. math

    1)Find the third iterate x3 of f(x)=x2-4 for an initial value of x0=2 A)-4 B)4 C)12 D)-12 I chose C 2)Use Pascal's triangle to expand:(w-x)5 This ones long so I chose w5-5w4x+10w3x3-10w2x4+5wx4-x5 3)Use the binomial Theorem to

    asked by Jon on December 13, 2007
  6. math help please

    Let f:ℤ+ → ℤ+ be the function defined by: for each x ∈ ℤ+, f(x) is the number of positive divisors of x. - find integers m, n, and k so tha f(m)=3, f(n) = 4 anf f(k) = 5 -is f one-to one? Explain, is f unto? prove is it

    asked by excel on March 21, 2014
  7. math

    Let f:ℤ+ → ℤ+ be the function defined by: for each x ∈ ℤ+, f(x) is the number of positive divisors of x. - find integers m, n, nd k so tha f(m)=3, f(n) = 4 anf f(k) = 5 -is f one-to one? Explain, is f unto? prove is it

    asked by excel on March 20, 2014
  8. discrete math

    Let f:ℤ+ → ℤ+ be the function defined by: for each x ∈ ℤ+, f(x) is the number of positive divisors of x. - find integers m, n, nd k so tha f(m)=3, f(n) = 4 anf f(k) = 5 -is f one-to one? Explain, is f unto? prove is it

    asked by excel on March 20, 2014
  9. math induction

    prove the product of 4 consecutive integers is always divisible by 24 using the principles of math induction. Could anyone help me on this one? Thanks in advance! Sure For induction we want to prove some statement P for all the

    asked by zomg on September 14, 2006
  10. Algebra

    A positive integer minus a positive integer is always positive. This statement is sometimes true. For example, 17 – 5 = 12, but 15 – 20 = –5. post five other statements about the addition and subtraction of positive and

    asked by Mary Ann on October 8, 2013

More Similar Questions