Dear ZFT attendee, has your research ever come down to proving a polynomial inequality? If so, would you want to use boring old analysis to come up with a five line proof? Or would you rather spend two days creating an algorithm to find the exact factorization of the polynomial? The latter is the obvious choice. Come on over to ZFT this week and see how Clarkson's inequality can be proved in a special case by using linear recursion and binomial coefficients! I guarantee that you will think of the polynomial $y^2-2y+1$ differently for the rest of your life!