A hyperplane arrangement is an arrangement of a finite set of hyperplanes in some vector space. Hyperplane arrangements generalize other famous combinatorial objects such as graphs and matroids. In this talk, we introduce a characteristic polynomial of a hyperplane arrangement. We discuss how to compute the polynomial and compute the number of regions generated by hyperplane arrangements by using the characteristic polynomials.