Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Sum_{k=0n} p(k) where p(k) = number of partitions of k

  1. Nov 5, 2012 #1
    Very much a beginner in maths and broadening my horizons. I have a series of polynomials that I was hoping to get some insight into, specifically where to beginning looking re. a method of creating a generating function, as well as some self similar patterns and links that explain them. Any help would be greatly appreciated.

    I think the zipped .doc and .xls attachment lays out the broad strokes.
     

    Attached Files:

  2. jcsd
  3. Nov 8, 2012 #2
    If you haven't done so, take a look at this page. Among other things that might interest you, a generating function is provided there.

    EDIT: Considering the thread title is an exact copy of the title of the series in the link, I guess you have seen it. Dig deeper and you'll find a g.f. :)
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook




Similar Discussions: Sum_{k=0n} p(k) where p(k) = number of partitions of k
  1. 2^k + n (mod p) (Replies: 0)

  2. 2^k = n in Z/p (Replies: 2)

Loading...