搜索资源列表
Eratosthenes
- 汇编语言编写的寻找给定的素数的程序，本题很好的体现了汇编语言在操作上的复杂，但是更重要的是提高了效率，-This program is used to find all the prime numbers in the content
sushu
- 输入一个数 然后可以得到比这个数小的所有素数 InTEL汇编程序设计书后的一道题目 天津大学实验 -Enter a number and then can get smaller than this number of all prime numbers InTEL assembly programming book for a test subject of Tianjin University
prime_sum_C
- Prime sum for parallel programming
SIEVE
- 一种叫做SIEVE的算法，比较快的算出2到某个指定数之间的所有质数。-SIEVE algorithm called relatively quickly calculate the 2 to a specified number of all the prime numbers between.
P1
- 因式分解 将一个自然数分解为若干个素数的积 范围超大-Factorization would be a natural number is decomposed into a number of the product of prime numbers
2
- 输入某范围内的数，输出该数范围内的质数，使用masm5.0-Enter a number within the output range of the number of prime numbers
compiler_homework
- 我大一时候的作业，实现了以下功能: 用16位8086汇编语言编写下列程序之一: a) 两矩阵相加 b) 求Fibonacci数列 c) 输入一个正整数n, 输出1-n之间的所有素数 d) 矩阵相乘 e) 把一个十进制小数转换成IEEE754格式并输出的程序, 要求从键盘输入一个十进制小数,最后在在屏幕上输出IEEE754格式二进制码的序列.-When my freshman year of operations, realization of the fol
pass
- Security is a prime concern in our day-today life. Everyone wants to be as much secure as possible. An access control for doors forms a vital link in a security chain. The microcontroller based Door locker is an access control system that allows only
Goldbach-Conjecture
- 进行哥德巴赫猜想的数据实验，即输入一个比6大的数，输出x=a+b,x为输入，a、b分别为x的两个素数质因数。-The experimental data Goldbach' s conjecture, that is to enter a larger number than 6, the output x = a+ b, x as input, a, b are the two prime x prime factors.
prime
- Displays prime numbers
Twin-to-prime
- 用汇编语言实现10到200以内的孪生素数对。可以更改范围以实现在更大范围内的孪生素数对查询-In assembler language realization within 10 to 200 of the twin primes. Can change the scope to realize in wider range of inquires twin primes
4.4
- (4) 简化的歌德巴赫猜想：任何一个大于6的偶数均可以表示为两个素数之和。现从键盘输入一个0～65535之间的无符号整数，试验证歌德巴赫猜想。 如输入数12，输出： 12=5+7 如输入数20,输出： 20=3+17 20=7+13 如输入数7,输出： Must be even 如输入数3,输出： Must be greater than or equal to 6-to simplify the GeDeBaHe guess: any mo
ge-de-ba-he
- 任意一个大于6的偶数都能表示为两个素数之和。-Any one even greater than 6 can be expressed as two prime numbers.
sushu
- 100 以内的素数，使用到子程序，完成这些素数的输出显示和个数统计以及求和计算，均以十进制形式输出。-Prime numbers less than 100, you want to use to the subroutine, the display and the number of statistics completion of these primes output and calculate the sum, expressed in decimal form output.
C-yuyan
- 判断101-200之间有多少个素数，并输出所有素数。-Judgment 101-200, the number of prime numbers, and output of all prime numbers.
prime
- 并行程序设计课程上提供的计算圆周率的串行程序-The calculated pi serial program parallel programming courses
44
- 简化的歌德巴赫猜想：任何一个大于6的偶数均可以表示为两个素数之和。现从键盘输入一个0～65535之间的无符号整数，试验证歌德巴赫猜想。 如输入数12，输出： 12=5+7 如输入数20,输出： 20=3+17 20=7+13 如输入数7,输出： Must be even 如输入数3,输出： Must be greater than or equal to 6 -Sim
sushu
- 程序实现功能是对一些整数进行是否是素数的判断-Program functions for some integer is prime judgment
1
- C++入门题目，共初学者参考，输入一个数判断是不是素数！-C++ entry subject, a total beginners reference, enter a number judgment is not a prime number!
prime
- 汇编语言代码实现，求100000以内素数个数。代码含有详细注释。-Assembly language code, find the number of primes less than 100,000. Code contains detailed notes.