Examples of using Positive integer in English and their translations into Chinese
{-}
-
Political
-
Ecclesiastic
-
Programming
When n is a positive integer, there are:.
Note: All numbers(including target) will be positive integers.
It must be a positive integer(greater than 0).
There are two SQL bit types: bit(n) and bit varying(n),where n is a positive integer.
N is a positive integer and won't exceed 10,000.
A tag system is a triplet(m, A, P),where m is a positive integer, called the deletion number.
Find all positive integers n such that n has a multiple which is alternating.
There are two SQL bit types: bit(n) and bit varying(n),where n is a positive integer.
M(p, q, N)=0 if such a positive integer does not exist.
Any positive integer can be represented as the sum of one or more non-consecutive fibonacci numbers.
Mr Littlewood once told me that every positive integer is one of Ramanujan's personal friends.
The whole expression is called“power” andwritten as“x to the power of a” where‘a' is a positive integer.
Each cow has a positive integer height(which is a bit of secret).
On the front panel of a device there are: a red button,a blue button and a display showing some positive integer.
Each coordinate is a positive integer pair, and each integer is less than 32767.
SQL defines two primary character types: character(n) and character varying(n),where n is a positive integer.
A user ID(uid) is a unique positive integer assigned by Linux operating system to each user.
PostgreSQL varchar(n) SQL defines two primary character types: character varying(n) and character(n),where n is a positive integer.
Thus -20 becomes a very large positive integer and the expression evaluates to greater than 6.
PostgreSQL varchar(n) SQL defines two primary character types: character varying(n) and character(n),where n is a positive integer.
Arrays are objects, so even though each index is a positive integer, you can also add properties onto the array:.
Given five positive integers, their least majority multiple is the smallest positive integer that is divisible by at least three of them.
If it can be proved that if adecimal of the form 0. b1b2b3… is a positive integer, then it must be 0.999…, which is then the source of the 9s in the theorem.
For a positive integer n, when alpha= n/2, beta= 2, and cumulative= TRUE, GAMMADIST returns(1- CHIDIST(x)) with n degrees of freedom.
For each group, she wants to find the smallest positive integer m, such that within the group all SINs reduced modulo m are unique.
In other languages the largest positive integer will overflow, so it will work for all integers except that one.
Mike Keith defined a primeval number to be a positive integer which contains more primes(in the way discussed above) than any smaller positive integer.