Results 1 to 2 of 2

Math Help - This must be impossible (sequence problem)

  1. #1
    Newbie
    Joined
    Dec 2005
    Posts
    2

    This must be impossible (sequence problem)

    I have a numeric sequence:

    u(n)=sum[from k=1 to n](4k-1)*u(n-k)
    u(0)=1

    Is there a function f(x) that satisfies u(n)??? And if so what is it.

    Please help!!!
    Djehuti
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Senior Member
    Joined
    Jun 2005
    Posts
    295
    Awards
    1
    The first thing to do is try a few values. We note that each u(n) is determined by the values u(0),...,u(n-1) so there is a unique solution.

    We find that the first few values are 3, 16, 80, 400, 2000, 10000, ... and that for n > 1 they appear to satisfy u(n) = 16.5^(n-2).

    Now let's put that back into the original. Is it true that 16.5^(n-2) is equal to the sum of (4k-1).16.5^(n-k-2) for k =1..(n-2) plus (4(n-1)-1).3 ?
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. [SOLVED] Integration problem with impossible integral
    Posted in the Calculus Forum
    Replies: 5
    Last Post: October 16th 2010, 05:20 AM
  2. The Impossible Problem
    Posted in the Math Challenge Problems Forum
    Replies: 1
    Last Post: December 4th 2009, 07:36 AM
  3. Impossible Math Problem
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: October 22nd 2009, 03:42 AM
  4. Nearly impossible integration problem!
    Posted in the Calculus Forum
    Replies: 5
    Last Post: October 14th 2009, 08:22 AM
  5. impossible problem =P
    Posted in the Calculus Forum
    Replies: 7
    Last Post: June 6th 2009, 05:17 AM

Search Tags


/mathhelpforum @mathhelpforum