Newton polygon’s have recently experienced a revival in p-adic analysis. However, several of the recent accounts their use in this subject leave out the main results that make the polygons so useful. This talk will be a short account of Newton polygons, their uses and their limitations. I will explain how to use Newton polygons to easily state the strongest possible versions of Eisenstein’s Irreducibility Criterion, Newton’s Local Parameter Theorem, Hensel’s Lemma, and the p-adic Weierstrass Preparation Theorem. I am not claiming anything as new, but I am pretty sure it will prove useful.