Solved

how to solve 1+2*q+3*(q to degree of 2)+....+ n(q to degree of (n-1))

Posted on 2013-05-15
1
218 Views
Last Modified: 2013-05-15
I can see that it is
1+q +q to degree of 2+q to degree of 3+...........................q to degree of (n-1)
q +q to degree of 2+q to degree of 3+...........................q to degree of (n-1)
q to degree of 2+q to degree of 3+...........................q to degree of (n-1)
.............................................................................................................
n(q to degree of (n-1))
0
Comment
Question by:user_n
1 Comment
 
LVL 37

Accepted Solution

by:
TommySzalapski earned 500 total points
ID: 39167898
Start with this:
Let S = 1 + q + q^2 + q^3 + ... + q^(n-1)
Sq =  q + q^2 + q^3 +q^4 + ... + q^(n-1) + q^n

But that looks pretty close to what S was. In fact:

Sq = S + q^n - 1

Now just solve

Sq - S = q^n - 1
S(q-1) = q^n - 1

S = (q^n - 1)/(q-1)

Now do the same type of thing with your equation and remember the result we just got because you will see it pop out.
0

Featured Post

DevOps Toolchain Recommendations

Read this Gartner Research Note and discover how your IT organization can automate and optimize DevOps processes using a toolchain architecture.

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Suggested Solutions

Complex Numbers are funny things.  Many people have a basic understanding of them, some a more advanced.  The confusion usually arises when that pesky i (or j for Electrical Engineers) appears and understanding the meaning of a square root of a nega…
Lithium-ion batteries area cornerstone of today's portable electronic devices, and even though they are relied upon heavily, their chemistry and origin are not of common knowledge. This article is about a device on which every smartphone, laptop, an…
Although Jacob Bernoulli (1654-1705) has been credited as the creator of "Binomial Distribution Table", Gottfried Leibniz (1646-1716) did his dissertation on the subject in 1666; Leibniz you may recall is the co-inventor of "Calculus" and beat Isaac…
Finds all prime numbers in a range requested and places them in a public primes() array. I've demostrated a template size of 30 (2 * 3 * 5) but larger templates can be built such 210  (2 * 3 * 5 * 7) or 2310  (2 * 3 * 5 * 7 * 11). The larger templa…

770 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question