This paper tentatively converts several famous number theory problems to the number of two finite set intersection elements. Given two finite subsets of the set of integer numbers, a counting formula has been proposed for the calculation of the number of elements of their intersection. Consequently, an equivalent proposition of Goldbach's conjecture has been provided as an illustration of the formula.