搜索资源列表
sushu
- PL-SQL编程源码，该源码实现了自定义mod函数判断质数问题，经测试，结果正确。可以判断从你输入的两个数之间的全部质数并输出。-PL-SQL programming source, the source code to achieve a custom mod function to determine the question of quality, tested, the results correctly. Can be judged from the number you enter
prog1
- 在一定数的范围内返回素数!二级必会!其中运用到循环结构-At a certain range of the number of prime numbers back! 2 must be! Applied to one of the cycle structure
069
- 验证歌德巴赫猜想（验证2000以内的正偶数都可以分解为两个素数之和）-Goldbach conjecture verification (authentication 2000 is even less than can be decomposed into the sum of two prime numbers)
ddpy
- 点的平移：任意输入点的横纵坐标，可以实现其任意平移。 还有求素数的程序，已经调试。-Point of translation: the arbitrary input of horizontal longitudinal coordinates, can achieve its arbitrary translation. There are procedures for prime numbers have been debug.
ECC
- C语言，大素数域上的椭圆曲线加密解密算法-C language, the domain of large prime numbers on the elliptic curve encryption and decryption algorithm
MonteCarlo
- 内容包含两部分：一是判断是否为素数的MonteCarlo算法；另外给出了一部分素数。MonteCarlo是一种概率算法，一般的算法书上都会提到，这是以前课程设计的一部分，用Java实现，希望对大家有用。-A MonteCarlo algorithm for finding prime numbers, which was part of my course design. Maybe it s helpul for you.
prim
- This little program count prime numbers. Little but fast solution. (not grid/cloud resources).
Goldbach
- 哥德巴赫猜想，证明任意大的一个偶数都可以表示成为两个素数的和！-Goldbach Conjecture to prove that an arbitrary large even number can be expressed into two prime numbers, and!
083
- 歌德巴赫猜想：验证2000以内的正偶数都能够分解成两个素数之和，即验证歌德巴赫猜想再2000范围内的正确性-Goldbach conjecture: Verify 2000 is even less able to break down into two prime numbers and that the Goldbach conjecture and then verify that the scope of the correctness of 2000
SoftwareDevelopment
- 初学者，几个比较常见的小程序（素数、乘法表、查询……）-Beginners, some more common small program (prime numbers, multiplication tables, queries ... ...)
PrimeNumber6003
- 生成检验大素数的程序,可以选择范围，比如100000-20000，或者1000000-2-generate and test Large prime numbers procedures
s
- 6． 素数环问题 把从1到20这20个数摆成一个环，要求相邻的两个数的和是一个素数。 分析：用回溯算法，考察所有可能的排列。 -6. Prime numbers loop problem 1-20 from 20 before the number into a ring, adjacent to both the number of requests and is a prime number. Analysis: The retrospective algorithm, exam
2
- 基于C判断一个大于0的数是否为素数,是较简单的典型C编码算法-C based on a greater than 0 to determine whether the number of prime numbers, are more typical of a simple coding algorithm C
desandrsa
- DES算法全称为Data Encryption Standard,即数据加密算法,DES算法把64位的明文输入块变为64位的密文输出块,它所使用的密钥也是64位。RSA的安全性依赖于大数分解。公钥和私钥都是两个大素数（ 大于 100个十进制位）的函数。本程序为适合初学者的rsa算法java源码及des源码，开发环境eclipse3.4-DES algorithm called the Data Encryption Standard, that is, data encryption algor
7
- 由键盘输入一个最大值，求2到这个最大值中的所有质数（素数）。-Keyboard input from a maximum, for 2 to the maximum value of all prime number (prime numbers).
sspd
- 素数判断用Java程序写的Applet小程序 输入任意证书均可以判断是否是素数-Prime numbers to determine the procedures used to write the Java applet Applet arbitrary input can determine whether the certificate is a prime number
RSA1
- RSA算法，实现加解密 基于大素数乘积不可逆的原理实现的-RSA algorithm encryption and decryption of large prime numbers based on the product to achieve the principle of irreversibility of
01
- 5位以内的对称素数.txt 5位以内的对称素数.txt-Symmetry within the five prime numbers. TxtSymmetry within the five prime numbers. TxtSymmetry within the five prime numbers. Txt
winZip
- 输入一个自然数,然后找出所有小于它的素数,并打印出来-Enter a natural number, and then identify all the prime numbers less than it, and print out
primNum
- 找到1到2000的素数,并找出连续整数和为1898的个数-1-2000 to find the prime numbers, and to identify 1898 consecutive integers and the number of