Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I am trying to find the inverse of $(1-t)^s$ in $k[[t]]$. I found out in literature that it should be $\sum\limits_{n \geq 0} \binom{s+n-1}{s-1}t^n$, but I don't see why.

If I expand the element using the binomial theorem, I would have to show that $\sum\limits_{i+j = n} \binom{i+s-1}{i-1}\binom{s}{s-j} = 0$ for $n \geq 0$, but this seems nasty; At least writing out the terms didn't help. Is there a neat proof of this, or maybe a good reference? Thanks!

share|cite|improve this question
up vote 2 down vote accepted

Hint $\ $ Repeatedly differentiate the series for $(1-t)^{-1}$

share|cite|improve this answer
Wow this is really elegant, thank you. I wonder how I could get through my first undergrad year and not see this trick (my question arose from dealing with hilbert-poincaré series) – jonny Mar 19 '12 at 18:51
I learn every time I visit this site – Siddhi V Iyer Mar 19 '12 at 19:40

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.