Zeller's Congruence and Modular Systems (UMAP)

Section 1 introduces Zeller's congruence with motivational problems. Section 2 deals with the greatest integer function, applications and graphs. Section 3 uses clock arithmetic and the step function to practice Zeller's formula. Section 4 covers computer programming involving the previous topics. The unit ends with a list of student projects and sample test.

Table of Contents:

INTRODUCTION

1. THE FORMULA AND ITS PURPOSE

2. THE GREATEST INTEGER FUNCTION
2.1 Definition and Graph
2.2 Some Applications of the Greatest Integer Function

3. MODULAR SYSTEMS
3.1 Introduction and Application of Zeller's Congruence

4. ZELLER'S CONGRUENCE AND THE COMPUTER

5. PROJECTS

6. SAMPLE EXAM

APPENDIX: ZELLER'S CONGRUENCE

ANSWERS TO EXERCISES