Changes

From Genome Analysis Wiki
Jump to navigationJump to search
Line 42: Line 42:  
</math>
 
</math>
   −
Because <math>a_k</math> may be 0, we will see cases of  <math>\binom{k-1}{-1}</math> when  <math>a_k=0</math>.  This is alright because of the definition of  <math>\binom{n}{r}</math>.
+
Because <math>a_k</math> may be 0, we will see cases of  <math>\binom{k-1}{-1}</math> when  <math>a_k=0</math>.  This is alright because of the definition of  <math>\binom{n}{r}</math> which defines this case as 0.
 
But to make it more sensible, we can define the function equivalently as:
 
But to make it more sensible, we can define the function equivalently as:
   Line 50: Line 50:  
   \end{align}
 
   \end{align}
 
</math>
 
</math>
 +
 +
So when  <math>a_k=0</math>, the binomial coefficient reads as  <math>\binom{k-1}{k}</math> which is equals to since there are 0 ways to choose k items from k-1 items.
    
= Simple cases =
 
= Simple cases =
1,102

edits

Navigation menu