Search Results for ""
2111 - 2120 of 8522 for Aleph 1Search Results
The Kirchhoff sum index KfS is a graph index defined for a graph on n nodes by KfS=1/2sum_(i=1)^nsum_(j=1)^n((Omega)_(ij))/((d)_(ij)), where (Omega)_(ij) is the resistance ...
A permutation, also called an "arrangement number" or "order," is a rearrangement of the elements of an ordered list S into a one-to-one correspondence with S itself. The ...
A two-player game, also called crosscram, in which player H has horizontal dominoes and player V has vertical dominoes. The two players alternately place a domino on a board ...
Let A be a commutative ring and let C_r be an R-module for r=0,1,2,.... A chain complex C__ of the form C__:...|->C_n|->C_(n-1)|->C_(n-2)|->...|->C_2|->C_1|->C_0 is said to ...
The Bombieri p-norm of a polynomial Q(x)=sum_(i=0)^na_ix^i (1) is defined by [Q]_p=[sum_(i=0)^n(n; i)^(1-p)|a_i|^p]^(1/p), (2) where (n; i) is a binomial coefficient. The ...
Mergelyan's theorem can be stated as follows (Krantz 1999). Let K subset= C be compact and suppose C^*\K has only finitely many connected components. If f in C(K) is ...
Given a point with trilinear coordinates P=alpha:beta:gamma, the anticevian triangle DeltaA^'B^'C^' of a triangle DeltaABC with respect to P is a triangle such that 1. B^'C^' ...
Find the maximum number of bishops B(n) that can be placed on an n×n chessboard such that no two attack each other. The answer is 2n-2 (Dudeney 1970, Madachy 1979), giving ...
A tag system in which a list of n tag rules (each of a special form) is applied to a system in sequential order and then starting again from the first rule. In a cyclic tag ...
The number of different triangles which have integer side lengths and perimeter n is T(n) = P(n,3)-sum_(1<=j<=|_n/2_|)P(j,2) (1) = [(n^2)/(12)]-|_n/4_||_(n+2)/4_| (2) = ...
...
View search results from all Wolfram sites (501162 matches)

