文件名称：Prime Factoring The Factorial of an Integer
文件大小：45KB
文件格式：PDF
更新时间：2011-09-28 17:05:52
algorithm
The purpose of this paper is to explain an algorithm for computing the prime factorization of the integer 8x. This presupposes a knowledge about how to find the prime factors of 8. But since 8x only has prime factors that are primes less than or equal to 8, we need only consider relatively small primes even when 8x is extremely large. Every prime factor of 8 is also a prime factor of 8x, but usually with a higher multiplicity. Except for the trivial case 8 oe #, 8x always has additional prime factors that 8 doesn't have. Finding the prime factors of 8x leads to an efficient technique on a small machine to compute exact values for permutations and combinations. Before giving the actual steps in the algorithm we first present examples which motivate the relevant theoretical results which are also given before the program code.