搜索资源列表
Prime
- 这是研究生课程计算方法与技术中讲到的Prime算法的具体实现，相信学这个课的同学都会感兴趣的。-This is the postgraduate courses calculation methods and technologies referred to the Prime algorithm to achieve specific, I believe that this course of study students will be interested.
prime
- 用概率算法实现求素数10000以内的素数的问题，并且与确定性算法比较。-With the probability algorithm for prime numbers less than 10000 prime numbers, and compared with the deterministic algorithm.
prime
- 产生大素数。以时间作为随机数生成的种子，随机生成大素数。-Generate large prime numbers. With time as the random number generator seeds, randomly generated large prime numbers.
shushu
- 求素数的程序，用了一些标准库．不难，但很有用-Prime number for the procedure, using a number of standard library. It is not difficult, but very useful
prime
- 题目 质数分解与栈的使用 简介 只能被自身和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. Ever
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
Prime_algorithm
- Prime算法Matlab源代码 Prime算法Matlab源代码-impletmentation of Prime Algorithm based on Matlab
prime
- 谈谈素数，素数相关的算法，ACM，pdg电子书-To talk about prime numbers, algorithms, ACM
prime
- 素数环： 把从1到10这10个数摆成一个环，要求相邻的两个数的和是一个素数。 〖问题分析〗 这是一道回溯的题目。从1开始，每个空位有9种可能，每种可能加入约束条件即可 1.与前面所有的数不重复 2.与前一个数和为素数（最后一个和第一个也要满足）。 〖算法流程〗 1、数据初始化； 2、递归填数： 判断第J种可能是否合法； A、如果合法：填数；判断是否到达目标（10个已填完）： 是，打印结果；不是，递归填下一个； B、如果不合法：选择下一种可能；-Prime Centra
prime
- The program generates the first N prime numbers.
Miller-Rabin-c
- 求质数的算法之Miller-Rabin费马小定理-Prime number for the Miller-Rabin algorithm of Fermat' s Little Theorem
prime
- 利用数学的概念来检查任意输入数值是否为质数-The concept of the use of mathematics to check whether any numerical input prime number
prime
- 找n以内的素数的程序，算法复杂度O(n^0.5)-Find the prime numbers below n, the efficiency of the program is O(n^0.5).
flysf
- 这个傅立叶实例算法使用了基2、基3、基4、基5、基8、基10……混合算法，几乎可以计算任意长度的FFT。说明白点也就是当序列长度n为2、3、5、7、11等这些比较小的素数时，或者n的最大素因数<=37时，可计算这个序列的FFT。-The Fourier algorithm uses an instance of the base 2, base 3, base 4, base 5, base 8, base 10 ... ... hybrid algorithm can calculate
Prime
- Prime 算法，创建有向图，无向图，有向网，无向网的算法-Prime algorithms, to create a directed graph, undirected graph, directed networks, undirected networks algorithm
prime
- 大二数据结构程序代码 实现prime算法-Sophomore data structure to achieve prime code algorithm
prime
- 一是利用计算机对正整数进行素因子分解认识素数，通过运用筛法与试除法寻找一定范围内的素数，体会到筛法比试除法有效但无法找出所有素数；二是通过若干特殊形式的素数的研究，寻找素数生成公式，发现一些结论；三是借助于非线性拟合技术，观察素数分布规律，利用其研究有关数论问题。-The first computer was used to prime factor decomposition of positive integers understanding of prime numbers, throug
prime
- 两种高效求素数的方法，比起一般的方法效率要高-Two kinds of highly efficient method of seeking prime numbers than the general method of the efficiency of higher
Prime
- 输入一个整数数据并求大于该数据的的最小素数-Enter an integer data and the data request is greater than the smallest prime number
Prime numbers in pthreads
- Find prime numbers in a interval of time by using parallelism with pthreads