Search Results for ""
12101 - 12110 of 13135 for Inline 8Search Results
Pascal's triangle is a number triangle with numbers arranged in staggered rows such that a_(nr)=(n!)/(r!(n-r)!)=(n; r), (1) where (n; r) is a binomial coefficient. The ...
A Pisot number is a positive algebraic integer greater than 1 all of whose conjugate elements have absolute value less than 1. A real quadratic algebraic integer greater than ...
A polynomial is a mathematical expression involving a sum of powers in one or more variables multiplied by coefficients. A polynomial in one variable (i.e., a univariate ...
A power is an exponent to which a given quantity is raised. The expression x^a is therefore known as "x to the ath power." A number of powers of x are plotted above (cf. ...
The power tower of order k is defined as a^^k=a^(a^(·^(·^(·^a))))_()_(k), (1) where ^ is Knuth up-arrow notation (Knuth 1976), which in turn is defined by ...
A quadratic equation is a second-order polynomial equation in a single variable x ax^2+bx+c=0, (1) with a!=0. Because it is a second-order polynomial equation, the ...
Riemann defined the function f(x) by f(x) = sum_(p^(nu)<=x; p prime)1/nu (1) = sum_(n=1)^(|_lgx_|)(pi(x^(1/n)))/n (2) = pi(x)+1/2pi(x^(1/2))+1/3pi(x^(1/3))+... (3) (Hardy ...
Salem constants, sometimes also called Salem numbers, are a set of numbers of which each point of a Pisot number is a limit point from both sides (Salem 1945). The Salem ...
A simple graph, also called a strict graph (Tutte 1998, p. 2), is an unweighted, undirected graph containing no graph loops or multiple edges (Gibbons 1985, p. 2; West 2000, ...
A k-regular simple graph G on nu nodes is strongly k-regular if there exist positive integers k, lambda, and mu such that every vertex has k neighbors (i.e., the graph is a ...
...


