Search Results for ""

The flower snarks, denoted J_n for n=5, 7, 9, ..., are a family of graphs discovered by Isaacs (1975) which are snarks. The construction for flower snarks may be generalized ...

A palindromic number is a number (in some base b) that is the same when written forwards or backwards, i.e., of the form a_1a_2...a_2a_1. The first few palindromic numbers ...

A prime link is a link that cannot be represented as a knot sum of other links. Doll and Hoste (1991) list polynomials for oriented links of nine or fewer crossings, and ...

A spider graph, spider tree, or simply "spider," is a tree with one vertex of degree at least 3 and all others with degree at most 2. The numbers of spiders on n=1, 2, ... ...

Given a pick-7 lottery with 23 numbers that pays a prize to anyone matching at least 4 of the 7 numbers, there is a set of 253 tickets that guarantees a win. This set ...

A Wagstaff prime is a prime number of the form (2^p+1)/3 for p a prime number. The first few are given by p=3, 5, 7, 11, 13, 17, 19, 23, 31, 43, 61, 79, 101, 127, 167, 191, ...

Two or more lines are said to be concurrent if they intersect in a single point. Two lines concur if their trilinear coordinates satisfy |l_1 m_1 n_1; l_2 m_2 n_2; l_3 m_3 ...

The crossed trough is the surface z=x^2y^2. (1) The coefficients of its first fundamental form are E = 1+4x^2y^4 (2) F = 4x^3y^3 (3) G = 1+4x^4y^2 (4) and of the second ...

sum_(n=0)^(N-1)e^(inx) = (1-e^(iNx))/(1-e^(ix)) (1) = (-e^(iNx/2)(e^(-iNx/2)-e^(iNx/2)))/(-e^(ix/2)(e^(-ix/2)-e^(ix/2))) (2) = (sin(1/2Nx))/(sin(1/2x))e^(ix(N-1)/2), (3) ...

Given two circles, draw the tangents from the center of each circle to the sides of the other. Then the line segments AB and CD are of equal length. The theorem can be proved ...