TOPICS
Search

Search Results for ""


1671 - 1680 of 1702 for Order of operationsSearch Results
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 graph is planar if it can be drawn in a plane without graph edges crossing (i.e., it has graph crossing number 0). The number of planar graphs with n=1, 2, ... nodes are 1, ...
A random number is a number chosen as if by chance from some specified distribution such that selection of a large set of these numbers reproduces the underlying ...
The rectilinear crossing number of a graph G is the minimum number of crossings in a straight line embedding of G in a plane. It is variously denoted rcr(G), cr^_(G) ...
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 ...
A run is a sequence of more than one consecutive identical outcomes, also known as a clump. Let R_p(r,n) be the probability that a run of r or more consecutive heads appears ...
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, ...
Expanding the Riemann zeta function about z=1 gives zeta(z)=1/(z-1)+sum_(n=0)^infty((-1)^n)/(n!)gamma_n(z-1)^n (1) (Havil 2003, p. 118), where the constants ...
The signed Stirling numbers of the first kind are variously denoted s(n,m) (Riordan 1980, Roman 1984), S_n^((m)) (Fort 1948, Abramowitz and Stegun 1972), S_n^m (Jordan 1950). ...
The tangent function is defined by tanx=(sinx)/(cosx), (1) where sinx is the sine function and cosx is the cosine function. The notation tgx is sometimes also used ...

...