搜索资源列表
satisfy
- primes factor in scheme
2
- 回文素数的算法源码,支持在C++环境下编程-Palindromic primes algorithm source code, support for C++ programming environment
Desktop
- 利用C++最简实现素数算法,在时间和空间上均比其他算法要优异-In c++ language based on the most Jane realize primes algorithm, in time and space are to optimize than other algorithms
C
- 常见C语言算法和源程序,包括经典算法,水仙花数,素数求解,-Common algorithm in C language source code, including the classical algorithm, the the daffodils number of primes solving,
判断101-200之间有多少个素数
- 题目2:判断101-200之间有多少个素数,并输出所有素数。-Topic 2: judgment between 101-200 how many a prime number, and output all primes.
50java
- 50道java练习题目,如判断101-200之间有多少个素数,并输出所有素数-50 java practice questions, such as determining the number of primes between 101-200, and output all primes
statistical
- 求n与m间的素数,并求和. 对不起,我知道我的程序太简单,但是我真得很渴望和你们一样强-Seeking between m and n primes and statistical number
Locally-Laplace-Isometries
- 发表在 The MIT Talbot 2013 Workshop 的论文 -Locally Laplace Isometries and Fibonacci Primes. this paper shows that there exists a reversible, unique and separable elliptic, Brahmagupta arrow. In this setting, the ability to study positive scalars is essent
zhishidhof
- 这是一个用费马小定理求质数的一段代码,他能够实现大数的求素性。-This is a little theorem Fermat primes seeking a piece of code, he was able to achieve large numbers seeking primality.
sushu
- 素数的生成,大于等于一个数的素数的生成,进行MDS码研究的第一步-Generating primes
sushuchegnxu
- 自编C函数实现求素数,采用函数预编译,找出1000以内的素数-C functions to achieve self primes primes demand, using pre-compiled function to find out within 1000
maopaoasushu
- 冒泡法排序,改进的冒泡法及素数的判定程序,C编译的,试过,很管用-Bubble sort method, improved bubble method and primes determination procedures, C compiler, tried, very useful
PrimeNumberTheorem.nb
- Formalizes asymptotic distribution of the prime numbers among the positive integers that is, the intuitive idea that primes become less common as they become larger by precisely quantifying the rate of occurrence.-Formalizes asymptotic distribution o