####
Tight Thresholds for The Pure Literal Rule

We consider the threshold for the solvability of random
k-SAT formulas (for k >= 3) using the pure literal rule. We
demonstrate how this threshold can be found by using differential
equations to determine the appropriate limiting behavior of the
pure literal rule.