# Given $y$ and $x \choose y$, how to find $x$? [duplicate]

Possible Duplicate:
How to reverse the $n$ choose $k$ formula?

Given integers $y\geq 0$ and $z>0$, is there a good way to find an integer $x\geq y$ such that $z=\binom x y$?

I could just guess and check a few values for x because in practice its range is relatively small but this makes me feel dumb.

-
someone made an edit that makes it seem like i want to solve for x given x ... but on the other hand maybe my original title was not more clear –  binn Sep 2 '12 at 17:34
I've added the question to the body of the post (which is preferable to simply putting it in the title, for future reference), and rephrased it slightly for clarity. Please make certain that I've phrased it in the same way you intended it. –  Cameron Buie Sep 2 '12 at 17:35
I'd just suggest refining guess-and-check to binary search. –  Harry Altman Sep 2 '12 at 17:36
You might want to change the title to something like "Algorithm question involving binomial coefficients". That gives people an idea what they're looking at, and then you can give the details in the body of the post. –  Cameron Buie Sep 2 '12 at 17:38
@cameron: thanks, your rephrasing in the question body seems accurate. –  binn Sep 2 '12 at 17:39

## marked as duplicate by Qiaochu YuanSep 2 '12 at 18:58

The first thing that comes to mind is this: $z = {x\choose y}$ has the form $x^y\over y!$ plus some lower-order terms. So calculate $x' = (y!z)^{1/y}$ and check integers that are around $x'$ to see if they work. That is a linear search, but it is a linear search that starts in almost the right place, so it is not a completely dumb linear search. If it is not smart enough, do the same thing with ${x\choose y}\approx \frac1{y!}x^{y-1}(x - y)$ instead.