素数问题

词组短语

prime number problem

与素数问题相关的网络例句 [注：此内容来源于网络，仅供参考]

Since the problem of GVT with two primes restricted in arithmetic progressionsof the same moduli k is actually the same as the previous problem(2),we consideredthe problem of GVT with exactly one prime in an arithmetic progression.

两个素数取值于相同模的算术级数中的GVT问题实际上和前面的的问题（2）是一样的，于是只需考虑一个素变数在算术级数中取值的奇数Goldbach问题。

Thus the above results imply the well known Linnik Theorem[21]on the leastprime in an arithmetic progression,and our result(2)implies 〓,(3)implies

因而上述问题均蕴含了Linnik关于算术级数中最小素数的著名定理。作为直接推论（2）和（3）分别蕴含了Linnik常数≤34和≤128/9。

Usually we just use the circle method to deal with many additive prime problems, including the one in this paper.

我们经常只用圆法去处理堆垒素数问题，包括本文的课题。

Second, we discuss the problem of four class equation Dx~2 +1 = y~p (p≥5 and p is a prime ,D = 31,47, 71, 79) without nonzero integer solution.

二。讨论了四类方程Dx~2+1=y~p(p≥5且p为素数，D=31，47，71，79)非零整数解的问题，得出 1。

The Discrete Logarithm Problem was analyzed. Based on the discrete logarithm in the prime field, and combined with the elliptic curve DLP in the limited domain, a new digital signature was brought up.

分析了离散对数问题，以素数域上的离散对数为基础，同时结合有限域上的椭圆曲线离散对数问题，提出一种新的数字签名方案，其安全性建立在离散对数算法上。

This paper first analyses and summarizes the ststus quo and evolution trend of encryption, some common used cryptograph are introduced, including the algorithms used in symmetric cryptosystem and asymmetirc cryptosystem. We describe the theory of each algorithms and compare the elliptic curve cryptosystem with the other two asymmetric cryptosystems to show the advantages of this algorithm. Second, the principle of ECC is discussed, including the math foundation of ECC, basic conception of elliptic curves, constructiong idea of ECC, operation on the elliptic curve and so on. Third, the current attacks of ECC were analyzed deeply, and an algorithm based on limited prime number field was constructed. We analyzed its realizability in theory, and implement it by using certain function of MIRACL software package. Latter half in this paper, the implementation model of a simple elliptic curve encryption system which based on GF has been introduced. The paper also put a deep analysis on the algorithm of point addition and point multiplication.

本文首先对密码技术的发展现状及其发展趋势进行了分析和综述，详细的介绍了私钥密码系统和公钥密码系统的发展，说明各种算法的原理和优缺点，并给出了一些典型的密码体制的简要分析，重点将椭圆曲线算法与其它几种公钥密码算法比较，说明椭圆曲线算法的优势；其次，探讨了椭圆曲线密码体制的原理，包括椭圆曲线密码的数学基础、基本概念、椭圆曲线密码体制的构造思想等问题；第三作者对椭圆曲线的攻击现状作了详细的分析，针对所使用的大素数域F_p，设计了素数域上安全椭圆曲线产生的算法，从理论上做了可实施性分析，从软件上做了具体实现；在本文的后半部分，提出了一个简单的基于有限素数域上的椭圆曲线加密方按算实现模型，并对SECES中设计的点加和点乘运算进行了深入分析。

Dynamic programming algorithm was introduced to solve the problem. Based on discussion of calculation complexity and effectiveness, the exact DP Algorithm was successfully used in operative schedule of the collecting bucket in multi-car-single-layer mode, which has few service nodes. For problems with large number of service nodes, restricted DP algorithm was constructed to avoid rapid expand in calculation and memory demands during programming process. The restricted DP algorithm, successfully used in single-car-multilayer and compound service modes, gets balance between near optimal programming results and reasonable programming time, so as to meet the real time schedule demands.

文中首先在TSP-STW问题的动态规划模型基础上，论述了计算机精确动态规划解法的求解策略和方法以及算法的有效性和复杂性，并将其成功应用于服务节点数相对较少的多小车单层配药服务模式中集中料斗的集药动作规划；在进行服务节点数较多的单小车多层服务模式中取药小车的运动规划时，为限制计算量和存储空间需求的迅速膨胀，引入以合理限制动态规划算法在每一阶段保留的最大状态元素数为核心的有限动态规划法，以便在求解结果的优化程度和规划时间上取得均衡，达到实时调度的要求。

This is a feasible method for solving both the Goldbach problem and the problem of twin primes.

这是解决Goldbach问题和孪生素数问题的切实可行的方法。

Partition sieve; Integer classification sieve; Ethereal sieve; Goldbach problem; Problem of twin primes

分割筛法；整数分类筛法；轻筛法；Goldbach问题；孪生素数问题

Sifting function partition by integer sort; Selberg's sieve; Goldbach problem; Problem of twin primes.

筛函数按整数类别分割；Selberg筛法；Goldbach问题；孪生素数问题。

与素数问题相关的网络解释 [注：此内容来源于网络，仅供参考]

prime number problem：素数问题

prime number 素数 | prime number problem 素数问题 | prime number theorem 素数定理

Prime：素数

通过用多种方法解决一个问题,学会比较不同策略的方法,以及如何选取最佳的策略. 判断一个策略是否为算法,要看这个策略是否满足 1)定义明确,无二义性 2)有效性,即它的步骤都是可行的 3)有限性 X.1测试素数 素数(prime)问题是

problem of moments：矩问题

problem of geometrical construction 几何准问题 | problem of moments 矩问题 | problem of prime twins 孪生素数问题

problem of prime twins：孪生素数问题

problem of moments 矩问题 | problem of prime twins 孪生素数问题 | problem on obstacle 障碍问题

problem on obstacle：障碍问题

problem of prime twins 孪生素数问题 | problem on obstacle 障碍问题 | process 过程