TOPICS
Search

Search Results for ""


1211 - 1220 of 2910 for Integer complexitySearch Results
The dimension of a partially ordered set P=(X,<=) is the size of the smallest realizer of P. Equivalently, it is the smallest integer d such that P is isomorphic to a ...
A positive integer n is kth powerfree if there is no number d such that d^k|n (d^k divides n), i.e., there are no kth powers or higher in the prime factorization of n. A ...
Each prime factor p_i^(alpha_i) in an integer's prime factorization is called a primary.
The primitive part of a polynomial P(x) is P(x)/k, where k is the content. For a general univariate polynomial P(x), the Wolfram Language function FactorTermsList[poly, x] ...
A polytope in n-dimensional Euclidean space R^n whose vertices are integer lattice points but which does not contain any other lattice points in its interior or on its ...
A number r is an nth root of unity if r^n=1 and a primitive nth root of unity if, in addition, n is the smallest integer of k=1, ..., n for which r^k=1.
A sequence in which no term divides any other. Let S_n be the set {1,...,n}, then the number of primitive subsets of S_n are 2, 3, 5, 7, 13, 17, 33, 45, 73, 103, 205, 253, ...
Let D be a subset of the nonnegative integers Z^* with the properties that (1) the integer 0 is in D and (2) any time that the interval [0,n] is contained in D, one can show ...
Let D be a subset of the nonnegative integers Z^* with the properties that (1) the integer 0 is in D and (2) any time that n is in D, one can show that n+1 is also in D. ...
An extension A subset B of a group, ring, module, field, etc., such that A!=B.
1 ... 119|120|121|122|123|124|125 ... 291 Previous Next

...