The Berger-Felzenbaum-Fraenkel approach to Covering Systems is exposited. In particular their gorgeous proof of the famous an = an-1 theorem for exact covering systems (found independently by Jamie Simpson), is reviewed, and the analogy of their approach to Boolean tautologies in Disjunctive Normal Form is pointed out.
|Original language||English (US)|
|Journal||Electronic Journal of Combinatorics|
|State||Published - Dec 1 2001|
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Geometry and Topology
- Computational Theory and Mathematics