engleză

arabă catalană cehă chineză coreeană daneză ebraică engleză farsi franceză germană greacă hindi italiană japoneză maghiară olandeză poloneză portugheză română rusă slovacă spaniolă suedeză thai turcă ucraineană Vietnamese

chineză

Definiție arabă catalană cehă chineză coreeană daneză ebraică engleză farsi franceză germană greacă hindi italiană japoneză maghiară olandeză poloneză portugheză română rusă slovacă spaniolă suedeză thai turcă ucraineană Vietnamese

Favorite

Publicitate

large integer

Definiție

number with many digits ... Afișați mai multe

Traducere "large integer" în chineză

Definiție

large

大大型大量巨大庞大

integer

整数整型整數

This filter converts a large integer to a friendly text works best for numbers over 1 million.

该过滤器将一个很大的整数转换成友好的文本表示方式。它对于超过一百万的数字最好用。

RSA algorithm is considered as one of the relatively safe crypto-system, and the multiplication of large integer is the key operation in fact.

RSA算法是目前被认为可以实现安全通信的理想的公钥密码体制之一，其主要操作实际上是一系列基本的大整数模乘运算。

Encryption module of large integer multiplier and RSA module

大数乘法器加密模块以及RSA模块

SAMPLE has the format SAMPLE k, where k is a decimal number from 0 to 1, or SAMPLE n, where 'n' is a sufficiently large integer.

SAMPLE子句可以使用SAMPLE k来表示，其中k可以是0到1的小数值，或者是一个足够大的正整数值。

Alte rezultate

The computation involved finding the sum of several large integers quickly.

这次运算要快速算出若干个大整数的总和。

Indicated datagram too large - integer overflow

指示数据报太大 - 整数溢出

Map large Integers to smaller Integers,

将大整数映射成较小的整数，

This method of dealing with large integers is slower than utilizing a CPU with higher integer size, but is a reasonable trade-off in cases where natively supporting the full integer range needed would be cost-prohibitive.

虽然这种处理大整数的方法会比使用拥有高整数精确度的CPU要慢一些，对于处理那些需要大精确度整数的应用，它是一种可取的方法，特别是整数精确度的原生支援成本过高的时候。

In it Vinogradov proved that every sufficiently large odd integer can be expressed as the sum of three primes.

在这维诺格拉多夫证明，每一个足够大的奇数整数可表示的总和三个素数。

For example, Vinogradov proved that every sufficiently large odd number is the sum of three primes, and so every sufficiently large even integer is the sum of four primes.

例如Vinogradov證明了每一個夠大的奇數都可以表示為三個質數的和，以及所有夠大的偶數都可以表示都可以表示為四個質數的和。

Assumption: If the items to be sorted are Integers with large range but of few digits, we can combine Counting Sort idea with Radix Sort to achieve the linear time complexity.

假设：如果要排序的项目是大范围但小数位的整数，我们可以将计数排序（Counting Sort）思想与基数排序（Radix Sort）结合起来，以实现线性时间复杂度。

Issue 1: We have seen a simple hash function like the h(v) = v%997 used in Phone Numbers example that maps large range of Integer keys into a smaller range of Integer keys, but how about non Integer keys? How to do such hashing efficiently?

问题1：我们已经看到了一个简单的散列函数，如电话号码示例中使用的h（v）＝ v％997，它将大范围的整数键映射到整数键的较小范围内，但非整数键的情况如何？如何有效地做这样的散列？