Prime Factoring The Factorial of an Integer
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.
- 粉丝: 0
- 资源: 16
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助