L27V07 Proving the Upper & Lower Bounds
Channel: Math 3012 at The Georgia Institute of Technology
Date: 2016-04-12

We prove that 2^(n/2) ≤ R(n, n) ≤ 2^(2n). The upper bound is easy to show, but the lower bound is more complicated.