Search Results for ""
1531 - 1540 of 7050 for 3Search Results
![](/common/images/search/spacer.gif)
An involution of a set S is a permutation of S which does not contain any permutation cycles of length >2 (i.e., it consists exclusively of fixed points and transpositions). ...
The pseudosphere is the constant negative-Gaussian curvature surface of revolution generated by a tractrix about its asymptote. It is sometimes also called the tractroid, ...
Let the number of random walks on a d-D hypercubic lattice starting at the origin which never land on the same lattice point twice in n steps be denoted c_d(n). The first few ...
A Sierpiński number of the first kind is a number of the form S_n=n^n+1. The first few are 2, 5, 28, 257, 3126, 46657, 823544, 16777217, ... (OEIS A014566). Sierpiński proved ...
While the Catalan numbers are the number of p-good paths from (n,n) to (0,0) which do not cross the diagonal line, the super Catalan numbers count the number of lattice paths ...
n weighings are sufficient to find a bad coin among (3^n-1)/2 coins (Steinhaus 1999, p. 61). vos Savant (1993) gives an algorithm for finding a bad ball among 12 balls in ...
Consider a string of length 2L plucked at the right end and fixed at the left. The functional form of this configuration is f(x)=x/(2L). (1) The components of the Fourier ...
cos(pi/8) = 1/2sqrt(2+sqrt(2)) (1) cos((3pi)/8) = 1/2sqrt(2-sqrt(2)) (2) cot(pi/8) = 1+sqrt(2) (3) cot((3pi)/8) = sqrt(2)-1 (4) csc(pi/8) = sqrt(4+2sqrt(2)) (5) csc((3pi)/8) ...
The polynomials a_n^((beta))(x) given by the Sheffer sequence with g(t) = (1-t)^(-beta) (1) f(t) = ln(1-t), (2) giving generating function ...
The alternating group graph AG_n is the undirected Cayley graph of the set of 2(n-2) generators of the alternating group A_n given by g_3^-, g_3^+, g_4^-, g_4^+, ..., g_n^-, ...
![](/common/images/search/spacer.gif)
...