High Degree Diophantine Equation c^q=a^p+b^p

The main idea of this article is simply calculating integer functions in module, such as Modulated Function and digital function. The algebraic in the integer modules is studied in completely new style. By difference analysis in module and a careful constructing, a condition of non-solution of Diophantine Equation $a^p+b^p=c^q$ is proved that: $a,b>0,(a,b)=(b,c)=1,p,q>10$, $p$ is prime. The proof of this result is mainly in the last two sections.