搜索资源列表
primes50
- 产生大质数的算法，可以很好地研究密码学领域和数论领域的知识~ -The algorithm generates a large prime number, can be a good field of cryptography and number theory research knowledge in the field- have a large prime number algorithm, can be a good field of cryptography and number t
mode
- 进行大整数的素数分解，当中仅适用了前6个素数-The prime number decomposition of large integer, which applies only to the first six prime numbers
613
- 从文档中读入一个数字，判断这个给定的数字是否是质数。-judge wether a number is a prime number
c
- C语言的一些简单经常用到的小工具程序段，比如说冒泡排序，回文数，素数分解等等。-Some of the C language simple and often use the gadget program segments, such as bubble sort, palindrome number, prime number decomposition and so on.
5_3
- 编程习题：C语言 验证求素数公式p=n的平方+n+41-Validation seeking the prime number formula p =
segmentedsieve
- Prime number genarating algorithm based on segmenting the sieve.It generates prime no from 1 to a given range.
RSA
- 一个RSA的源代码，能够生产大素数密钥，并且能够加密字符串-An RSA source code, which can generate a large prime number keys and the encrypted string
RSAUti
- 一个完整的RSA加密代码，能够实现加解密文字，能够实现大素数的生成-A complete RSA encryption code, can realize the encryption and decryption text, can realize the generation of big prime number
ThreadingPrimeNumber
- evaluate prime number with use of multitreading
CH9
- The coefficient of a term may be any number from a specified set. If that set is the set of real numbers, we speak of "polynomials over the reals". Other common kinds of polynomials are polynomials with integer coefficients, polynomials with complex
sss_fix
- 秘密共享算法程序，带有素数判断头文件，主程序中为了简化没有使用。-Secret sharing algorithm program with the prime number judgment header files, and does not use in order to simplify the main program
dasushu
- rsa 大素数生成算法和说明 基于MATlAb-rsa large prime number generation algorithm and instructions Based on Matlab
main
- 回文素数（回文数——从左到右和从右到左是看一样的；素数——指在一个大于1的自然数中，除了1和此整数自身外，没法被其他自然数整除的数。） -Prime Palindromes（The number 151 is a prime palindrome because it is both a prime number and a palindrome (it is the same number when read forward as backward). Write a program
PrinmeNumber
- 判断输入的数字是否为素数。java开发，判断一个数是否为素数，输入数字，输出其是否为素数-input a number,the programme will see if it s a prime number,and output the result.
gy
- 在数学上，一个素数（或首相）是一个具有完全两个不同的自然数的约数：1和它本身的自然数。在许多情况下，它是不够的知道一个数是否是素数，有时，你需要知道它的因素。每大于1的正整数可以表示为一个素数的乘积。这种分解是唯一的，被称为因式分解。例如，60号可以分解成因素2×2×3×5，每个黄金。请注意，同总理可以不止一次出现在分解。请注意，同总理可以不止一次出现在分解。写一个程序，以显示一个数字n的素因子分解。-In mathematics, a prime number (or a prime) is
Fund1
- 显示1-20内的素数,更改数组大小,可以改变范围-Display within the 1-20 prime number, change the array size, you can change the scope of
guss--primes
- java编写的一个猜素数的小程序，输入一个整数，判断是否是素数-java write a small program to guess primes, enter an integer to determine whether the prime number
sushu
- 在RSA加密中，本文件实现的判断一个数是否是素数。-In the RSA encryption, to determine whether a number is prime number.
primejudge
- 筛选法法输出素数表，-到100000以内的素数，方便更改-Filter the the fafa output prime number table,- the prime numbers less than 100,000, to facilitate change
tiodhc
- 输出1010与10000之间的4未偶数，100和200之间的素数-Output 1010 and 10000 between the four is not even prime number between 100 and 200