Search Results for ""
181 - 190 of 391 for Amicable PairSearch Results
The disjoint union of two sets A and B is a binary operator that combines all distinct elements of a pair of given sets, while retaining the original set membership as a ...
Endraß surfaces are a pair of octic surfaces which have 168 ordinary double points. This is the maximum number known to exist for an octic surface, although the rigorous ...
The tabulation of raw data obtained by dividing it into classes of some size and computing the number of data elements (or their fraction out of the total) falling within ...
Let H be a Hilbert space and (e_i)_(i in I) is an orthonormal basis for H. The set S(H) of all operators T for which sum_(i in I)||Te_i||^2<infty is a self-adjoint ideal of ...
The pair of sequences defined by F(0)=1, M(0)=0, and F(n) = n-M(F(n-1)) (1) M(n) = n-F(M(n-1)). (2) The first few terms of the "male" sequence M(n) for n=0, 1, ... are 0, 0, ...
Find the minimum number f(n) of subsets in a separating family for a set of n elements, where a separating family is a set of subsets in which each pair of adjacent elements ...
A point about which inversion of two circles produced concentric circles. Every pair of distinct circles has two limiting points. The limiting points correspond to the point ...
A Lucas polynomial sequence is a pair of generalized polynomials which generalize the Lucas sequence to polynomials is given by W_n^k(x) = ...
Call a graph vertex m(a,b,c) a median of a graph G if it lies on all shortest paths between each pair of vertices (a,b), (b,a), and (c,a) in G. A median graph is then defined ...
The index associated to a metric tensor g on a smooth manifold M is a nonnegative integer I for which index(gx)=I for all x in M. Here, the notation index(gx) denotes the ...
...
View search results from all Wolfram sites (4042 matches)

