搜索资源列表
验证歌德巴赫猜想实验
- 验证歌德巴赫猜想 （1）：任何大于6的偶数都可以表示为两个素数之和：如8=5+3 （2）：任何大于5的奇数都可以表示为三个素数之和：如：11=3+3+5-certification Goldbach conjecture (1) : any of the even greater than 6 can be expressed as two prime numbers and : 800 = 5 3 (2) : No more than five odd numbers can be e
Relatives
- 求小于n的互素的个数 Given n, a positive integer, how many positive integers less than n are relatively prime to n? Two integers a and b are relatively prime if there are no integers x > 1, y > 0, z > 0 such that a = xy and b = xz. There are s
qipan
- 棋盘填数问题 在N*N的棋盘上（1<=N<=10）请填入1，2，...N2共N2个数，使得任意两个相邻的数之和为素数。 填写的方案如： 在这里我们约定：左上角的格子里必须放数字1。 输出：如有多种解，则输出第一行，第一列之和为最小的排列方案；若无解，则输出“NO Answer”-chessboard fill in N * N on the chessboard (1LT; = Nlt; = 10) Please insert 1,2, ... N2 N2 total number,
chess
- 在N*N的棋盘上(1<=N<=10)填入1,2,...N*N共N*N个数,使得任意两个相邻的数之和为素数.输出满足条件的最小序列的方案。 最小序列即将每一行连接起来组成一行，然后使前面的尽可能小，当第一个数字相同时则比较下面一个，依次类推。 比如当Ｎ＝２时，序列为1 2 4 3，当无满足条件的方案时输出"NO"。 -In the N* N chessboard (1 < = N < = 10) filled 1,2, ... N* N total numbe
11
- 輸入一個數字判斷質數,範例輸入 : 2 3 25 範例輸出 : Yes Yes No-Enter a number to determine prime number, model type: 2325 Sample Output: Yes Yes No
Assignment_1
- Exercise 1: cryptarithm_array.c (2.5 marks). A cryptarithm is a puzzle where digits have to be assigned to the letters of some words, di erent letters being assigned di erent digits, and no word starting with 0, such that a number of conditions
Sieve.cpp
- A c/c++ program using threads to find prime no using sieve of eratosthenes.
test1
- 请编写一个面向无连接的基本SOCKET套接字的C/S通信程序。本题属于其服务器端，程序的要求是：创建一个数据报式套接字，并与本地的20005号端口进行绑定，等待客户端发来的一个int数据，收到数据后，将这个int整数输出，并判断它是否为一个素数（判断结果用0和1表示，0表示“否”， 1表示“是”），然后将判断结果回送给对方，最后关闭套接字，退出系统。-Please write a basic connectionless-oriented socket SOCKET C/S communicat
CODE_UPLOAD1474
- PStat v1.2--a generalized framework for executing a lengthy operation in a thread. For developers who use MFC, this is a freeware module which provides a single easy to use function which allows one of your functions to be executed in a separate thre
ml
- Miller rabin. This is implementation of miller rabin to find if the given no. is prime or composite.
pattern_matching
- 分别用KMP、Monte Carlo 和Las Vegas 算法编制3 个程序，随机生成不小于5000 对、 长度很长、且长度不等的01 串X 和Y（三个程序生成 相同的串），然后统计算法的执行时间、Monte Carlo算法出错的比率，并根据运行结果对三种算法进行深入的比较。注意， 先利用本题下方所给素数实现上述算法，学完素数判定 算法之后，将该算法编程，产生一定数量的大素数并用数组保存起来（分别试不超过5000、500000、50000000），以供上述随机算法使用-The
pr1
- Prime no generator in a given range upto 10^9
segmentedsieve
- Prime number genarating algorithm based on segmenting the sieve.It generates prime no from 1 to a given range.
1-to-100-prime-no
- Print the nos between one and hundrad
prime-no
- print and find prime numbers
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
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
Program
- 5 program of c++.These names are find Prime no,Vowel or not
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
prime no
- it is a program to descrkhbdsidsvdssg fdsgdgd