In fact, I come from the log serie...
\sum_{i=1}^{a}(a-i+1)log(a-i+1)
\sum_{i=1}^{a}log((a-i+1)^{(a-i+1)})
log(\prod_{i=1}^{a}{(a-i+1)}^{(a-i+1)})
which now has been transformed to the product...
thanks,
Because I'm trying to find an upper bound to define the complexity of an algorithm...and I cannot put it that way...it would be great to find an appropriate upper bound to this product
Thanks
Homework Statement
Let <d1,d2,d3...dN> be an odered set of samples from an exponential
random variable with parameter lambda.
Let <l1,l2,l3,...,lM> the same.
Let Z = min<d1,d2,...,dN> --> Z is exp with parameter lambda*N
Let U = min<l1,l2,...,lM> --> U is exp with parameter lambda*M...