搜索资源列表
将正整数分解为素数之积
- 将正整数分解为素数之积
primes
- 一些关于素数和因数分解的文章。-some of the prime factor decomposition and articles.
判断素数的个数
- 判断101-200之间有多少个素数，并输出所有素数。 1.程序分析：判断素数的方法：用一个数分别去除2到sqrt(这个数)，如果能被整除， 则表明此数不是素数，反之是素数。 -judgment 101-200 between the number of primes, and the export of all prime numbers. 1. Program Analysis : judgment in several ways : with a few were t
素数的判定
- 素数的判定（概率算法），可以判断较大的素数-prime Judgment (probability algorithm), can be judged on a few large
RSAExample
- 一个素数测试算法,运用最简单的素数测试方法 把所有比它小的数都一一除过-a prime test algorithm, using the most simple-a few test methods all over it are several small inter-off on January 1
accept
- 数字运算，判断一个数是否接近素数 A Niven number is a number such that the sum of its digits divides itself. For example, 111 is a Niven number because the sum of its digits is 3, which divides 111. We can also specify a number in another base b, and a number in
BigIntC
- 一个生成大素数的文件，效率很高。可以在C++或VC++工程里直接引用-generate a large number of paper-and high efficiency. In C or VC works directly invoked Lane
LargeInt
- 一个大整数计算的小程序,可以进行大数的计算,可以对素数进行测试-a large integer calculation procedures for the small, the large numbers can be calculated in the number of test -
^prime_fac1617337192003
- 素数因子产生器：该程序能生成prime factor-prime factor Generator : the program can generate prime factor
梅里森素数
- 一个计算梅里森素数的Java程序-a calculation on the number of Forest Java programs
prime
- 产生大素数。以时间作为随机数生成的种子，随机生成大素数。-Generate large prime numbers. With time as the random number generator seeds, randomly generated large prime numbers.
genprime
- 基于大数库miracl的快速产生大素数的c语言实现（输入的随机种子不同产生的大素数也不同）-Based on the rapid creation of large numbers library miracl large prime numbers c-language implementation (a different type of random seed generated large prime numbers are different)
shushu
- 求素数的程序，用了一些标准库．不难，但很有用-Prime number for the procedure, using a number of standard library. It is not difficult, but very useful
BigPrimerGen
- 大数的运算的类和大素数生成的算法，用C++实现。-Big number computing and big primer generating algorithm.
cunsushuwenti
- 这段代码是算法设计或者ACM课程中一道纯素数问题的优化求解。-This code is the algorithm ACM curriculum design or a pure optimization to solve the problem of prime numbers.
chengxu
- 几个简单的小程序，判断是否是素数、回文，以及其他算法的实现-A few simple little program to determine whether it is prime, palindromes, and other algorithms to achieve
寻找梅森素数的程序
- 本程序是一个寻找梅森素数的程序，通过本程序可以很快地判断一个数字是否是梅森素数。-This procedure is a find Mersenne primes program through this program, you can quickly determine whether a number is a Mersenne prime.
素数 平均数 最高
- 判断素数； 输入10个学生5门课的成绩,分别用函数求:①每个学生平均分;②每门课的平均分;③找出最高的分数所对应的学生和课程。(Judgment prime; Seek average and highest marks.)
素数
- 判断素数的几大方法之一，比较实用，能快速判断素数(One of the major ways to determine prime numbers is more practical, which can quickly determine prime numbers.)
统计素数与幸运素数
- 统计并打印1 亿以内的所有素数个数，并且打印出1 千万以上1 亿以内的所有幸运素数（如11110111 这样仅有1 位不同，其它位数 字都相同的素数），直接打印答案无效