搜索资源列表
submit
- 程序显示小于100 的素数 按二维表格排列- Write a Java program that prints out all the prime numbers less than 100
VC
- 求整数n的各位数字之和，并判断n是几位数，以及判断是否为素数，求最大公约数，求阶乘，多种排序方法，以及数组转置的方法-Digits and integer n and n and determine the numbers that judgment is a prime number, and the greatest common divisor, factorial, and a variety of sorting methods, as well as the array transp
Priority_queues2
- Descr iption A number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 25, 27, ... shows the first 20 humble numbers. Write a program to find and pri
Reversible_primes
- 素数幻方 求四阶的素数幻方。即在一个4X4 的矩阵中，每一个格填 入一个数字，使每一行、每一列和两条对角线上的4 个数字所组成的四位数，均为可逆素数。-Prime magic square For fourth order prime magic square.Namely in a 4 x4 matrix, fill in each case a number, make each row, each column and two of the four Numbers on the
int-linked-list
- 基于JAVA编写一个整数的链表。程序包括对dat文档读取，链表的添加，删除，和完成指定要求。-Write a program, using an IntLinkedList to read in the following file and create a list according to the rules specified. The first number is n = the number of elements to generate. In the example, this
Elgamal
- ElGamal algorithm not only used for data encryption can be used for digital signatures, their safety depends on the calculation of a finite field discrete logarithm this problem. Key to the method. First of all, choose a prime number p, the two rando
sushuhuan
- 素数环问题 把从1到20这20个数摆成一个环，要求相邻的两个数的和是一个素数。 分析：用回溯算法，考察所有可能的排列。-Central questions primes from 1-20 to 20 the number of put it into a ring, requiring two adjacent numbers and is a prime number. Analysis: backtracking algorithm to study all the possi
Java-exercise
- 输出指定范围内的素数；输出400以内的Smith数SMITH数是指满足下列条件的可分解的整数: 其所有数位上的数字和等于其全部素数因子的数字总和。-Primes within the specified range of output output within 400 Smith SMITH number refers to the number of integer decomposable satisfy the following conditions: all of its digi
rsa
- RSA algorithm including long integer type, some test algorithm, large prime number generator and the general theory of numbers algorithm
dearNumber
- 寻找10亿以内的拟亲和数，包括线性筛法求质数表、合数表，还有一些该算法实现技巧-For quasi amicable numbers less than 1000000000, including linear sieve method for prime number table, table, there are still some of the algorithm implementation skills
IsPrime
- 判断一个数是否为质数，使用BigInteger结构，进行大数的运算-To judge whether a number is prime, the use of BigInteger structure is very useful for large numbers of computing
1-p^2-1mod-p
- 从1-p^2-1中找出与p互素的元素，计算1-p^2-1模p的值，并按模值分类。已验证p=5,7。-Find numbers 1-p^2-1 which is co-prime to p，compute values mod p, and classify them according to values mod p.
PrimeRing
- 将从1到n这n个整数围成一个圆环，若其中任意2个相邻的数字相加，结果均为素数，那么这个环就成为素数环。-From 1 to n all n integers which formed a circle, if any of two adjacent numbers add together, the results were prime, then the ring would become prime ring.
[Es.-Lezione-15]-Fattori
- The program take in input a range of [a, b] returns the average number of prime factors of the numbers in the range .
primenumber
- 输入一个数字，按回车，然后输出能被这个数整除的所有数。也可以变换下程序用以检测输入的数字是否是质数（或素数）。-Enter a number, press Enter, and then output this number can be divisible by all the numbers. Transformation program can also detect whether the input to digital is a prime number (or prime).
Miller-rabbin.py
- 该程序可以实现随机产生10个大数,并用miller-rabbin方法检验是否为素数.最后产生一个大素数(The program can be implemented randomly generated 10 large numbers, and miller-rabbin method is used to test whether the prime number. Finally, a large prime number)
C语言实现的算法
- 有几个非常常用的算法比如判断是否是闰年，求三个数的最大数，判断是否是素数，输出矩阵，(There are several very common algorithms, such as whether it is a leap year, the maximum number of three numbers, to determine whether the prime number, the output matrix,)
mersenne_final
- 证明p=89、107、127、521、607、1279时Mp=2p-1是Mersenne素数，并打印出这些数的所有位数(It is proved that when p=89, 107, 127, 521, 607, 1279, Mp=2p-1 is the prime number of Mersenne, and all the digits of these numbers are printed ou)