Search Results for ""
2451 - 2460 of 4154 for Divide whole numbers and integersSearch Results
Let S={x_1,...,x_n} be a set of n distinct positive integers. Then the matrix [S]_n having the least common multiple LCM(x_i,x_j) of x_i and x_j as its i,jth entry is called ...
For all integers n and |x|<a, lambda_n^((t))(x+a)=sum_(k=0)^infty|_n; k]lambda_(n-k)^((t))(a)x^k, where lambda_n^((t)) is the harmonic logarithm and |_n; k] is a Roman ...
It is conjectured that every tree with e edges whose nodes are all trivalent or monovalent can be given a "magic" labeling such that the integers 1, 2, ..., e can be assigned ...
The minimum excluded value. The mex of a set S of nonnegative integers is the least nonnegative integer not in the set.
Multi-index notation is used to shorten expressions that contain many indices. Let x in R^n and write x=(x_1,...,x_n). A multi-index alpha is an n-tuple of integers alpha_j ...
A multidimensional polylogarithm is a generalization of the usual polylogarithm to L_(a_1,...,a_m)(z)=sum_(n_1>...>n_m>0)(z^(n_1))/(n_1^(a_1)...n_m^(a_m)) with positive ...
If m is an integer, then for every residue class r (mod m), there are infinitely many nonnegative integers n for which P(n)=r (mod m), where P(n) is the partition function P.
The set of nilpotent elements in a commutative ring is an ideal, and it is called the nilradical. Another equivalent description is that it is the intersection of the prime ...
A knot obtained from a tangle which can be represented by a finite sequence of integers.
An ideal I of a ring R is called principal if there is an element a of R such that I=aR={ar:r in R}. In other words, the ideal is generated by the element a. For example, the ...
...


