Search Results for ""
171 - 180 of 546 for Odd Fun<wbr>ctionSearch Results
There are two important theorems known as Herbrand's theorem. The first arises in ring theory. Let an ideal class be in A if it contains an ideal whose lth power is ...
A heterosquare is an n×n array of the integers from 1 to n^2 such that the rows, columns, and diagonals have different sums. (By contrast, in a magic square, they have the ...
Given a sequence of real numbers a_n, the infimum limit (also called the limit inferior or lower limit), written lim inf and pronounced 'lim-inf,' is the limit of ...
Divide a set of data into two groups (high and low) of equal size at the statistical median if there is an even number of data points, or two groups consisting of points on ...
The signature s(K) of a knot K can be defined using the skein relationship s(unknot)=0 (1) s(K_+)-s(K_-) in {0,2}, (2) and 4|s(K)<->del (K)(2i)>0, (3) where del (K) is the ...
If a number fails Miller's primality test for some base a, it is not a prime. If the number passes, it may be a prime. A composite number passing Miller's test is called a ...
A Mongolian tent graph is defined as the graph obtained from the grid graph P_m square P_n for odd n by adding an extra vertex above the graph and joining every other vertex ...
A square-shaped neighborhood that can be used to define a set of cells surrounding a given cell (x_0,y_0) that may affect the evolution of a two-dimensional cellular ...
A polygonal number of the form N_n=n(7n-5)/2, also called an enneagonal number. The first few are 1, 9, 24, 46, 75, 111, 154, 204, ... (OEIS A001106). The generating function ...
A noneulerian graph is a graph that is not Eulerian. The numbers of simple noneulerian graphs on n=1, 2, ... nodes are 2, 3, 10, 30, 148, 1007, 12162, 272886, ... (OEIS ...
...
View search results from all Wolfram sites (6373 matches)

