Quantcast
Channel: How can I prove the following inequality is correct? - Mathematics Stack Exchange
Browsing latest articles
Browse All 2 View Live

Answer by Simon Rose for How can I prove the following inequality is correct?

Consider splitting up the difference:$$\sum_{i=0}^{n-1}{N \choose i}(1 - \varepsilon_1)^i\varepsilon_1^{N-i} - \sum_{i=0}^{n-1}{N \choose i}(1 - \varepsilon_2)^i\varepsilon_2^{N-i}$$These are almost...

View Article



How can I prove the following inequality is correct?

How can I prove the following inequality, given that $0 < \varepsilon_2 < \varepsilon_1 < \varepsilon < 1$ and $1 \leq n \leq N$?$\sum_{i = 0}^{n-1} {N \choose i} \Big((1 -...

View Article
Browsing latest articles
Browse All 2 View Live




Latest Images