The inclusion and exclusion principle in view of number theory

The inclusion and exclusion (connection and disconnection) principle is mainly known from combinatorics in solving the combinatorial problem of calculating all permutations of a finite set or other combinatorial problems. Finite sets and Venn diagrams are the standard method of teaching this principle. The paper presents an alternative approach to teaching the inclusion and exclusion principle from the number theory point of view, while presenting several selected application tasks and possible principle implementation into the Matlab computing environment.

Abstract licence: CC BY

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.