Examples of using Negative integer in English and their translations into Greek
{-}
-
Colloquial
-
Official
-
Medicine
-
Ecclesiastic
-
Financial
-
Official/political
-
Computer
Negative integers are not supported.
When a is a negative integer, we have.
Negative integers are dates before December 30, 1899.
Zero is larger than every negative integer.
It can be a positive or negative integer representing day of a month from 1 to 31.
The weighting can be any positive or negative integer, or zero.
Day is a positive or negative integer representing the day of the month from 1 to 31.
It is possible to show that the gamma function is infinite for negative integers.
Find two consecutive negative integers such that the.
Calculate power of real numbers, x n, with x any real number andn a positive or negative integer.
The Fix function returns the first negative integer greater than or equal to the number.
Fliess's basic formula can be written 23x+ 28y, where x andy are positive or negative integers.
The Fix function returns the first negative integer greater than or equal to the number.
Because exactly one denominator in the infinite product vanishes when z is zero, or a negative integer.
A positive or negative integer representing the month of the year from 1 to 12.
For negative fractions"Int" returns the first negative integer less than or equal to number.
Exponentiation to a negative integer power can alternatively be seen as repeated division of 1 by the base.
This expression is also true for if the Fibonacci sequence is extended to negative integers using the Fibonacci rule.
Month is a positive or negative integer representing the month of the year from 1 to 12(January to December).
In the case of a negative number argument,the Int function returns the first negative integer less than or equal to the number;
So, if I remember right, the set of all positive integers is the same cardinality as the set of all(positive and negative) integers.
For negative fractions"Fix" returns the first negative integer greater than or equal to number.
By reversing the stepsin the Euclidean algorithm, the GCD can be expressed as a sum of the two original numbers each multiplied by a positive or negative integer, e.g.
If the number is negative, returns the first negative integer equal to or greater than number.
They are the GCD of the original two numbers.By reversing the steps, the GCD can be expressed as a sum of the two original numbers each multiplied by a positive or negative integer, e.g.
If the number is negative, returns the first negative integer less than or equal to number.
(If s is a positive even integer this argument does not apply because the zeros of the sine function are cancelled by the poles of the gamma function as it takes negative integer arguments.).
In the case of a negative number argument,the Int function returns the first negative integer less than or equal to the number;
By reversing the steps, the GCD can be expressed as a sum of the two original numbers each multiplied by a positive or negative integer, e.g., 21= 5 105+(2) 252.