Re: (Discrete Math - Induction) 'Formula Differentiation'

On 31 mar, 02:05, quasi <qu...@xxxxxxxx> wrote:
On Sun, 30 Mar 2008 20:48:11 -0700 (PDT), "almeidabati...@xxxxxxx"



<almeidabati...@xxxxxxxxx> wrote:
On 30 mar, 23:45, quasi <qu...@xxxxxxxx> wrote:
On Sun, 30 Mar 2008 18:30:51 -0700 (PDT), "almeidabati...@xxxxxxx"

<almeidabati...@xxxxxxxxx> wrote:
Hi all! I've got this problem in my set:

'1 + 2q + 3q^2 + ... + nq^(n-1) = [1 - (n+1)q^n + nq^(n-1)]/[(1 -
q)^2], q <> 1.

Estabilish [the formula above] by differentiating the expansion of the
formula for the sum of a geometric progression.'

I've been thinkering with this one all day, no clue on how to start.
ANY hints on how the derivative of the sum of terms of a G.P will get
into this are welcome.

(1) Find an antiderivative of the LHS.

(2) Look at the result -- do you recognize it?

(3) Based on the answer to (2), use a known formula to simplify the
result.

(4) Now differentiate the simplified result,

quasi

Hmmmmmm! This algebric trick would never happen to me wouldn't it be
your answer! Thanks a lot!

Just to be sure, the only 'induction' involved in the solution is
finding the derivative of the summation?

Unless you're required to be ultra-formal, there's no need for
induction. Just show the pattern, making clear that it works, term by
term. If you want, you can also show explicitly what happens to the
k'th term, where k is an arbitrary index variable, left undetermined.

quasi

I guess there's no such need, the doubt just arised on me because this
problem is from the Mathematical Induction chapter of my Discrete
Mathematics book. Thanks for the answer.
.

Relevant Pages

  • Re: integer solutions for x_1+x_2+...+x_n = k
    ... Let Pbe the proposition that the number of solutions for n non-negative integers with a sum of k is equal to ... This last sum equality is a known identity about the sum in a Pascal triangle along a diagonal and can be easily be proved using a further mathematical induction on k. ... Thank you Roger. ...
    (comp.soft-sys.matlab)
  • Re: integer solutions for x_1+x_2+...+x_n = k
    ... Let Pbe the proposition that the number of solutions for n non-negative integers with a sum of k is equal to ... This last sum equality is a known identity about the sum in a Pascal triangle along a diagonal and can be easily be proved using a further mathematical induction on k. ... Roger Stafford ...
    (comp.soft-sys.matlab)
  • Re: lattice points question
    ... >>quasi wrote: ... >>sum up to zero, ... The previous argument allows us to expand and rotate away from any set ...
    (sci.math)
  • Re: lattice points question
    ... >quasi wrote: ... >> Does there exist a convex n-gon such that all sides are of equal ... >sum up to zero, ... the boundary of the hexagon is always "turning ...
    (sci.math)
  • Efficient evaluation of a Fourier-like sum
    ... values at which I am interested in evaluating S, ... Obviously by brute force I can evaluate the above sum ... Extra points for hints as to a scheme that can be ... replaced by a dot product. ...
    (sci.math)