英语人>网络例句>prime number 相关的网络例句
prime number相关的网络例句

查询词典 prime number

与 prime number 相关的网络例句 [注:此内容来源于网络,仅供参考]

Software Description: XICalc is an integer calculator program with the following features: multiple precision integers with millions of digits; uses Hartley Transform to speed-up long multiplies; separate input and outputnotation, base 2 to base 36; greatest common divisor function; Modulo arithmetic options; Bernoullinumbers, Euler Numbers; Boolean functions; random number generator; prime factor algorithm using theElliptic Curve Method; number theoretic functions phi, sigma and tau; prime testing and searching using the Adleman function; algebraic notation; if-then-else statement; go-to statement; can run XICalc code from files; hot help from F1 key; and it抯 written in Microsoft Visual C#.

XICalc 是一款带有如下功能的综合性计算器软件:带有百万数位的多精度整数;使用 Hartley Transform 加速长整型多样化计算;以2到36为基数分隔输入和输出符号;最大公约数函数;模数算法选项;Bernoulli 数字;Euler 数字;布尔函数;随机数字生成器;使用圆周曲线算法的主要因素运算法则;π,τ,Σ的数字理论函数;使用 Adleman 函数的最初测试和搜索功能;代数符号;if-then-else 语法结构声明;go-to 语法结构声明;来自于文件的XICalc 代码;F1键的热点帮助;并且该软件是采用适用于 Windows 操作系统的微软 Visual C#。

The project looks for Proth prime numbers in which, for a number k, if every possible choice of n results in a composite Proth number N, k is a Sierpinski number.

项目所要寻找的Proth素数是指对一个数k,如果每一个n得到的都是合数Proth数N,则k即是斯尔宾斯基数。

In 2000, F. LUCA proved that Fermat number are anti-sociable numbers, and in 2005, M. H. LE proved all powers of 2 are anti-sociable numbers. We have used the method of M. H. LE to obtain some new results of the anti-sociable numbers. For every integer n containing prime divisors that are 1 mod 4, let p mod 4 be an arbitrary prime divisor of n. There is at least one anti-sociable number in n^2, p^2n^2, p^4n^2, and p^6n^2. Therefore we can prove that anti-sociable numbers have positive density in perfect square numbers. We also give a method to find the exact anti-sociable numbers.

LUCA证明了Fermat数都是孤立数;2005年,乐茂华教授证明了2的方幂都是孤立数,用乐茂华教授的方法给出孤立数的一些新的结果:对于任意含有4w+1型素因子的正整数n,设p为n的任意一个4w+1型素因子,则在n^2,p^2n^2,p^4n^2,p^6n^2里至少有一个是孤立数,因此可以证明孤立数在完全平方数里有正密度,另外也给出求解确定孤立数的方法。

This paper analyzes the property of FNT, the characteristics of Kernel Matrixes and the relationship between Kernel Matrixes of two-dimensional Fermat number transform whose modulus are odd prime and image data, and presents and proves the deduction of the theorem which demonstrates the relationship among different transform matrixes corresponding to different roots of unity under the same odd prime modulus of FNT, and reveals the essence of FNT whose modulus are odd prime.

分析二维Fermat数变换性质、正反变换核的特点、二维模为奇素数的二维Fermat数变换正反变换核以及与图像数据的关系,提出了不同单位根对应变换矩阵间的关系定理的推论,证明了该推论中模为奇素数的二维Fermat数变换的不同单位根对应的变换矩阵之间的关系,揭示了模为奇素数的二维Fermat数变换的本质,在构造离散图象数据Fermat数变换时为单位根的选择奠定了理论基础。

The Remark about Some Theorems of Real Number s Continuity;2. A class of fixed point theorems on a compact hausdorff topological space;3. This article has introduced some common basic natures of prime numbers,and has discussed other non-common natures and theorems of prime numbers.

主要介绍了量纲的基本概念、量纲分析的∏定理及齐次性原则,用两个实例解释了量纲分析在物理中的应用,最后指出了用量纲分析问题时应注意的问题和存在的不

The property of being a prime is called primality. Prime numbers are of fundamental importance in number theory.

20世纪的数学家们研究哥德巴赫猜想所采用的主要方法,是筛法、圆法、密率法和三角和估计等等高深的数学方法。

Seven experiments were conducted in the present study to test and verify two inferences:(1) In character decision performance, high frequency character have not character stroke and component number effect, but low frequency character is an essential condition to stroke and component number effect;(2) In prime condition, when SOA is very short (SOA=56ms), component character can prime the recognition of low frequency compound characters, but failure to prime the high frequency compound characters.

在此基础上,本文通过7个行为实验验证了这一假设的两个重要推论:(1)在字决定任务中,高频汉字不存在部件数和笔画数效应,而低频字不必然存在笔画数和部件数效应;(2)在启动条件下,当SOA较短(=56毫秒)时,成分字仅对低频合体字有启动效应,而对高频合体字没有启动效应。

The prime factors of 13195 are 5, 7, 13 and 29.What is the largest prime factor of the number 600851475143 ?

将600851475143这个数,用质数分解,问分解的质数中最大的是多少?

At the same time,Security of RSA is based on the difficulty in resolving a large number.The public key and the secret key are functions of a pair of large prime numbers.The difficulty in converting the cipher text into the plaintext through the public key equals to that of resolving the product of two large prime numbers.

RSA 的安全基于大数分解的难度,其公开密钥和私人密钥是一对大素数的函数,从一个公开密钥和密文中恢复出明文的难度等价于分解两个大素数之积。

In theory of numbers, he developed the important prime-number theorem.

重要的不仅仅是花了多少时间,而且还有与孩子交谈的方式。

第6/11页 首页 < ... 2 3 4 5 6 7 8 9 10 ... > 尾页
推荐网络例句

With Death guitarist Schuldiner adopting vocal duties, the band made a major impact on the scene.

随着死亡的吉他手Schuldiner接受主唱的职务,乐队在现实中树立了重要的影响。

But he could still end up breakfasting on Swiss-government issue muesli because all six are accused of nicking around 45 million pounds they should have paid to FIFA.

不过他最后仍有可能沦为瑞士政府&议事餐桌&上的一道早餐,因为这所有六个人都被指控把本应支付给国际足联的大约4500万英镑骗了个精光。

Closes the eye, the deep breathing, all no longer are the dreams as if......

关闭眼睛,深呼吸,一切不再是梦想,犹如。。。。。。