| 2.1 | EXAMPLE | ||
| 2.2 | ABSTRACT DIVISON | ||
| 2.3 | THE ITERATIVE FORMULA FOR DIVISON | ||
| 2.4 | BOUNDS ON RESULTING REMAINDER | ||
| 2.5 | LOOKUP TABLE | ||
| 2.6 | NEGATIVE QUOTIENT DIGITS | ||
| 3.1 | THE SRT DIVISION ALGORITHM | ||
| 3.2 | THE ITERATIVE FORMULA FOR DIVISION BASE 4 | ||
| 3.3 | BOUNDS ON RESULTING REMAINDER | ||
| 3.4 | THE PENTIUM LOOKUP TABLE (P-D PLOT) | ||
| 3.5 | ITERATION USING THE P-D PLOT AS A LOOKUP TABLE | ||
| CHAPTER 4 | EXAMPLE OF BUG | |
| CHAPTER 5 | OBSERVATIONS ON HITTING THE ERROR CELL | |
| CHAPTER 6 | TOPICS FOR FURTHER STUDY | |
| CHAPTER 7 | HISTORY OF THE BUG'S DISCOVERY | |
| CHAPTER 8 | HOW TO TEST FOR THE PENTIUM BUG | |
| CHAPTER 9 | PENTIUM JOKES | |
| REFERENCES | ||