Search Results for ""
521 - 530 of 2526 for Polygon Interior Angle SumSearch Results
A generalization of an Ulam sequence in which each term is the sum of two earlier terms in exactly s ways. (s,t)-additive sequences are a further generalization in which each ...
A series sum_(n)u_n is said to converge absolutely if the series sum_(n)|u_n| converges, where |u_n| denotes the absolute value. If a series is absolutely convergent, then ...
Let (Omega)_(ij) be the resistance distance matrix of a connected graph G on n nodes. Then Foster's theorems state that sum_((i,j) in E(G)))Omega_(ij)=n-1, where E(g) is the ...
The sum-of-factorial powers function is defined by sf^p(n)=sum_(k=1)^nk!^p. (1) For p=1, sf^1(n) = sum_(k=1)^(n)k! (2) = (-e+Ei(1)+pii+E_(n+2)(-1)Gamma(n+2))/e (3) = ...
A pseudoperfect number, sometimes also called a semiperfect number (Benkoski 1972, Butske et al. 1999), is a positive integer such as 20=1+4+5+10 which is the sum of some (or ...
A convex polyomino (sometimes called a "convex polygon") is a polyomino whose perimeter is equal to that of its minimal bounding box (Bousquet-Mélou et al. 1999). ...
An antimagic graph is a graph with e graph edges labeled with distinct elements {1,2,...,e} so that the sum of the graph edge labels at each graph vertex differ.
If two complementary Plücker characteristics are equal, then each characteristic is equal to its complement except in four cases where the sum of order and class is 9.
The operating of shifting the leading digits of an addition into the next column to the left when the sum of that column exceeds a single digit (i.e., 9 in base 10).
Let V!=(0) be a finite dimensional vector space over the complex numbers, and let A be a linear operator on V. Then V can be expressed as a direct sum of cyclic subspaces.
...
View search results from all Wolfram sites (35950 matches)

