搜索资源列表
primeNumber
- 数论相关的一个算法：如何在多项式时间判断素数-Number theory related to an algorithm: How to determine in polynomial time prime number
prime
- 一个求解素数的算法小程序！为初学者了解语法功能与结构使用- A prime number of algorithms for solving applet
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
PrimeNumber
- prime number to detection with labview only for numbers that greater than 9
prime
- 求任意一个整数是不是素数。采用for循环分别用改数除以它和1之间的所有数。最后给出结果。-For any prime number is an integer. Used for the cycle were divided by the number changed between it and all the number 1. Finally, the results.
fast_strong_prime_number_generation_method
- 一种快速的强素数生成方法 一种快速的强素数生成方法-A fast strong prime number generation method
qiusushugeshu
- 本程序介绍完成读入1000个数的操作，并求出其中素数的个数。-This procedure describes the number of completed read operation 1000, and calculated the number of prime numbers of them.
Find-the-largest-prime
- Find the largest prime factor of a composite number
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.
JAVA
- JAVA小程序 100以内全部素数 完数 P102 T16----英文字母表，希腊字母表-JAVA applet prime numbers less than 100 all finished number P102 T16---- English alphabet, Greek alphabet
Desktop
- /* Program to find whether the given number is a Prime or not*/- /* Program to find whether the given number is a Prime or not*/
判断101-200之间有多少个素数
- 题目2：判断101-200之间有多少个素数，并输出所有素数。-Topic 2: judgment between 101-200 how many a prime number, and output all primes.
example14
- 题目：将一个正整数分解质因数。例如：输入90,打印出90=2*3*3*5。 程序分析：对n进行分解质因数，应先找到一个最小的质数k，然后按下述步骤完成： (1)如果这个质数恰等于n，则说明分解质因数的过程已经结束，打印出即可。 (2)如果n<>k，但n能被k整除，则应打印出k的值，并用n除以k的商,作为新的正整数你n, 重复执行第一步。 (3)如果n不能被k整除，则用k+1作为k的值,重复执行第一步。-Topic: the prime factors o
VC
- 求整数n的各位数字之和，并判断n是几位数，以及判断是否为素数，求最大公约数，求阶乘，多种排序方法，以及数组转置的方法-Digits and integer n and n and determine the numbers that judgment is a prime number, and the greatest common divisor, factorial, and a variety of sorting methods, as well as the array transp
Windows_SEA
- 使用MIRACL 為底層的函式庫， 再利用C++ Builder 設計視窗化執行介面，在 Pentium 1.83G 的處理器上搭配1G 記憶體尋找 可供橢圓曲線密碼系統使用的質數階橢圓曲線 參數，基域為192、224、256、384、521 位元 平均分別需要580、1360、1884、20907、65862 秒可搜尋到一條質數階的橢圓曲線參數，且計 算一條橢圓曲線的階數平均分別需要31.6、 56.7、99.4、722.3、2726.0 秒。-Use MIRA
Modified-RSA
- Modified RSA cryptosystem based on offline storage and prime number
three
- create a Christmas tree with string * , caling the function tree(x), x is a prime number!-create a Christmas tree with string * , caling the function tree(x), x is a prime number!
panduan
- 请用C语言编写一段程序，判断任意一个数M是否为素数。-Please write a program in C language, to determine whether any of a number M is a prime number.
Prime_Numb227424432015
- Prime Number Finder ,One of the most fascinating inventions made by man is the computer. We use computers in our day to day activities such as in business, education, research, military applications, communications as well as entertainment.
Prime-number-program-in-c-language
- prime number program in c language