Search Results for ""
221 - 230 of 405 for Friendly PairSearch Results
A differential k-form is a tensor of tensor rank k that is antisymmetric under exchange of any pair of indices. The number of algebraically independent components in n ...
A pair of primes (p,q) that sum to an even integer 2n=p+q are known as a Goldbach partition (Oliveira e Silva). Letting r(2n) denote the number of Goldbach partitions of 2n ...
There are several definitions of the strength of a graph. Harary and Palmer (1959) and Harary and Palmer (1973, p. 66) define the strength of a tree as the maximum number of ...
An isosceles tetrahedron is a nonregular tetrahedron in which each pair of opposite polyhedron edges are equal, i.e., a^'=a, b^'=b, and c^'=c, so that all triangular faces ...
Sexy primes are pairs of primes of the form (p, p+6), so-named since "sex" is the Latin word for "six.". The first few sexy prime pairs are (5, 11), (7, 13), (11, 17), (13, ...
Any four mutually tangent spheres determine six points of tangency. A pair of tangencies (t_i,t_j) is said to be opposite if the two spheres determining t_i are distinct from ...
For an integer n>=2, let lpf(n) denote the least prime factor of n. A pair of integers (x,y) is called a twin peak if 1. x<y, 2. lpf(x)=lpf(y), 3. For all z, x<z<y implies ...
There are several different definitions of the term "unital" used throughout various branches of mathematics. In geometric combinatorics, a block design of the form (q^3+1, ...
A number v=xy with an even number n of digits formed by multiplying a pair of n/2-digit numbers (where the digits are taken from the original number in any order) x and y ...
The Higman-Sims graph is the unique strongly regular graph on 100 nodes (Higman and Sims 1968, Brouwer 1983, Brouwer and Haemers 1993). It was also constructed independently ...
...
View search results from all Wolfram sites (4634 matches)

