搜索资源列表
prime_number
- A program to find out all prime number.
Asmallprimenumbercalculationprogramforapplicationd
- 一个计算质数的小程序,适合与基本应用开发-A small prime number calculation program for application development and basic
sushuqiuhe
- 实现1到100的素数求和，首先要判断哪些是素数，然后在迭代相加-Achieve 1-100 sum of prime numbers, we must first determine which is the prime number, and then add in the iterative
sieve
- 筛法求素数。 用筛法求给定范围内的素数。 -Prime number sieve method
Primenumber
- 这是一个自己编的有关素数的小程序，能够很好的运用，一般新手可以下载-Own it is a prime number of the small procedures, the use of a good, general novice can download to try
TOOLS_V1.2.RAR
- 素数判断，进制转换，计算器，字符转换，子网划分-Determine prime number, hexadecimal conversion, calculator, character conversion, subnetting
Prime_Numbers
- Threw history,prime numbers has always be a great fascination for mathematicians. Even in modern times,primes numbers continues to fascinate many people.Probably the main reason why prime numbers continues to create such great interest would be beca
rsa
- 密码学大作业的内容，实现了多位数的素数检验生成等-Cryptography the contents of large operations, the realization of a multi-digit prime number, such as test generation
(cwj)MultiThread
- 本VC++源码，是一个多线程的程序实例，它的主要功能是利用多线程进行素数的选择计算，是学习多线程的一个好例子-The VC++ source code, is an example of multi-threaded program, and its main function is to use multi-threading to the choice of prime number calculation, is to learn from multi-threading a good e
PRIME
- 在密码学中判断一个数是否为素数很重要 该算法判断一个数是否为素数 c语言实现-Cryptography judged in a number of prime numbers is very important for the algorithm to determine whether a number of prime numbers c language
PrimeNumber
- prime number to detection with labview only for numbers that greater than 9
SHUSU
- 设计程序求任意给定范围之间的素数。先建立一个含有2～100之间所有自然数的数表，在数表中删去2的倍数(不包括2)；然后找2后面第一个被保留的数p(是3)，再删除p的倍数(不包括p)；然后再找下一个被保留的数(是5)，继续上述步骤：这样继续下去，直至P大于100为止。-The design process for any given prime number between range.
Multiplicativefunction
- 这个文件主要介绍了3算法 1线性时间筛素数 2线性时间求前n个数的欧拉函数值 3线性时间求前n个数的约数个数 并附有实现的C++代码 -This paper introduces a linear time algorithm for three sieve prime number 2 for linear time ago n the number of Euler function value of 3 for linear time about the number
lisanduishu
- 设p是素数，a是p的本原根，即a1,a2,a3,…,ap-1在mod p下产生1到p-1的所有值，所以对任何b属于{1,…,p-1},有唯一的i属于{1,…,p-1}使得ai mod p 等于p。称i为模p下以a为底b的离散对数。-P is a prime number based, a is the primitive root p, that is, a1, a2, a3, ..., ap-1 in the mod p under 1 to p-1 for all values, so fo
prime_number
- 这个程序是用来判断一个数是否为素数的，用户由键盘输入一个正整数，即可判断该数是否为素数，还可以连续输入，输入-1来结束输入。-This procedure is used to determine whether a number of prime numbers, the user keyboard input from a positive integer, you can determine whether the number of prime numbers, but also for
[_A_Prime_186265382005
- A Prime Number Generater
zshz
- 判断输入的数字是否质数,再判断这两个数是否互质-Input to determine whether the number of prime number, and then determine whether or not these two the number of coprime
Rsa
- 检验质数 rabinmiller算法 网上收集-Prime number testing algorithm rabinmiller online collection
mexFunction_demo
- This program calculates first n prime number and save them to a matrix (y)
Goldbach
- 歌德巴赫猜想验证工具，附质数库以及质数生成器。-Goldbach conjecture verification tools, with the Treasury and the prime number prime number generator.