大数的模幂算法(GUI)，用密码学课本中的算法，快速、高效。计算(x的r次方) mod p 的值-Large numbers of modular exponentiation algorithm (GUI), used cryptography algorithm textbooks, fast and efficient. Calculation of (x of the r-th power) mod p value

Euler函数: m = p1^r1 * p2^r2 * …… * pn^rn ai >= 1 , 1 <= i <= n Euler函数： 定义：phi(m) 表示小于等于m并且与m互质的正整数的个数。 phi(m) = p1^(r1-1)*(p1-1) * p2^(r2-1)*(p2-1) * …… * pn^(rn-1)*(pn-1) = m*(1 - 1/p1)*(1 - 1/p2)*……*(1 - 1/pn)

从1-p^2-1中找出与p互素的元素，计算1-p^2-1模p的值，并按模值分类。已验证p=5,7。-Find numbers 1-p^2-1 which is co-prime to p，compute values mod p, and classify them according to values mod p.