TOPICS
Search

Search Results for ""


3221 - 3230 of 13134 for binomial theorySearch Results
A Smarandache prime is a prime Smarandache number, i.e., a prime number of the form 1234...n. Surprisingly, no Smarandache primes are known as of Nov. 2015. Upper limits on ...
The square-triangle theorem states that any nonnegative integer can be represented as the sum of a square, an even square, and a triangular number (Sun 2005), i.e., ...
A stacked (or generalized) prism graph Y_(m,n) is a simple graph given by the graph Cartesian product Y_(m,n)=C_m square P_n (Gallian 2007) for positive integers m,n with ...
A special type of binary tree obtained by starting with the fractions 0/1 and 1/0 and iteratively inserting (m+m^')/(n+n^') between each two adjacent fractions m/n and ...
A sum-product number is a number n such that the sum of n's digits times the product of n's digit is n itself, for example 135=(1+3+5)(1·3·5). (1) Obviously, such a number ...
Tarski's theorem says that the first-order theory of reals with +, *, =, and > allows quantifier elimination. Algorithmic quantifier elimination implies decidability assuming ...
In the 1980s, Samuel Yates defined a titanic prime to be a prime number of at least 1000 decimal digits. The smallest titanic prime is 10^(999)+7. As of 1990, more than 1400 ...
In general, a topological index, sometimes also known as a graph-theoretic index, is a numerical invariant of a chemical graph (Plavšić et al. 1993). Particular topological ...
An untraceable graph is a graph that does not possess a Hamiltonian path, i.e., one that is not traceable. All disconnected graphs are therefore untraceable. Untraceable ...
A theorem of fundamental importance in spectroscopy and angular momentum theory which provides both (1) an explicit form for the dependence of all matrix elements of ...
1 ... 320|321|322|323|324|325|326 ... 1314 Previous Next

...