Chapter 34 Mission Impossible
Project by: Ricky Leung, Benson Li, Stephen Ng, and Leona Wei.
\(\textbf{Summary:}\) The goal of this project is to show that with the current computational capability there is not enough time to find \(R(6,6)\text{.}\) Our goal is to visually show how to calculate the Ramsey number for a small number of red and blue. We will illustrate how to solve \(R(3,3)\) in our comics and then try to generalize the result for \(R(5,5)\text{.}\) We also explore the number of combinations we need for \(R(5,5)\) and \(R(6,6)\text{.}\) This will give readers an intuition about how long it will take for an average or top of the line computer and if Moore's law will even give us enough transistors to solve this problem. And as Erdős said we would be hopeless and have to fight the aliens.
\(\textbf{Mission Impossible - Comic Novel:}\)
