title: binomial coefficient for very high numbers in c
body: <p>So the task I have to solve is to calculate the binomial coefficient for 100&gt;=n&gt;k&gt;=1 and then say how many solutions for n and k are over an under barrier of 123456789.
  I have no problem in my formula of calculating the binomial coefficient but for high numbers n &amp; k -&gt; 100 the datatypes of c get to small to calculated this.</p>
  <p>Do you have any suggestions how I can bypass this problem with overflowing the datatypes.
  I thought about dividing by the under barrier straight away so the numbers don't get too big in the first place and I have to just check if the result is &gt;=1 but i couldn't make it work.</p>