Search Results for ""
10701 - 10710 of 13135 for Probability Generating FunctionSearch Results
A Størmer number is a positive integer n for which the greatest prime factor p of n^2+1 is at least 2n. Every Gregory number t_x can be expressed uniquely as a sum of t_ns ...
A noncylindrical ruled surface always has a parameterization of the form x(u,v)=sigma(u)+vdelta(u), (1) where |delta|=1, sigma^'·delta^'=0, and sigma is called the striction ...
A string of length n on an alphabet l of m characters is an arrangement of n not necessarily distinct symbols from l. There are m^n such distinct strings. For example, the ...
A pseudoprime which obeys an additional restriction beyond that required for a Frobenius pseudoprime. A number n with (n,2a)=1 is a strong Frobenius pseudoprime with respect ...
Let U(P,Q) and V(P,Q) be Lucas sequences generated by P and Q, and define D=P^2-4Q. (1) Let n be an odd composite number with (n,D)=1, and n-(D/n)=2^sd with d odd and s>=0, ...
A strong pseudo-Riemannian metric on a smooth manifold M is a (0,2) tensor field g which is symmetric and for which, at each m in M, the map v_m|->g_m(v_m,·) is an ...
A strong Riemannian metric on a smooth manifold M is a (0,2) tensor field g which is both a strong pseudo-Riemannian metric and positive definite. In a very precise way, the ...
A variety V of algebras is a strong variety provided that for each subvariety W of V, and each algebra A in V, if A is generated by its W- subalgebras, then A in W. In strong ...
A strongly binary tree is a rooted tree for which the root is adjacent to either zero or two vertices, and all non-root vertices are adjacent to either one or three vertices ...
A strongly connected component of a simple directed graph (i.e., a digraph without loops) is a maximal subdigraph such that for every pair of distinct vertices u, v in the ...
...
View search results from all Wolfram sites (432560 matches)

