Search Results for ""
271 - 280 of 2919 for Inline 10Search Results
The hyperbolic cylinder is a quadratic surface given by the equation (x^2)/(a^2)-(y^2)/(b^2)=-1. (1) It is a ruled surface. It can be given parametrically by x = asinhu (2) y ...
The signature s(K) of a knot K can be defined using the skein relationship s(unknot)=0 (1) s(K_+)-s(K_-) in {0,2}, (2) and 4|s(K)<->del (K)(2i)>0, (3) where del (K) is the ...
The numbers defined by the recurrence relation K_(n+1)=1+min(2K_(|_n/2_|),3K_(|_n/3_|)), with K_0=1. The first few values for n=0, 1, 2, ... are 1, 3, 3, 4, 7, 7, 7, 9, 9, ...
The Ljubljana graph is a graph on 112 vertices that is the third smallest cubic semisymmetric graph. It was discovered by Brouwer et al. (1993) and rediscovered by Conder et ...
Given n matches (i.e., rigid unit line segments), find the number of topologically distinct planar arrangements which can be made (Gardner 1991). In this problem, two matches ...
Let A_n be the set of all sequences that contain all sequences {a_k}_(k=0)^n where a_0=1 and all other a_i=+/-1, and define c_k=sum_(j=0)^(n-k)a_ja_(j+k). Then the merit ...
A metadrome is a number whose hexadecimal digits are in strict ascending order. The first few are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 18, 19, 20, ... ...
Three guests decide to stay the night at a lodge whose rate they are initially told is $30 per night. However, after the guests have each paid $10 and gone to their room, the ...
A generalization of the factorial and double factorial, n! = n(n-1)(n-2)...2·1 (1) n!! = n(n-2)(n-4)... (2) n!!! = n(n-3)(n-6)..., (3) etc., where the products run through ...
The following table gives the number of nonadjacent vertex pairs k on graphs of n=1, 2, ... vertices. k counts 1 0, 1, 1, 1, 1, 1, 1, ... 2 0, 0, 1, 2, 2, 2, 2, ... 3 0, 0, ...
...
View search results from all Wolfram sites (124156 matches)

