通过欧拉函数和判断两个数是否互素的函数来求出一个数的所有原根。-By Euler' s function and determine whether the two numbers to find the prime function of a number of all primitive roots.

两种素数筛法：埃拉托斯特尼筛法和欧拉筛法。使用时直接调用函数即可，素数都会存储到su数组中-Two prime sieve methods: Elata Terney sieve method and Euler sieve method. The function can be used directly call the prime number will be stored in the su array

该程序包包含大量的matlab程序,比如Euler解常微分方程(This package contains a large number of matlab procedures, such as Euler solutions of ordinary differential equations)