搜索资源列表
Primes2
- 基于java的哥德巴赫猜想算法的实现，验证任何大于5的奇数都可以表示为3个素数之和。-Java Goldbach Conjecture algorithm-based implementation to verify any odd number greater than 5 can be expressed as three prime numbers.
C-yuyan
- 判断101-200之间有多少个素数，并输出所有素数。-Judgment 101-200, the number of prime numbers, and output of all prime numbers.
C
- 如何用C语言筛选法判断质数 比如输出 2 质数 4 合数 0 0代表程序的结束，如果输入不是零，程序可以继续打入数字判断 -How to use C language such as screening method to determine prime numbers prime numbers 2, 4-output number 00 on behalf of the end of the program, if the input is not zero,
calculate2
- 数学计算工具，可计算任何数的阶乘，最大公约数，最小公约数，显示任何数是否是素数，显示菲波拉契数列的前N项，对任意十个数进行排序-Mathematical tools, calculates the factorial of any number, the common denominator, the minimum divisor, display any number whether it is prime, show Feibo Appalachian series before the
Desktop
- /* Program to find whether the given number is a Prime or not*/- /* Program to find whether the given number is a Prime or not*/
Fermat
- Fermats test to check for primality. Code is in java. takes a e=random number and gives whether it is prime or not.
rsa
- RSA 金鑰 用以下的方式來產生一個公開金鑰和一個私密金鑰： 1. 隨機選擇兩個的質數p和q，p不等於q，計算N=p*q。 2. 選擇一個整數e，e與(p-1)*(q-1)互質，並且e小於(p-1)*(q-1) 。 3. 求一個值 d，d<(p-1)*(q-1)，且(d*e)除以((p-1)*(q-1)) 的結果，其餘數為 1。 4. 將p和q的記錄銷毀。-RSA keys in the following way to generate a public key an
求s=a+aa+aaa+aaaa+aa...a的值
- 题目8：求s=a+aa+aaa+aaaa+aa...a的值，其中a是一个数字。例如 2+22+222+2222+22222(此时共有5个数相加)，几个数相加有键盘控制。 -Title 4: a positive integer decomposition of prime factors. For example: input 90, print out 90 = 2* 3* 3* 5. Title 8: o s = a+ aa+ aaa+ aaaa+ aa
寻找梅森素数的程序
- 本程序是一个寻找梅森素数的程序，通过本程序可以很快地判断一个数字是否是梅森素数。-This procedure is a find Mersenne primes program through this program, you can quickly determine whether a number is a Mersenne prime.
New_RSA
- 一种改进的RSA算法。RSA是目前最有影响力的公钥加密算法，它能够抵抗到目前为止已知的所有密码攻击，已被ISO推荐为公钥数据加密标准。RSA算法基于一个十分简单的数论事实：将两个大素数相乘十分容易，但那时想要对其乘积进行因式分解却极其困难，因此可以将乘积公开作为加密密钥。-An improved RSA algorithm. RSA public key encryption algorithm is the most influential, and it can resist all so
12-5
- 判断完数，判断质数，求阶乘，判断字符，输出菱形-Judge finished number to determine prime numbers, factorial judge character, output rhombus
sushu
- 用于判断一个数是否为素数的matlab源代码-Matlab source code used to determine whether a number is prime
Goldbach-Guess
- 验证歌德巴赫猜想 puts("=== === === === === === === === === === ") puts("|| This program will verify the Goldbach Guess. ||") puts("|| That is any positive even number can be broken up into ||") puts("|| the sum of two prime numbers. ||") p
heshufengjie
- 请输入一个合数，把它分解为数个质数相乗的形式，并显示！-Enter a composite number, it is decomposed into prime numbers multiplied form
C-language-and-a-classic-code
- 该资源有28个经典的C语言代码，包括两数交换、考试成绩转换成等级分、判读闰年、求平均、求最大值、求最小值、统计个数、最大公约数、求 n 的阶乘、打印九九乘法表、求 100 以内的素数、求水仙花数、用函数求 x 的 n 次幂-28 classic C language code of the resource, including the exchange of two numbers, test scores convert level interpretation of the leap ye
GeDe
- 验证哥德巴赫猜想 哥德巴赫猜想如下：1.任何大于2的偶数都可以表示为两个素数之和；2.任何大于5的奇数都可以表示为3个素数之和。-Validation goldbach conjecture goldbach conjecture as follows: 1. No more than 2 even can be expressed as the sum of two prime Numbers 2. No more than 5 odd number can be expressed as
Miller-Rabin_primality_test_(Java)
- Miller Rabin:Just like the Fermat and Solovay–Strassen tests, the Miller–Rabin test relies on an equality or set of equalities that hold true for prime values, then checks whether or not they hold for a number that we want to test for primality.
RSA
- 该程序使用RSA公钥算法实现了对一个字符串的加密和解密功能。其中，采用欧几里德算法（即辗转相除法）来判断两个数是否是素数。另外，使用菜单选项来选择当前是要“加密”还是“解密”。-The program use RSA public key algorithm is presented for a string of encryption and decryption function. Among them, the Euclidean algorithm (namely division al
qiuzhishu
- 一个求指定数以内的质数的函数，自己编写的，希望能帮助大家-A specified number within the prime function, the preparation of their own, hoping to help you
c-program-100-exmples
- c语言若干个经典的程序案例，包括菲比那切数列问题，鸡兔同笼问题，素数问题，闰年问题，水仙花数问题，完数问题-c language a number of cases of classic program, including Phoebe that cut the number of columns of the problem, chickens and rabbits with cage problem, prime numbers, the leap year problem, daffo