搜索资源列表
javaxiaochenxu
- 阶乘、奇数和、日志、质数的一些介绍与程序代码-Factorial, odd and, logs, introduced a number of prime numbers and code
A
- 使用Sieve函数解决最大公约数问题,输出时求出每一个数的素数连乘。-Sieve functions to solve problems using the greatest common divisor, the output obtained with each multiplied by the number of prime numbers.
earhar
- 判断一个数是否为素数(C语言学习《C程序设计(第3版)》谭浩强)-Judgment is one number for a prime
exe7_x4
- 输入一个数,判断是否是素数,可以用于计算器中,-Enter a number to determine whether it is prime, can be used in the calculator.
zhi-yin-shu-fen-jie
- 一个能把输入的数字分解为几个质数相乘的程序(此为源码)-Enter the number of prime numbers multiplied into several programs (this is the source files)
pattern_matching
- 分别用KMP、Monte Carlo 和Las Vegas 算法编制3 个程序,随机生成不小于5000 对、 长度很长、且长度不等的01 串X 和Y(三个程序生成 相同的串),然后统计算法的执行时间、Monte Carlo算法出错的比率,并根据运行结果对三种算法进行深入的比较。注意, 先利用本题下方所给素数实现上述算法,学完素数判定 算法之后,将该算法编程,产生一定数量的大素数并用数组保存起来(分别试不超过5000、500000、50000000),以供上述随机算法使用-The
PrimeNumber
- To check the number is prime or not.
RSA
- RSA公钥加密算法是1977年由Ron Rivest、Adi Shamirh和LenAdleman在(美国麻省理工学院)开发的。RSA取名来自开发他们三者的名字。RSA是目前最有影响力的公钥加密算法,它能够抵抗到目前为止已知的所有密码攻击,已被ISO推荐为公钥数据加密标准。RSA算法基于一个十分简单的数论事实:将两个大素数相乘十分容易,但那时想要对其乘积进行因式分解却极其困难,因此可以将乘积公开作为加密密钥。-The RSA public key encryption algorithm in
primes
- 判断一个数是否为素数,主要是给出一个数时,能够判断其是否是素数-judge a number if it is a prime
oushuchaichenglianggezhishuzhihe
- 偶数拆成两个素数之和,java小程序,初学者编辑的 -Even number is split into two prime numbers
Goldbach_Conjecture
- 一个将偶数分解为两个质数的程序,源自于哥德巴赫猜想。-An even number of decomposition procedures for the two prime numbers, derived from the Goldbach Conjecture.
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
2(CPP-ver)
- 验证12位二进制数是否为素数,利用素性检测方法实现-Verify 12-bit binary number of prime numbers, primality testing methods
ZHISHU
- 输入一个数M,判断它是否为质数。所用的方法是从一到根号M,一次除,判断余数是否为零。-Input a number M, judge whether it for prime Numbers. The way from one to the square M, a except, judge whether remnant to zero.
1016
- Prime Ring Problem, A ring is compose of n circles as shown in diagram. Put natural number 1, 2, ..., n into each circle separately, and the sum of numbers in two adjacent circles should be a prime-Prime Ring Problem, A ring is compose of n circles
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.
JAVA
- JAVA小程序 100以内全部素数 完数 P102 T16----英文字母表,希腊字母表-JAVA applet prime numbers less than 100 all finished number P102 T16---- English alphabet, Greek alphabet
isprime
- 关于一个JAVA的核心语法的一个小练习,是使用JAVA实现判断一个数是否为素数。-A little practice on a JAVA core of syntax, the use of JAVA to judge whether a number is prime.
Prime_test
- 判断一个数是否是素数。这个数可以是很大的大数。功能实现了对大数的素数判断。-To judge whether a number is prime. This number can be very large numbers. The function of judgment on the large numbers of prime numbers.
Primes1
- 基于Java实现的哥德巴赫猜想算法的设计,验证任何大于2的偶数都可以表示为2个素数之和。-Goldbach Conjecture Java-based algorithm design, verification, any even number greater than 2 can be expressed as two prime numbers.