搜索资源列表
A Prime Number Generator
- Threw history,prime numbers has always be a great fascination for mathematicians. Even in modern times,primes numbers continues to fascinate many people.Probably the main reason why prime numbers continues to create such great interest would be becau
loop
- 编程实现素数环的程序，很有意思，程序不是很复杂，很容易看懂。-Programming prime ring procedures, very interesting, is not a very complicated procedure, it is easy to understand.
RSA_CS
- C#的RSA加密解密算法程序，罗宾-米勒素数检验法，学信息安全的同学可以拿去-CSharp the RSA algorithm for encryption and decryption procedures, Robin- Miller, prime number test, students learn information security can be taken away
hhs
- 此程序可以求质数的和,例如F 7 =1+3+5+7+11+13+17=58 -this program can evaluation the sum of prime number
Forfourthordermagicsquareofprimenumbers
- 求四阶的素数幻方,在一个4X4 的矩阵中，每一个格填 入一个数字，使每一行、每一列和两条对角线上的4 个数字所组成的四位数，均为可逆素数。思考题：用1到16构成一个四阶幻方，要求任意相邻两个方格中的数字之和均为素数。-For fourth-order magic square of prime numbers, in a 4X4 matrix, each populated with a number grid so that each row, each column and two of t
ssstthh
- 温湿度传感器SHTxx的驱动程序；主要是采用盛世瑞恩的芯片；精度高。-Temperature and humidity sensors SHTxx driver mainly by Prime Ryan chips precision.
prime
- Program to check whether an entered number is prime or not.
ShaGame
- 没事时写的一个"杀人"的小游戏，素界面。-Nothing when writing a "kill" game, prime interface.
C_Numerical_calculation_array_request
- C#计算数组数值总和并求其中的素数C # Numerical calculation of the sum of the array, and request one of the prime number-vC# Numerical calculation of the sum of the array, and request one of the prime number
primeNumber
- 求1000以内的质数，自己实现的程序，算法的时间复杂度较好-Find prime numbers less than 1000
PrimesOnCore2
- It is a program that runs on multiple core. sample program demonstrate the thread affinity to cores of processors. Calculates prime numbers.
sushu
- 输入两个数，先判断数值的大少，输出两个数之间的所有素数-Enter the two numbers, first determine the value of large and small, the output of two numbers of all prime numbers between
1
- 寫一個程式，從資料檔(a.txt)讀入一個正整數，把它的所有質因數找出來。-Write a program, from the data file (a.txt) reads a positive integer, it' s all the prime factors to find out.
01_PrimeNumberFinder
- 这是prime number finder的程序，也就是对质数的判别和寻找。-This is a prime number finder program, which is the identification and finding prime numbers.
JudgePNum
- 输入数字，并判断输入的数字是否是素数，是的话返回1.-Enter the numbers and determine whether the number entered is prime, it is, then return to 1.
Archimedes
- 數學大師歐勒(Euler) 找到一個計算圓周率的無窮乘積 : pi/2 = 3/2 * 5/6 * 7/6 * 11/10 * 13/14 * 17/18 * 19/18 * 23/22 * … 有趣的是, 這公式裡, 所有分子都是大於 2的質數, 分母則是不能被 4整除, 且最接近分子的偶數. -Math Masters Euler (Euler) a calculation of pi to find the infinite product: pi/2 = 3/
Prime_Number_Algorithm
- Prime algoritm Sieve and isPrime
PrimeAlogrithm
- 实现prime算法，并且有界面，可以帮助大家更好的理解算法的实现过程。-Prime algorithm to achieve, and there are interfaces that can help you better understand the algorithm implementation process.
Main.cs.tar
- some algorithms like check even check prime triangle area modifying bits in a given bit pattern
1.3-Prime-Cryptarithm
- usaco Prime Cryptarithm 答案-usaco Prime Cryptarithm answer