Examples of using Positive integer in English and their translations into Italian
{-}
-
Colloquial
-
Official
-
Medicine
-
Financial
-
Ecclesiastic
-
Ecclesiastic
-
Computer
-
Programming
-
Official/political
Mr. Littlewood once told me that"every positive integer is one of Ramanujan's personal friends.
that"i" is less than"n" because zero is less than any positive integer.
We're going to choose 0 to start out greatest value, because 0 is smaller than any positive integer.
is a positive integer that is the product of three distinct prime numbers.
Zeckendorf's theorem states that every positive integer can be represented uniquely as the sum of"one
A prime number is a positive integer that has exactly two different positive divisors,
Adrien-Marie Legendre completed the theorem in 1797-8 with his three-square theorem, by proving that a positive integer can be expressed as the sum of three squares if
In-between these two conditions lies the definition of Carmichael number of order m for any positive integer m as any composite number n such that pn is an endomorphism on every Zn-algebra that can be generated as Zn-module by m elements.
Given a positive integer x, to test whether it is a(non-generalized)
A Dirichlet character is a completely multiplicative arithmetic function χ such that there exists a positive integer k with χ(n+ k)
Note that if d is a positive integer, the d dimensional Hausdorff measure of R d{\displaystyle\mathbb{R}^{d}}
the algebraic closure is a countably infinite field which contains a copy of the field of order p n for each positive integer n(and is in fact the union of these copies[citation needed]).
the algebraic closure is a countably infinite field that contains a copy of the field of order"q""n" for each positive integer"n" and is in fact the union of these copies.
formula_1where formula_2 is an odd positive integer and formula_3 is a positive integer such that formula_4.
A decision problem is a computational problem where the answer for every instance is either yes or no. An example of a decision problem is primality testing:"Given a positive integer n, determine if n is prime.
usually denoted by LCM(a, b), is the smallest positive integer that is divisible by both a and b.
For any given positive integer, a representation that satisfies the conditions of Zeckendorf's theorem can be found by using a greedy algorithm, choosing the largest
referring to his discovery that any positive integer could be expressed as the sum of at most three triangular numbers.
Starting with any positive integer, replace the number by the sum of the squares of its digits in base-ten,
equivalently as the smallest positive integer d which can be written in the form d a⋅p+ b⋅q, where p