network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 2 years |
| seen | Apr 28 '11 at 20:05 | |
| stats | profile views | 5 |
|
Jun 11 |
awarded | Popular Question |
|
Apr 27 |
comment |
Inclusion-exclusion principle: Number of integer solutions to equations Thank you everyone for your answers and comments. I managed to understand the problem. |
|
Apr 25 |
awarded | Student |
|
Apr 25 |
comment |
Inclusion-exclusion principle: Number of integer solutions to equations Thanks for the reply! My main concern is how to get the union for sets where we don't know their elements, so thats what your 'first suggestion'. So how does one find the intersection between A1 and A2, or any other pairs (or triples)? What formula should I use? Everything makes sense until that part. |
|
Apr 25 |
asked | Number of solutions to an equation using the inclusion-exclusion principle |
|
Apr 24 |
comment |
Inclusion-exclusion principle: Number of integer solutions to equations Something I dont understand. Where does |S|=C(18,3) come from? Also, my main problem is how to use the inclusion exclusion principle on |A1∪A2∪A3∪A4|. I'm somewhat of a noob... Thanks for the reply! Just a little bit more input and it will sink in. |
|
Apr 24 |
asked | Inclusion-exclusion principle: Number of integer solutions to equations |
