Abstract
In this paper we define the complexity of rational numbers and the complexity of the elements of an algebraic field extended by an algebraic number, and we analyze the upper bounds of the complexity of numbers that are generated by arithmetical operations. Using the result, we can judge whether a result of arithmetical operations is equal to 0 by numerical calculations. Moreover this fact can be applied to prove some theorems in elementary geometry automatically.
