The lowest competitiveness for any randomized algorithm for the paging problem is known to be H_k. The lowest competitiveness for any known randomized algorithm for the paging problem that uses no bookmarks is 2H_k - 1. It is natural to ask whether there a tradeoff between the number of bookmarks and competitiveness. Theorem 1. EQUITABLE is an H_k compeititive randomized algorithm that uses O(k^2 log k) bookmarks. The actual formula is approximately (5 k^2 H_k), which works out to abut 30 if k = 2. Theorem 2. There is no 3/2 competitive randomized algorithm for the paging problem for k = 2 that uses no bookmarks. Theorem 3. There is a 3/2 competitive randomized algorithm for the paging problem for k = 2 that uses at most one bookmark at any given time. Problem. What is the minimum number of bookmarks needed for the case k = 3, to achieve 11/6 competitiveness? The number certainly does not exceed the number needed by EQUITABLE, but that number is ridiculously large. Open Problem. For general k, find a relationship between the number of bookmarks used and the competitiveness. More specifically, Borodin and El Yaniv as whether we can obtain H_k competitiveness with O(k) bookmarks.