Search Results for ""
71 - 80 of 391 for Amicable PairSearch Results
A fibered category F over a topological space X consists of 1. a category F(U) for each open subset U subset= X, 2. a functor i^*:F(U)->F(V) for each inclusion i:V↪U, and 3. ...
A hyperfunction, discovered by Mikio Sato in 1958, is defined as a pair of holomorphic functions (f,g) which are separated by a boundary gamma. If gamma is taken to be a ...
An ordered pair representation is a representation of a directed graph in which edges are specified as ordered pairs or vertex indices. The ordered pairs representation of a ...
An unordered pair representation is a representation of an undirected graph in which edges are specified as unordered pairs of vertex indices. The unordered pairs ...
A discrete function A(n,k) is called closed form (or sometimes "hypergeometric") in two variables if the ratios A(n+1,k)/A(n,k) and A(n,k+1)/A(n,k) are both rational ...
Define a carefree couple as a pair of positive integers (a,b) such that a and b are relatively prime (i.e., GCD(a,b)=1) and a is squarefree. Similarly, define a strongly ...
A roll of 10 on a pair of six-sided dice in the game of craps (Gardner 1978, p. 256). The probability of rolling "a big Dick" is 1/12, or 8.333...%.
An arc of a graph, sometimes also called a flag, is an ordered pair of adjacent vertices (Godsil and Royle 2001, p. 59), sometimes also called a directed line (Harary 1994, ...
An orthogonal array OA(k,s) is a k×s^2 array with entries taken from an s-set S having the property that in any two rows, each ordered pair of symbols from S occurs exactly ...
A partial algebra is a pair A=(A,(f_i^A)_(i in I)), where for each i in I, there are an ordinal number alpha_i and a set X_i subset= A^(alpha_i) such that f_i^A is a function ...
...
View search results from all Wolfram sites (4042 matches)

