搜索资源列表
RsaTool.自己写的RSA算法工具
- 自己写的RSA算法工具。支持RSA密钥产生（包括CRT）、RSA运算、强素数生成、大数运算等功能。用了的都说好。,Writing their own tools of the RSA algorithm. Support for RSA Key Generation [including CRT], RSA computation, strong prime number generation, large numbers computing functions. Use of that goo
shushu
- 求素数的程序，用了一些标准库．不难，但很有用-Prime number for the procedure, using a number of standard library. It is not difficult, but very useful
prime
- 题目 质数分解与栈的使用 简介 只能被自身和1整除的正整数称为质数。每一个整数都可以写成质数乘积的形式，称为整数的质数分解。例如： 1776 = 37 x 3 x 2 x 2 x 2 x 2. -Title prime number decomposition and the use of stack profile only divisible by themselves and a positive integer is called prime number. Ever
primes
- 该程序用以查找任意两个整数之间的所有素数。 Prime number finder can find all primes between a and b and will write the results to the file PRIMES.TXT-The program used to search any two integers all prime numbers between. Prime number finder can find all primes between a a
prime
- 素数环： 把从1到10这10个数摆成一个环，要求相邻的两个数的和是一个素数。 〖问题分析〗 这是一道回溯的题目。从1开始，每个空位有9种可能，每种可能加入约束条件即可 1.与前面所有的数不重复 2.与前一个数和为素数（最后一个和第一个也要满足）。 〖算法流程〗 1、数据初始化； 2、递归填数： 判断第J种可能是否合法； A、如果合法：填数；判断是否到达目标（10个已填完）： 是，打印结果；不是，递归填下一个； B、如果不合法：选择下一种可能；-Prime Centra
Miller-Rabin-c
- 求质数的算法之Miller-Rabin费马小定理-Prime number for the Miller-Rabin algorithm of Fermat' s Little Theorem
Calculate-prime-number-less-than-100
- 计算100以内的质数 计算100以内的质数 -Calculate prime number less than 100
Screening-and-m-prime-number
- 用筛选法求m内的素数，给一个数求其是几位数，并输出每位数-Screening and m within a prime number, give a number for its several numbers, and the number of output per person.
RSA-prime-number
- RSA的实现，内含有一个大素数类，很实用。-The realization of RSA, contains a large prime number class, very practical.
prime-number
- 实现查询质数的功能，并能查询数目,可以在所有质数中查询 -check the prime number
C-program-for-prime-number-
- Prime number program in c: c program for prime number, this code prints prime numbers using c programming language. To check whether a number is prime or not see another code below. Prime number logic: a number is prime if it is divisible only by one
c-program-for-generate-first-n-prime-number
- prime number program
prime-number-in-1~100
- 求1~100中间的素数代码, -Find a prime number to 100 in the middle of the code, find a prime number to 100 in the middle of the code,
Prime-number
- Delphi:编写Delphi判断素数的程序，程序窗体如上图所不，输入任意一组数字，点击右下角的“判断”按钮，程序立即给出结果，是不是素数，一眼便知。当然，本程序只是一个向Delphi初学者演示Delphi算法的小例子，并无实际意义，单纯的判断素数意义不大。 -Delphi: Delphi written judgment prime numbers, the program form shown above do not enter any set of numbers, click on
prime-number-calculation
- 此程序作为素数计算的一个方案，用户自行输入计算数位-prime number calculation
prime-number
- c语音结构化实现素数功能，实现模糊筛选功能-C speech structured function of prime number fuzzy filtering functions
prime-number
- 求解质数，利用bitset实现，非常适合求解答大质数。-Solving prime number, use bitset implement, ideal for large prime numbers seeking answers.
prime-number
- 输入一个正整数，结果输出小于这个整数的所有素数-prime number
output-prime-number
- 判断101-200之间有多少个素数，并输出所有素数。-output100-200 prime number
Prime search
- 素数查找功能的程序，适用于C语言。质数（prime number）又称素数，有无限个。质数定义为在大于1的自然数中，除了1和它本身以外不再有其他因数，这样的数称为质数(The prime search function program is suitable for C language. Prime number, also known as prime number, there are infinite. The prime number is defined as a natural n