搜索资源列表
primes
- 一些关于素数和因数分解的文章。-some of the prime factor decomposition and articles.
判断素数的个数
- 判断101-200之间有多少个素数，并输出所有素数。 1.程序分析：判断素数的方法：用一个数分别去除2到sqrt(这个数)，如果能被整除， 则表明此数不是素数，反之是素数。 -judgment 101-200 between the number of primes, and the export of all prime numbers. 1. Program Analysis : judgment in several ways : with a few were t
zl_5
- Eratosthenes筛法求素数 -Eratosthenes'sieve Method Primes
SuShu
- 求得一个4*4的方阵，各行各列及主负对角线上的元素均为可逆素数。-achieve a 4 * 4 phalanx, the trip out and the main negative on the diagonal elements are reversible primes.
ssh
- 素数的求法，用vb编写的-primes for the law, prepared by using vb
prime
- 快速求素数，用到了概率算法。可以求出相当大范围内的素数，远远优于普通的素数算法-Fast seek primes, using a probability algorithm. Can be obtained within the scope of a large prime number, which is far superior to an ordinary prime number algorithm
primes
- 关于质数的一些程序，是我看了一本关于质数的书后把其中容易实现的算法用MATLAB写出来的。有质数的检验，各种猜想的检验等。-Prime number on some of the procedures that I have read a few books on the quality of which easily achieved after the algorithm using MATLAB written. Qualitative test of a few, all kinds o
prime_number
- is a program which counts the number of primes between 1 and N.
Polynomial_Time_Primality_Testing(AKS)
- Agarwal, Kayal and Saxena （AKS）質數判定法及Matlab代碼實現，學校作業可以參考。-Implements primes in p primality testing algorithm as proposed by Agarwal, Kayal and Saxena popularly known as the AKS algorithm.
Prove
- 证明“素数公式”:证明求素数的公式a=b*b+b+41的真假。-Prove " Formula for primes" : prime numbers seeking to prove the formula a = b* b+ b+41 is true or not.
Seekprimes
- 求素数，并且保存于文本文件，并且下次执行还可以接着上次的结果继续找下去 所以总有一天你会找到最大的素数……每天就像挂Q一样挂一下这个程序就行了-Seek primes, and stored in a text file, and the next performance can also be followed by the last results continue to look down so that one day you will find the largest prime
A0_005
- 验证哥德巴赫才:任何一个充分大的偶数N(≥4),可以用两个素数之和表示. 如 4=2+2 6=3+3 8=3+5 98=17+79-Verify Goldbach before: Any one sufficiently large even number N (≥ 4), can be expressed the sum of two primes. Such as 4 = 2+2 6 = 3+3 8 = 3+5 98 = 17+79
gabriel
- primes factor in scheme
primesix
- primesix.pas = prime numbers generator, We used the fact that primes only occur in the vicinity of numbers divisible by the number 6 without rest. (test MOD 6)=0 (+1) (-1)
MC_Prime
- 用Monte Carlo算法测试素数的实验程序，附有实验报告对程序做详细说明。-With the Monte Carlo algorithm for testing primes experimental procedure, experimental report with a detailed descr iption of the process.
10168
- ACM-10168 - Summation of Four Primes
java
- 输出杨辉三角形，素数的算法，和一些简单的编程-Output Triangle, primes algorithm, and some simple programming
Judgment-is-one-number-for-primes
- 判断一个数是否为质数 采用较先进的方法 速度较快-Judgment is one number for primes Use advanced method faster
primes
- 求素数的四种算法及运行时间的计算，可以看看.-For the four primes algorithm and the running time of the computation, you can have a look.
primes
- 基于C语言实现素数的输出，一个简单的小程序-Based on the C language primes output, a simple little program