Cache: Fixed formulation of Sleator-Tarjan theorem

05-cache/cache.tex

@@ -378,7 +378,7 @@ competitive ratio can be bounded nicely. Let us denote LRU's cache size $\Clru$
 and similarly $\Copt$ for the optimal strategy.
 
 \theorem{For every $\Clru > \Copt \ge 1$ and every request sequence, we have:
-$$\Tlru \le {\Copt \over \Copt - \Clru} \cdot \Topt + \Copt.$$
+$$\Tlru \le {\Clru \over \Clru - \Copt} \cdot \Topt + \Copt.$$
 }
 
 \proof