搜索资源列表
sushusuanfafenxi
- 介绍利用VisualBasic语言判定和筛选素数的基本算法及改进方案。-VisualBasic language to introduce the use of prime numbers and screening to determine the basic algorithm and improve the program.
sushuqiuhe
- 实现1到100的素数求和，首先要判断哪些是素数，然后在迭代相加-Achieve 1-100 sum of prime numbers, we must first determine which is the prime number, and then add in the iterative
PrimeNumber
- prime number to detection with labview only for numbers that greater than 9
rsa
- 1、编写程序构造一RSA密钥； 2、编写程序实现快速指数算法； 3、编写程序生成大素数； 4、实现RSA密码体制 -1, the preparation of procedures for constructing a RSA key 2, the preparation of procedures for fast index algorithm 3, the preparation process to generate large prime numbers 4, t
qiusushugeshu
- 本程序介绍完成读入1000个数的操作，并求出其中素数的个数。-This procedure describes the number of completed read operation 1000, and calculated the number of prime numbers of them.
chuanshuo
- 判断素数的方法：用一个数分别去除2到sqrt(这个数)，如果能被整除， 则表明此数不是素数，反之是素数。-Method to determine the prime numbers: a number were removed 2 to sqrt (this number), if divisible, it indicates that this number is not prime, and vice versa is a prime number.
JAVA
- JAVA小程序 100以内全部素数 完数 P102 T16----英文字母表，希腊字母表-JAVA applet prime numbers less than 100 all finished number P102 T16---- English alphabet, Greek alphabet
example14
- 题目：将一个正整数分解质因数。例如：输入90,打印出90=2*3*3*5。 程序分析：对n进行分解质因数，应先找到一个最小的质数k，然后按下述步骤完成： (1)如果这个质数恰等于n，则说明分解质因数的过程已经结束，打印出即可。 (2)如果n<>k，但n能被k整除，则应打印出k的值，并用n除以k的商,作为新的正整数你n, 重复执行第一步。 (3)如果n不能被k整除，则用k+1作为k的值,重复执行第一步。-Topic: the prime factors o
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
sushu12312
- java打印1-100之间的素数，每行打印5个-java print the prime numbers between 1-100, each line of print 5
Even-break-down
- 输入一串数，将偶数分解为两个质数，如8=3+5，只取第一组，就是后面出现的8=5+3不再打印。-Enter a string of numbers, the even number into two prime numbers, such as 8 = 3+5, just take the first group, is behind the emergence of 8 = 5+3 no longer print.
q
- 一般常用的c++实例，希望能对大家有用，包括以下内容简单计算器、累加一行字符中的数字、求素数、打印菱形等-Commonly used c++ instance, we hope to be useful, including the following simple calculator, cumulative figures in his characters, find prime numbers, print diamond, etc.
Prime
- 判断101-200之间有多少个素数，并输出所有素数。 1.程序分析：判断素数的方法：用一个数分别去除2到sqrt(这个数)，如果能被整除， 则表明此数不是素数，反之是素数。 -Discrimination of prime numbers
qiusushu
- 请认真编写一段C语言程序，求100-200之间的全部素数。-Please carefully write a C program, find all the prime numbers between 100-200.
assignment2
- Matlab program for bisection method, simpson s rule,newton raphson method,secant method, program to find prime numbers between two given numbers,sum of specific column
The-prime-is-stored
- 请编写函数fun,函数的功能是：将大于形参m的且紧靠m的k个素数存入XX所指的数组中。-Please write a function fun, function function is: greater than the parameter m and m close to the k prime numbers into an array XX referred to in.
PrimeNumberTheorem.nb
- Formalizes asymptotic distribution of the prime numbers among the positive integers that is, the intuitive idea that primes become less common as they become larger by precisely quantifying the rate of occurrence.-Formalizes asymptotic distribution o
zhaomayabng
- 计算素数的个数并挑选出矩阵中满足序号为素数的数(Calculate the number of prime numbers and pick out the number in the matrix that satisfies the ordinal number)
acm
- A message from humans to extraterrestrial intelligence was sent through the Arecibo radio telescope in Puerto Rico on the afternoon of Saturday November 16, 1974. The message consisted of 1679 bits and was meant to be translated to a rectangular pict