搜索资源列表
A Prime Number Generator
- 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 becau
os
- 通过链表的添加与删除而实现的素数选择，排序等-Primes choice through the list to add and delete, sort, etc.
ETP
- 从键盘上输入一个数据，判断其奇偶性，若是偶数，将其分解为2个素数之和（例如：6=3+3，18=11+7，.......），若是奇数，判断其是否为素数，若是素数，找出其孪生素数（例如：5的孪生素数为3和7,11的孪生素数为13，.......）-A data input from the keyboard, determine the parity For even, be decomposed into the sum of two primes (eg: 6 = 3+3, 18 = 11+7,
Seeking-an-orderly-array-element
- 求一有序数组的每一个元素用筛选法求m内的素数-Every element of seeking an orderly array screening method and primes within the m
p
- 此程序采用直接生成回文数的方法，高效地实现回文素数问题-This program uses a direct method to generate palindrome, palindromic primes efficient implementation issues
new3d
- 3D杀号工具，喜欢的自己加一些公式，有大小值、和值、质数、跨度、AC-3D kill number tools, like myself plus some formulas, the size of the value, and the value, primes, span, AC
1
- 编一判断m是否为素数的函数，并在主函数中利用它输出十对最小的孪生素数。所谓孪生素数是指两个相差为2的素数-Compile a judge m is a prime function of the number and use it in the main function output ten pairs of the smallest twin primes. The so-called twin primes refers to two differ by two primes
oo
- /*判断101-200之间有多少个素数，并输出所有素数及素数的个数。 程序分析：判断素数的方法：用一个数分别去除2到sqrt(这个数)，如果能被整除， 则表明此数不是素数，反之是素数。*/ -/* Determine how many prime numbers between 101-200, and the output of all the number of primes and prime numbers. Program analysis: Determini
Goldbach-Conjecture
- 程序可以验证大整数的哥德巴赫猜想，即任意大于2的偶数可写成两素数之和-Large integer program can verify Goldbach conjecture, that any even number greater than 2 can be written by two primes
1
- 要求质数很简单，但如何快速的求出质数则一直是程式设计人员与数学家努力的课题，在这边介绍一个着名的 Eratosthenes求质数方法。-Requirements primes is very simple, but how fast it has been determined primes programmers and mathematicians efforts topics here introduce a famous Eratosthenes seeking prime method
PrimeNumber
- 求出質數&哥德巴赫猜 質數是獨一無二數，以此來練習演算法-Find primes & Goldbach guess the number of primes is unique, in order to practice algorithms
2
- 实现求100—200间的全部素数,冒泡法实现的。-Finding all primes achieve between 100-200.
Analyzing-reversible-primes
- 输入一个数，判断它是不是可逆素数，输出yes或no。-Enter a number, it is determined that it is not reversible prime, output yes or no.