扩展欧几里德算法不但能计算(a,b)的最大公约数，而且能计算a模b及b模a的乘法逆元。平方和乘算法的复杂度：执行次数至少要k次模乘，最多需要２ｋ次模乘。-Extended Euclidean algorithm for computing not only (a, b) the common denominator, and to calculate a modulus b and b modulus a multiplicative inverse of. Square and by the

求两个数的平方和的根，并且以窗口形式显示结果，sse-The number of squares and two seeking the root, and in the window display the results, sse

时间序列分析中AR模型的建立，可求的残差平方和，便于用AIC准则定阶。-Time series analysis of AR model, rectifiable the residual sum of squares, easy to use the AIC criterion to determine the order.

利用k-means算法进行聚类，K-means算法以欧式距离作为相似度测度，它是求对应某一初始聚类中心向量V最有分类，使得评价指标J最小。算法采用误差平方和准则函数作为聚类准则函数。-Algorithm using k-means clustering, K-means algorithm Euclidean distance as a similarity measure, it is the pursuit of the vector V corresponding to a initial