搜索资源列表
prime-number-1
- 素数填表问题 素数填表问题 素数填表问题 素数填表问题-Problems filling prime prime prime problem filling filling filling prime problem problems problem filling prime prime prime problem filling filling problems
Prime-
- 提供判断是否为素数的三种常用方法，其基本思想是用该数分别处以比其小的所有数，若只能1和其本身除尽则为素数；否则不是-Provided for the prime numbers to determine whether three commonly used methods, the basic idea is fine with the respectively smaller than the number of all, if only divisible by 1 and compare
judge-prime-number
- 利用labview中的公式节点，实现判断素数的功能。-Labview using the formula node to achieve the function to determine the prime numbers.
HNU-12043-Prime-NumberAgain
- HNU 12043 的源代码。 核心代码为快速筛选素数-HNU 12043 source code. Rapid screening of the core code for the prime number
prime
- PRIME NUMBER PROGRAM GENERATION
Prime
- This a Program that computes nth Prime number-This is a Program that computes nth Prime number
Prime-judgment
- Prime judgment , you can get an integer jugded if it is an prime number after you put it in.
prime-test
- 素数测试问题（Monte Carlo算法） 求am(mod n)的算法(m≤n) 设m的二进制表示为bkbk-1…b1b0（bk=1,且k≈log2m）。 例：m=41=101001(2)，bkbk-1…b1b0=101001，（k=5）。 求am可以用下述方法：初始C←1。 -Prime number test problem ( Monte Carlo algorithm) Seek am ( MOD n ) algorithm ( M = n) A
Prime-number-generation
- 使用分段筛法，产生一定数值以内的所有素数。-use Segmented sieve method to Generate all prime numbers within a certain range of values
is-it-prime
- 判断一个数是否是素数的小程序，经过编译即可使用-Determine if a number is prime number of small programs compiled can be used
Prime-number-program-in-c-language
- this program is to check the number is prime or not
Number
- 一个可以从指定范围内，找出质数于非质数的小程序-One can start with the specified range, identify the number on the non-prime number small program
Quick-Prime
- Quick Prime number finding. for 32 unsigned integers. Helpful for Bucket initialization with ATL classes like maps.-Quick Prime number finding. for 32 unsigned integers. Helpful for Bucket initialization with ATL classes like maps.
prime
- 用除法快速求质数,-Fast calculation of prime number division
Prime-number
- TC环境下，给一定数量寻找其中所有的质数。-Under the environment of TC, to find all the prime numbers to a certain number.
Prime-Checker
- Prime Checker RSA is one of the first practicable public-key cryptosystems and is widely used for secure data transmission. In such cryptosystems, primes play an important role. Hence, how to efficiently separate the primes the composite numbers is
prime
- prime number program puzzle question
prime-number
- Using this program you can find out the prime numbers between 1 to 100, 100 to 999 etc. You just need to input the range, for e.g. if you want the prime numbers 100 to 999 then enter numbers 100 and 999 when program prompts for input.-Using this prog
Seeking-twin-prime-numbers
- 所谓孪生素数指的是间隔为2的两个相邻素数，因为它们之间的距离已经近的不能再近了，如同孪生兄弟一样，所以将这一对素数称为孪生素数。 显然，最小的一对孪生素数是（1，3）。我们可以写出3〜 100以内的孪生素数，一共有8对，分别是（3，5），（5，7），（11，13），（17，19），（29，31），（41，43），（59，61）和（71，73）。随着数字的增大，孪生素数的分布也越来越稀疏，人工寻找孪生素数变得非常困难。 本题要解决的问题是：编程求出3〜
prime
- simple prime number find in C++