搜索资源列表
prime
- 这个程序给出4到100000000中所有的偶数都是可以由两个质数的和。-This program will solute a problem every even number can be a sum of two prime numbers.
C.
- 判断101-200之间有多少个素数，并输出所有素数。 1.程序分析：判断素数的方法：用一个数分别去除2到sqrt(这个数)，如果能被整除， 则表明此数不是素数，反之是素数。 -Between 101-200 to determine the number of primes, and prints out all prime numbers. 1 program analysis: methods to determine the prime numbers: a numb
Miller
- 这是关于素数判定问题的算法。本程序是基于米勒定理实现的关于大素数的判定算法。-This is about the prime number algorithm to determine the problem. This procedure is based on the Miller theorem on large prime numbers to achieve the decision algorithm.
Archimedes
- 數學大師歐勒(Euler) 找到一個計算圓周率的無窮乘積 : pi/2 = 3/2 * 5/6 * 7/6 * 11/10 * 13/14 * 17/18 * 19/18 * 23/22 * … 有趣的是, 這公式裡, 所有分子都是大於 2的質數, 分母則是不能被 4整除, 且最接近分子的偶數. -Math Masters Euler (Euler) a calculation of pi to find the infinite product: pi/2 = 3/
CODE_UPLOAD1474
- PStat v1.2--a generalized framework for executing a lengthy operation in a thread. For developers who use MFC, this is a freeware module which provides a single easy to use function which allows one of your functions to be executed in a separate thre
chuanshuo
- 判断素数的方法：用一个数分别去除2到sqrt(这个数)，如果能被整除， 则表明此数不是素数，反之是素数。-Method to determine the prime numbers: a number were removed 2 to sqrt (this number), if divisible, it indicates that this number is not prime, and vice versa is a prime number.
FindPrimeNumber
- 在输出框里显示输入上下限，输入上下限后，按确定按钮求在上下限中的素数-Display the input box in the upper and lower output, lower input, press the OK button in the upper and lower demand in the prime number
MathTools2
- android下的数学工具，其中含有质数计算器，-android under the mathematical tools, which contains a prime number calculator,
python
- Number Detector:The purpose of this experiment is to improve your understanding of programming with Python on problem solving. In detail, you are to write a simple Python program that first asks for an integer input and then detect if it is a squ
C8-C9-C10-C11-C12
- 判断101-200之间有多少个素数，并输出所有素数。 1.程序分析：判断素数的方法：用一个数分别去除2到sqrt(这个数)，如果能被整除，则表明此数不是素数，反之是素数。 -Between 101-200 to determine the number of prime numbers, and prints out all prime numbers. 1 program analysis: the method to determine the prime numbers: a
PrimeTest
- 对素数进行测试，一些测试素数算法的代码，对素数进行测试，一些测试素数算法的代码-To test for prime numbers, prime number test algorithm code to test for prime numbers, prime number test algorithm code
ShoNguienTo
- How do you find a prime number
PrimeNum
- Java 输出 N 以内的素数。N为键盘输入。-Java program. Prime number
math-problems
- 一些数学问题算法模板，稍微做了下分类 目录 1 欧几里得和模线性方程 欧几里德 扩展欧几里德 模线性方程 2 欧拉φ函数 扩展欧拉函数 3 线性时间素数筛法 生成欧拉函数表 4 因式分解 5 Nim游戏和sg函数 合肥B 题 -Some mathematical problems algorithm template, do a little under Categories 1and mode of linear eq
pthread
- 使用pthread线程库实现多线程素数求解-Using pthread thread library to solve multi-threaded prime number
Prime
- JAVA多线程找质数。 输入为你想要创建的线程数和质数上限。 例： java PrimeSieve 10 3会利用三个线程输出10以下所有的质数-JAVA multi-threading to find prime numbers. Enter the number of threads you want to create the maximum number and quality. Example: java PrimeSieve 10 3 will make use of
prime
- 输入一个数，判断这个数是否为素数的C语言代码- Enter a number to determine if the number is prime in C language code
Decomposing-Number
- Easy example of decomposing an integer into prime factors
sy8
- 设计一个包含两个线程的程序：一个线程取系统时间，显示在屏幕上，另一个线程求2-10000之间的素数显示在屏幕上。-Design a program with two threads: a thread to take the system time, displayed on the screen, another thread seeking prime number between 2-10000 displayed on the screen.
Primitive-root
- 给定大素数P，如果求其原根？给出算法描述。并编程实现具体功能。 利用随机数生成大素数q，P是形如2*q+1的大素数，P也为素数，若P不为素数，则重新生成大素数q，重复上述步骤。生成随机数g，1<g<p-1，要满足：g^2 mod p!=1, g^q mod p!=1, 则g为P的本原根。-Given a large prime number P, if you find its original roots? Algorithm descr iption is given. A