We define the k^th "harmonic number" H_k to be the sum of the reciprocals of the first k positive numbers. For example, H_1 = 1, H_2 = 3/2, H_3 = 11/6, and H_4 = 25/12. Note that H_k = Theta(log k); in fact, H_k is very close to log_2(k). There is a randomized algorithm for the paging problem which is H_k competitive for cache size k. That algorithm, PARTITION, is rather complicated. Here, we give a highly simplified version, which we call Bookmarks, which works only for k = 2. At any given time, the algorithm maintains a list of "bookmarked" pages in slow memory. There is no limit to the length of this list. Initially, there are no bookmarks. We call the two pages in cache the "lru" page and the "mru" page. The mru page is defined to be the page that was requested in the previous step, while the lru page is simply the other one. Each time a request is made, those labels may change. Bookmarks: 1. If mru is requested, do nothing. 2. If lru is requested, erase all bookmarks. 3. If a bookmarked page is requested, eject lru and erase all bookmarks. 4. If there are M bookmarks, and then an unbookmarked page in slow memory is requested, eject lru with probability 1/(M+2), and eject mru with probability (M+1)/(M+2). Bookmark the ejected page. (There will now be M+1 bookmarks.) Theorem: Bookmarks is 3/2-competitive. Proof: Define a "phase" as follows. Before the first request of a phase, the support of the work function consists of one configuration. The last request of a phase is when the support of the work function is once again just one configuration, except for a possibly incomplete phase at the end. The proof consists of first verifying the following claims. We omit these verifications. Claim 1: The cardinality of Supp(w) is M+1, where M is the number of bookmarks. If b_1, ... b_M are the bookmarked pages, Supp(w) consists of the pairs (mru,lru), (mru,b_1), ... (mru,b_M). Claim 2: If X in Supp(w), the probability that (mru,lru) = X is 1/(M+1). Claim 3: If the length of a complete phase is d, then the optimal cost for that phase is at least d-1. For an imcomplete phase of length d, the optimal cost is d. Claim 4: If the length of a phase is d, then Bookmark's cost for that phase is d - 1/d. For an incomplete phase of length d, the Bookmark's cost is d. The Theorem follows immediately from the claims.