A concise proof of abc conjecture of integer and n-term abc conjecture of integer is given in this paper. The essence of abc conjecture of integer is to obtain the number of integer solutions to the abc equation when the abc equation has solutions. Firstly, the combinatorial approximation method to compute the approximate number of integer solutions to linear Diophantine equation with integer subsets as solution set is presented. Secondly, the approximate number of integer solutions to the abc equation was obtained by using combinatorial approximation method, thus providing concise proof of abc conjecture of integer. Finally, the same idea and method is applied to n-term abc conjecture of integer and the results we obtained are consistent with the conjecture.



