- #1

Portishead

- 12

- 0

## Homework Statement

Prove that[/B]

[tex]P(\cup_{i=1}^n E_i) \geq \max_i P(E_i) (1)[/tex] for n≥1

## Homework Equations

I know that [tex]P(\cup_{i=1}^n E_i) \leq \sum_{i=1}^n P(E_i)[/tex].

## The Attempt at a Solution

I know when n=1, trivially [tex]P(E_1) \geq \max_1 P(E_1)

=P(E_1)[/tex]. So I was hoping I could use induction to show that (1) is true for n≥1. But I don't know if this is the right approach...

Last edited: