Location:
Search - Prime Numbers
Search list
Description: 输入一个数,程序将会把小于等于这个数的所有素数显示到屏幕上面.-importation of a number of procedures will be put to less than the number of all prime numbers shows that the screen above.
Platform: |
Size: 2048 |
Author: 陈安石 |
Hits:
Description: 重新上传java素数发生器,原先的压缩包打不开,使用java语言在netbean环境开发,产生一定范围内的素数-Re-upload java prime number generator, the original compressed packets can not be opened, use the java language in the NetBeans development environment, resulting in a range of prime numbers
Platform: |
Size: 15360 |
Author: 刘敬奉 |
Hits:
Description: MPI并行程序设计：
对于输入的无符号长整型数，统计小于该数的所有素数的个数。-MPI parallel programming: For input unsigned long integer, statistics less than the number of the number of all prime numbers.
Platform: |
Size: 1024 |
Author: 陈文浩 |
Hits:
Description: 计算M到N间的素数及其个数 ， 比较简单d等几个小程序-Calculation of M to N between the prime numbers and the number of relatively simple d several small programs
Platform: |
Size: 1024 |
Author: 阳丰俊 |
Hits:
Description: 题目
质数分解与栈的使用
简介
只能被自身和1整除的正整数称为质数。每一个整数都可以写成质数乘积的形式，称为整数的质数分解。例如：
1776 = 37 x 3 x 2 x 2 x 2 x 2. -Title prime number decomposition and the use of stack profile only divisible by themselves and a positive integer is called prime number. Every integer can be written in the form of the product of prime numbers, called the prime number decomposition of an integer. For example: 1776 = 37 x 3 x 2 x 2 x 2 x 2.
Platform: |
Size: 1024 |
Author: katrina |
Hits:
Description: 两种高效求素数的方法，比起一般的方法效率要高-Two kinds of highly efficient method of seeking prime numbers than the general method of the efficiency of higher
Platform: |
Size: 1024 |
Author: zhoubaozhong |
Hits:
Description: 用Win32所提供的同步对象解决有限缓冲区问题：写一个过线程实现C/C++语言程序：一些线程负责找出某个范围的素数，并放到一个数组中。另一些线程负责将数组中的素数取出，依次显示
-Use Win32 synchronization objects provided by the limited buffer problem to solve: write a thread to achieve than C/C++ Language Program: responsible for a number of threads to find a range of prime numbers, and into an array. Other threads are responsible for an array of prime numbers out, and then click Show
Platform: |
Size: 3072 |
Author: Nancy |
Hits:
Description: this algorithm is about prime numbers
Platform: |
Size: 1024 |
Author: eagle |
Hits:
Description: 求1到n的素数，其中可能又不是很精简的地方，但程序还算快-Find the prime numbers from 1 to n, which may place and not very concise, but fairly quick process
Platform: |
Size: 1024 |
Author: 发到 |
Hits:
Description: 此代码可以高效的求出所1到1200000的素数，具体的范围可以根据需要修改代码-This code can efficiently find the prime numbers 1-1200000, the specific scope may need to modify code
Platform: |
Size: 1024 |
Author: 黄明 |
Hits:
Description: 利用C语言实现从3-1000之间找出所有的素数，算法比较简洁-Just use the most simple C language to find all the prime numbers between 3 and 1000
Platform: |
Size: 208896 |
Author: 紫樱 |
Hits:
Description: 已知许多整数，求素数个数。先输入N（整数个数），再输入N个整数。每个都不超过32位整型，不小于2.-Give you a lot of positive integers, just to find out how many prime numbers there are.In each case, there is an integer N representing the number of integers to find. Each integer won’t exceed 32-bit signed integer, and each of them won’t be less than 2.
Platform: |
Size: 6144 |
Author: shufan |
Hits:
Description: 主要介绍质数的算法及说明，对于在VC++环境下学习质数的算法，该文件非常有帮助。-This paper mainly introduces the algorithm of prime number and description, studying the algorithm of prime Numbers in the vc++ environment, the file is very helpful.
Platform: |
Size: 37888 |
Author: GUO |
Hits:
Description: 判断101-200之间有多少个素数，并输出所有素数。-Between 101-200 judge how many prime numbers, and outputs all primes.
Platform: |
Size: 3072 |
Author: xinyu lu |
Hits:
Description: 除了自身之外，无法被其它整数整除的数称之为质数，要求质数很简单，但如何快速的
求出质数则一直是程式设计人员与数学家努力的课题，在这边介绍一个着名的Eratosthenes求质
数方法。-In addition to outside itself, can not be called an integer divisible by the number of other primes, prime requirement is very simple, but how fast
Find prime numbers are always programmers and mathematicians efforts topics here introduce a famous Eratosthenes seeking quality
Number of methods.
Platform: |
Size: 1024 |
Author: tiercel |
Hits:
Description: Detecting prime numbers with C. numbers between 100-5-Detecting prime numbers with C. numbers between 100-500
Platform: |
Size: 1024 |
Author: sait |
Hits:
Description: 大素数库，已经实现了大素数的生成算法，可以直接使用，用于rsa算法-Large prime numbers library
Platform: |
Size: 2950144 |
Author: 许明 |
Hits:
Description: 所谓孪生素数指的是间隔为2的两个相邻素数，因为它们之间的距离已经近的不能再近了，如同孪生兄弟一样，所以将这一对素数称为孪生素数。
显然，最小的一对孪生素数是（1，3）。我们可以写出3〜 100以内的孪生素数，一共有8对，分别是（3，5），（5，7），（11，13），（17，19），（29，31），（41，43），（59，61）和（71，73）。随着数字的增大，孪生素数的分布也越来越稀疏，人工寻找孪生素数变得非常困难。
本题要解决的问题是：编程求出3〜 1000以内的所有孪生素数。-The so-called twin prime number refers to the two adjacent prime numbers of 2, because the distance between them can not be closer, as the twin brothers, so this pair of prime number known as the twin prime number.
Obviously, the smallest pair of twin prime numbers is (1,3). We can write the number of twin numbers within 3 to 100, a total of 8 pairs, respectively (3,5), (5,7), (11,13), (17,19), (29,31) 41, 43), (59, 61) and (71, 73). With the increase in numbers, the distribution of twin prime numbers is becoming more and more sparse, and it is very difficult to find twin numbers manually.
The problem to be solved in this question is: programming to find all within 3 ~ 1000 twin prime number.
Platform: |
Size: 82944 |
Author: 胡雪宁 |
Hits:
Description: 素数查找功能的程序，适用于C语言。质数（prime number）又称素数，有无限个。质数定义为在大于1的自然数中，除了1和它本身以外不再有其他因数，这样的数称为质数(The prime search function program is suitable for C language. Prime number, also known as prime number, there are infinite. The prime number is defined as a natural number greater than 1, except that there is no other factor other than 1 and its own, and such numbers are called prime numbers)
Platform: |
Size: 32768 |
Author: 赵彬山林
|
Hits:
Description: How to find prime numbers
Platform: |
Size: 432128 |
Author: freezer |
Hits:
« 12
3
4
5
6
7
8
9
10
...
36
»