printf("Hello World\n");
printf("Hello World\n");
Here’s a quick ‘n dirty that solves Bernoulli Trials using the Bernoulli Trial Formula: [math]P(X=k)=C(n,k)\cdot p^k\cdot (1-p)^{(n-k)}[/math]. It has been tested to work on the TI-83 Plus and most likely any variations of it (TI-83, TI-84, etc.)
Prompt N,K,P
1-P->Q
N!/(N-K)!->A
A/K!->C
C*(P^K)*(Q^(N-K))->B
Disp B
You must be logged in to post a comment.