Kyuubi
Reputation
Next privilege 250 Rep.
 Jul 11 awarded Notable Question Jul 5 awarded Popular Question Jul 2 awarded Curious Jun 17 awarded Popular Question Feb 25 awarded Tumbleweed Feb 22 comment Generating Function for Recurrence Relation in 2 Variable How would I calculate $H(x,y)$ ? Feb 22 accepted Generating Function for Recurrence Relation in 2 Variable Feb 22 revised Generating Function for Recurrence Relation in 2 Variable added 46 characters in body Feb 22 comment Generating Function for Recurrence Relation in 2 Variable @Henry The recurrence relation that I am trying to solve is actually more complex than the one mentioned in my question. Which is why I am looking for the steps I can take to solve similar questions. Feb 22 asked Generating Function for Recurrence Relation in 2 Variable Feb 20 comment Generating Function and Mean @ShreevatsaR I generated the series using a 2D matrix for S(n,k) and calculated the values. It was forming a series. The nth term of the series was $G'_n(1) = \frac{2 \cdot n}{3}$ Feb 19 comment Generating Function and Mean Yes thats exactly where I understood the question wrong. My only problem now is, How do I compute $G_n(z),\ G_n'(z)\ and \ G_n''(z)$ . I already know $G′n(1)$. Feb 19 comment Generating Function and Mean @the_candyman: Edited the question. Although ShreevastsaR caught what I was looking for before I could finish my edit. Feb 19 revised Generating Function and Mean Question Changed Feb 19 comment Generating Function and Mean @the_candyman : yes it seems I have understood the question wrong Feb 19 asked Generating Function and Mean Aug 10 comment probability of sum of a given set of whole numbers being greater than a certain number Problem sounds exactly like the one in an ongoing contest : codechef.com/AUG13/problems/SHIRO And looking at your other questions, I am very sure its from the contest. Jun 26 accepted Probability of getting 'k' heads with 'n' coins Jun 26 comment Probability of getting 'k' heads with 'n' coins @CalvinLin : Thats what i tried to do with that recurrence relation. Enumerate all k subset. F(i,x,k) is the probability of getting k heads, given x heads have already occurred till coin i. Jun 26 comment Probability of getting 'k' heads with 'n' coins I came up with some thing like F(i, x, k) = Pi * F(i+1, x+1, k) +f(i+1, x, k) for all i from 1 to n-k and F(i,k,k) = Pi