Results 1 to 1 of 1

Math Help - Reduce the sequence..or how to calculate it efficiently

  1. #1
    Newbie
    Joined
    Jul 2012
    From
    Palwal
    Posts
    1

    Reduce the sequence..or how to calculate it efficiently

    Sequence is
    (in Summation notation)
    SUMMATION[from k=0 to k=floor(n/2)] (n-k)C(k) * 2(n-k-1)
    refer to this image
    http://i.snag.gy/tFI7e.jpg
    after expanding it becomes
    (n)C(0)*2(n-1) + (n-1)C(1)*2(n-2) + (n-2)C(2) * 2(n-3) +....

    I want to calculate the value of function for a large value of n(up to
    1010, and ans is to be found MODULUS to some prime number..like
    1010+7).

    Please simplify the series if possible or let me know the way how to
    solve it efficiently.
    Attached Thumbnails Attached Thumbnails Reduce the sequence..or how to calculate it efficiently-function.jpg  
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Evaluate efficiently
    Posted in the Differential Geometry Forum
    Replies: 1
    Last Post: September 18th 2011, 01:02 AM
  2. Reduce
    Posted in the Discrete Math Forum
    Replies: 2
    Last Post: October 25th 2010, 12:21 PM
  3. [SOLVED] Computing efficiently
    Posted in the Math Topics Forum
    Replies: 7
    Last Post: September 5th 2010, 12:09 AM
  4. divide an area efficiently
    Posted in the Geometry Forum
    Replies: 2
    Last Post: September 6th 2009, 07:20 AM
  5. Replies: 5
    Last Post: May 27th 2009, 04:36 PM

Search Tags


/mathhelpforum @mathhelpforum