Description: 验证：2000以内的正偶数都能够分解为两个素数之和(即验证歌德巴赫猜想对2000以内的正偶数成立)。
*问题分析与算法设计
为了验证歌德巴赫猜想对2000以内的正偶数都是成立的，要将整数分解为两部分，然后判断出分解出的两个整数是否均为素数。若是，则满足题意；否则重新进行分解和判断。
程序中对判断是否为素数的算法进行了改进，对整数判断“用从2开始到该整数的一半”改为“2开始到该整数的平方根”。原因何在请自行分析。
-certification : 2000 within the can is even divided into two prime numbers, and (that is verified Goldbach conjecture on the 2000 is even within the establishment). * Analysis and design of algorithms in order to verify the Goldbach conjecture 2000 is even within the establishment are, we should integer factorization of two parts, and then determine the decomposition of two integers whether all prime numbers. If so, that will meet Italy; Otherwise, decomposition and re-judged. Procedures to determine whether the prime of algorithms for improvements to the integral judgment "used from the beginning of the two half integral" to "the beginning of the two integral to the square root." Why not invite its own analysis. Platform: |
Size: 1036 |
Author:姚紫欣 |
Hits:
Description: 简易哥德巴赫猜想(任何一个大于6的偶数可以分解成两个素数，可以利用枚举法，先把偶数可以分解的所有奇数对列出，再判断是否为素数，直到验证成功为止)-summary Goldbach conjecture (any one of the even greater than 6 can be decomposed into two prime numbers. can enumeration method, the decomposition can even first of all to the list of odd, then judge whether the prime, until proved to be successful so far) Platform: |
Size: 1062 |
Author:yinlu |
Hits:
Description: 大数分解算法,根据算法设计分析高级教程,随机算法章节里面所讲的,mentocarlo算法改造的大数分解,能将一个大的合数分成几个素数的相乘,可以判断这个和数是不是由素数组成-factoring algorithm, algorithm design and analysis Senior Guide, randomized algorithm inside chapters have said, mentocarlo majority of the transformation algorithm decomposition can with a large number divided into several prime numbers multiply, This can be judged not by the several-several components Platform: |
Size: 9029 |
Author:jackcuijarod |
Hits:
Description: 1.验证歌德巴赫猜想(2000以内的正偶数都能够分解为两个素数之和)2.求解汉诺塔问题3.八皇后问题解法4.古典问题6.一个5位数，判断它是不是回文数等-1. Verification Goldbach conjecture (2000 within the can is even decomposition of the two prime numbers and) 2. HANOR solve three problems. 8 Queen Solutions 4. Classical 6. a 5 median It is not to judge palindrome numbers Platform: |
Size: 3672 |
Author:zhanglong |
Hits:
Description: 程序实现了大素数的判断和如果不是素数，则其可分解的最小的素数-program of large prime numbers and if the judgment is not prime, then decomposition of the smallest prime number Platform: |
Size: 5718 |
Author:car |
Hits:
Description: 程序实现了大素数的判断和如果不是素数，则其可分解的最小的素数-program of large prime numbers and if the judgment is not prime, then decomposition of the smallest prime number Platform: |
Size: 5120 |
Author:car |
Hits:
Description: 验证：2000以内的正偶数都能够分解为两个素数之和(即验证歌德巴赫猜想对2000以内的正偶数成立)。
*问题分析与算法设计
为了验证歌德巴赫猜想对2000以内的正偶数都是成立的，要将整数分解为两部分，然后判断出分解出的两个整数是否均为素数。若是，则满足题意；否则重新进行分解和判断。
程序中对判断是否为素数的算法进行了改进，对整数判断“用从2开始到该整数的一半”改为“2开始到该整数的平方根”。原因何在请自行分析。
-certification : 2000 within the can is even divided into two prime numbers, and (that is verified Goldbach conjecture on the 2000 is even within the establishment).* Analysis and design of algorithms in order to verify the Goldbach conjecture 2000 is even within the establishment are, we should integer factorization of two parts, and then determine the decomposition of two integers whether all prime numbers. If so, that will meet Italy; Otherwise, decomposition and re-judged. Procedures to determine whether the prime of algorithms for improvements to the integral judgment "used from the beginning of the two half integral" to "the beginning of the two integral to the square root." Why not invite its own analysis. Platform: |
Size: 1024 |
Author:姚紫欣 |
Hits:
Description: 简易哥德巴赫猜想(任何一个大于6的偶数可以分解成两个素数，可以利用枚举法，先把偶数可以分解的所有奇数对列出，再判断是否为素数，直到验证成功为止)-summary Goldbach conjecture (any one of the even greater than 6 can be decomposed into two prime numbers. can enumeration method, the decomposition can even first of all to the list of odd, then judge whether the prime, until proved to be successful so far) Platform: |
Size: 1024 |
Author:yinlu |
Hits:
Description: 大数分解算法,根据算法设计分析高级教程,随机算法章节里面所讲的,mentocarlo算法改造的大数分解,能将一个大的合数分成几个素数的相乘,可以判断这个和数是不是由素数组成-factoring algorithm, algorithm design and analysis Senior Guide, randomized algorithm inside chapters have said, mentocarlo majority of the transformation algorithm decomposition can with a large number divided into several prime numbers multiply, This can be judged not by the several-several components Platform: |
Size: 25600 |
Author:jackcuijarod |
Hits:
Description: 用C语言编写的RSA加密算法，利用大素数分解的原理进行加密的一种算法。-Using C language RSA encryption algorithm, the use of large prime numbers decomposition of the principle of an algorithm for encryption. Platform: |
Size: 2258944 |
Author:于磊 |
Hits:
Description: 利用大素数相乘难分解原理,实现RSA加密算法,应用于数字签名.-The use of large prime numbers multiplied difficult decomposition principle, the realization of RSA encryption algorithm, used in digital signatures. Platform: |
Size: 11264 |
Author:邓小欧 |
Hits:
Description: 一个置换密码技术的练习题及解答 另一个是RSA算法中分解两个素数的C程序.-A replacement cryptographic techniques Exercises and answer the other is the RSA algorithm in the decomposition of the two prime numbers C procedures. Platform: |
Size: 13312 |
Author:张云 |
Hits:
Description: 题目
质数分解与栈的使用
简介
只能被自身和1整除的正整数称为质数。每一个整数都可以写成质数乘积的形式，称为整数的质数分解。例如：
1776 = 37 x 3 x 2 x 2 x 2 x 2. -Title prime number decomposition and the use of stack profile only divisible by themselves and a positive integer is called prime number. Every integer can be written in the form of the product of prime numbers, called the prime number decomposition of an integer. For example: 1776 = 37 x 3 x 2 x 2 x 2 x 2. Platform: |
Size: 1024 |
Author:katrina |
Hits:
Description: DES算法全称为Data Encryption Standard,即数据加密算法,DES算法把64位的明文输入块变为64位的密文输出块,它所使用的密钥也是64位。RSA的安全性依赖于大数分解。公钥和私钥都是两个大素数（ 大于 100个十进制位）的函数。本程序为适合初学者的rsa算法java源码及des源码，开发环境eclipse3.4-DES algorithm called the Data Encryption Standard, that is, data encryption algorithm, DES algorithm to express the 64-bit input block into a 64-bit output ciphertext block, it is also used 64-bit key. RSA' s security depends on the decomposition of large numbers. Public key and private key are two large prime numbers (more than 100 decimal places) of the function. This procedure is suitable for beginners of rsa algorithm java source and des-source, development environment eclipse3.4 Platform: |
Size: 20480 |
Author:郭子 |
Hits:
Description: 流程控制学习程序，包括多层嵌套的IF-ELSE语句实例、正整数分解质因数、判断素数等-Process control learning process, including multiple nested IF-ELSE statements instance, a positive integer prime factor decomposition to determine prime numbers, etc. Platform: |
Size: 2048 |
Author:SY |
Hits:
Description: 一是利用计算机对正整数进行素因子分解认识素数，通过运用筛法与试除法寻找一定范围内的素数，体会到筛法比试除法有效但无法找出所有素数；二是通过若干特殊形式的素数的研究，寻找素数生成公式，发现一些结论；三是借助于非线性拟合技术，观察素数分布规律，利用其研究有关数论问题。-The first computer was used to prime factor decomposition of positive integers understanding of prime numbers, through the use of screening method and trial division to find prime numbers within a certain range, the division experienced a test of an effective screening method but can not identify all the prime numbers second is through a number of special form of prime numbers research, looking for prime number generation formula, found that some of the conclusions third, by means of non-linear fitting technique to observe the distribution of prime numbers, using their research on number theory problems. Platform: |
Size: 223232 |
Author:sean |
Hits:
Description: 对个一窜字符流进行大素数的加密算法，此法是基于大素数分解的原理进行-On the one-character stream channeling large prime numbers encryption algorithms, this method is based on large prime numbers decomposition principle Platform: |
Size: 1137664 |
Author:杨 |
Hits:
Description: 素数分解：、在许多情况下，知道一个数是素数还不够，还需要知道它的约数。每个大于1的正整数都能表示为素数的乘积。这个因数分解是唯一的，被称为素数分解（prime factorization）。例如60可以分解为2x2x3x5，其中每个约数都是素数。注意，同一个素数在因数分解中可以出现多次。
-Prime decomposition: in many cases, know that a number is prime is not enough, it also needs to know about the number. Every positive integer greater than 1 can be expressed as the product of prime numbers. This factorization is unique, known as prime decomposition (prime factorization). For example, 60 can be decomposed into 2x2x3x5, which are each about the number of primes. Note that, in the same prime factorization can appear multiple times. Platform: |
Size: 1024 |
Author:yf |
Hits:
Description: 在密码学中，大素数分解是一个难题，同样大素数的生成在素性检测中也是一个难点，本文主要围绕这个中心点展开-In cryptography, a large prime number decomposition is a problem, as the generation of large prime numbers primality testing is also in a difficult, this paper started around this central point Platform: |
Size: 3072 |
Author:拈龙刺穹 |
Hits:
Description: 进行大整数的素数分解，当中仅适用了前6个素数-The prime number decomposition of large integer, which applies only to the first six prime numbers Platform: |
Size: 1024 |
Author:zibin_lee |
Hits:
Search - prime numbers decomposition