December 19th, 2012, 04:05 PM

If you mean binomial the formula that I posted in #1 it is wrong formula for calculate binomial because it always answers 1 to us

the right formula for binomial is

public static double...

December 13th, 2012, 05:54 PM

yeah I think I can do :)

many thank to you

December 13th, 2012, 11:24 AM

I know what you mean but our purpose is to find a formula not a better way to calculate binomial

we can say in formula 50! and don't need to calculate it because it is formula

December 11th, 2012, 07:11 PM

thank for your answer

but there is only one thing remains

I sent an mail to the writer of the book that I found this problem and he answered me

Hint: calculate the number of calls for some small...

December 11th, 2012, 09:11 AM

I tried before all of this and I think no one knows the answer in the world and wanna give up because it takes my time too much and spent enough time for this problem.

number of recursive calls :...

December 11th, 2012, 07:13 AM

I wrote a program that gives me the numbes but for (100,50) it takes too long

I am sure that there is a formul

(1,0)=3

(2,0)=5

(2,1)=7

(3,0)=7

(3,1)=13

December 10th, 2012, 09:23 PM

How to estimate the number of recursive calls that would be used by the code

public static double binomial(int N, int k, double p)

{

if ((N == 0) || (k < 0)) return 1.0;

return (1.0 -...