Use inclusion-exclusion to find the number of ways to arrange the six numbers 1, 2, 3, 4, 5, 6 such that(adsbygoogle = window.adsbygoogle || []).push({});

either 1 is immediately followed by 2, or 3 is immediately followed by 4, or 5 is immediately followed

by 6.

I believe that this can be solved using unions. By setting the sets to be the numbers, the union should give two numbers next to each other. For example, set A1 as 1 and A2 as 2, then the union would be the number 1,2. However, wouldn't this union also be 2,1?

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Inclusion-Exclusion principle problem

Loading...

Similar Threads - Inclusion Exclusion principle | Date |
---|---|

Inclusion-exclusion problem | Sep 14, 2015 |

Solving a inclusion-exclusion problem | Nov 18, 2014 |

Random Sampling: Set Inclusion | Feb 12, 2012 |

Principle of inclusion-exclusion proof | Sep 16, 2011 |

If mutually exclusive, prove Pr(A) <= Pr(B') | Sep 7, 2010 |

**Physics Forums - The Fusion of Science and Community**