Abstract: Let F(x , y) be a binary form with integer coefficients and degree at least 3. Suppose F(x , y) is irreducible over the rational numbers. In 1909, Thue proved that for any given integer m, the equation
F(x , y) = m has at most finitely many solutions in integers x and y. These equations are called Thue equations. We will explore some general questions: how many solutions can a Thue equation have? how often do Thue equations have any solution? We will also talk about applications of Thue equations in counting some interesting arithmetic objects, such as orders in number fields.