素數的 的英文怎麼說

中文拼音 [shǔde]
素數的 英文
prime
  • : Ⅰ形容詞1 (本色; 白色) white 2 (顏色單純) plain; simple; quiet 3 (本來的; 原有的) native Ⅱ名...
  • : 數副詞(屢次) frequently; repeatedly
  • : 4次方是 The fourth power of 2 is direction
  1. In view of this situation and the characteristic of qualitative variable as well as quantitative variable of the geological factors affecting coal seam affusion, put forward the application of numerical theory on the basis of optimization study of orthogonal design to confirm the optimal combination of the technical parameters of coal seam affusion when geological factors is in precarious state and then proceed optimization study with instances

    針對這種情況及影響煤層注水地質因既有定性變量,又有定量變量特徵,本文在利用正交設計優化研究基礎上,提出利用量化理論確定地質因為不穩定狀態下煤層注水工藝參最優組合,並結合實例進行了優化研究。
  2. Generally, this problem is reduced to quadratic residue problem of modulo a big prime number

    一般而言,該問題歸結為模大素數的二次剩餘問題,但這種歸結不能用於最優擴域oef 。
  3. The distribution law of prime number in natural number

    關于正整列中素數的分佈規律
  4. What is the probability that it is a prime ?

    素數的概率是多少?
  5. On series made up of reciprocals of prime number

    試論素數的所組成
  6. The application of prime number to image scrambling

    基於素數的圖像置亂技術
  7. Some resuits on prime numbers and twin numbers

    關于和孿生素數的注記
  8. According to the principle of generation of prime number through boolean algebra logic operation and phase angle matrix analysis of the periodic function it comes out that any even number larger than 4 can be expressed as the sum of two prime numbers , i. e. “ 1 + 1 ” is tenable, and thereby finishes demonstration of the validity of goldbach ' s conjecture

    根據素數的形成機理,從布爾代邏輯運算和周期函相角矩陣分析,都得出了大於4任何偶都可表示成兩個之和即「 1 + 1 」成立,從而完成了哥德巴赫猜想成立論證。
  9. A note on the least prime in an arithmetic progression

    關于算術級中最小素數的注記
  10. A cluster of anntithesis formulas on improper primes

    關于偽素數的對偶公式簇
  11. There is an infinite number of primes

    素數的目是無限
  12. The safficiently important conditions for distinguishing twin improper primes

    關于判別孿生偽素數的充要條件
  13. Never before have mersenne primes been bunched so closely together

    之前梅森素數的分佈從未像現在這般稠密。
  14. A special property of prime numbers and its applications in generating quasi - random numbers

    素數的一個特殊性質及其用於偽隨機生成方法
  15. Because, at the bit - length of typical keys, very few numbers are primes, public - key systems must use very large keys to prevent exhaustive searches that try to guess the prime numbers used or to factor the keys

    就典型鑰匙位長而言,因為素數的目是非常少,故公開密鑰系統必須使用非常大密鑰,以防止窮盡研究把使用猜出來或把密鑰因子算出來。
  16. Is the eth residue of p. since the number of quadratic residue mod p is, we can guess the number of eth residue mod p is 2 ^, and then prove this property. on the basis of eth residue, we construct a type of eth residue code of length p which is an odd prime, and extend some properties of quadratic residue codes. alsi ) we construct a cubic residue code over f % of length 31 and a 4th residue code over fs of length 13. according to the properties of the bounds of bch codes, we determine the minimal distance of [ 31, 21 ] code is 5, which means this code ; can correct two errors

    由模p二次剩餘個為個,可猜測模pe次剩餘為個,本文給出了該性質證明。在e次剩餘基礎上,本文構造了一類字長p為奇素數的e次剩餘碼,討論了它性質,從而推廣了二次剩餘碼一些結果。利用所導出理論結果,我們構造了長為31二元三次剩餘碼和長為13三元四次剩餘碼,利用bch碼上下界性質,進一步確定了31 , 21碼極小距離為5 ,它可以糾正兩個錯誤。
  17. The chance that the exponent you are testing will yield a mersenne prime is about 1 in 143369

    你正在測試產生一個梅森素數的概率是1 / 143369
  18. The last 5 mersenne prime exponents all fell between 224 and 225 - - and we haven ' t finished testing all the exponents in that range

    最後5個梅森素數的均在2 ^ 24與2 ^ 25之間? ?並且這一范圍內我們還沒有全部檢測完。
  19. When looking at the exponents, we expect only 1. 78 mersenne primes between powers of two, and prior to 2003, a maximum of 3 mersenne primes were found between powers of two

    在仔細觀察了所發現梅森指之後,我們發現在2兩個連續冪次之間平均只有1 . 78個梅森素數的,在2003年之前, 2兩個連續冪次之間最多有3個梅森素數的
  20. Asymmetric - key cryptography, which we will discuss in chapter 10, is based on some topics in number theory, including theories related to primes, factorization of composites into primes, modular exponentiation and logarithm, quadratic residues, and the chinese remainder theorem

    我們將在第十章中討論非對稱密鑰密碼學,非對稱密鑰密碼學基於一些論題,這些論題與、把復合分解為素數的分解、模指與模對、二次剩餘和中國剩餘定理有關。
分享友人