由欧几里得，连续整数检测，分解质因数算法得最大公约数，并分析各种算法的时间性-By the Euclid, consecutive integers detection, decomposition of the prime factors have the greatest common divisor algorithm, and analyze the timing of various algorithms

将一个正整数分解质因数。例如：输入90,打印出90=2*3*3*5。-The prime factors of a positive integer factorization. For example: Enter 90 to print out 90 = 2* 3* 3* 5.

这个是简单的用vb编程编的分解质因数的程序和已经编译了的exe文件-This is a simple program with vb series of the quality factor of the decomposition process and is compiled by the exe files

将一个正整数分解质因数。例如：输入90,打印出90=2*3*3*5。-decompose the Positive