Abstract
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) |
---|---|
Pages (from-to) | XVII-XVIII |
Journal | Electronic Journal of Combinatorics |
Volume | 8 |
Issue number | 2 |
State | Published - 2001 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics
- Applied Mathematics