Search Results for ""

Guy's "strong law of small numbers" states that there aren't enough small numbers to meet the many demands made of them. Guy (1988) also gives several interesting and ...

The small retrosnub icosicosidodecahedron, also called the small inverted retrosnub icosicosidodecahedron, is the uniform polyhedron with Maeder index 72 (Maeder 1997), ...

The small rhombidodecahedron is the uniform polyhedron with Maeder index 39 (Maeder 1997), Wenninger index 74 (Wenninger 1989), Coxeter index 46 (Coxeter et al. 1954), and ...

The small rhombihexahedron is the uniform polyhedron with Maeder index 18 (Maeder 1997), Wenninger index 86 (Wenninger 1989), Coxeter index 60 (Coxeter et al. 1954), and ...

The small snub icosicosidodecahedron is the uniform polyhedron with Maeder index 32 (Maeder 1997), Wenninger index 110 (Wenninger 1989), Coxeter index 41 (Coxeter et al. ...

R. Whorf found that there are probably several thousand stellations of the small triakis octahedron (Wenninger 1983, p. 36). In particular, the convex hulls of the great ...

Given the left factorial function Sigma(n)=sum_(k=1)^nk!, SK(p) for p prime is the smallest integer n such that p|1+Sigma(n-1). The first few known values of SK(p) are 2, 4, ...

Given the sum-of-factorials function Sigma(n)=sum_(k=1)^nk!, SW(p) is the smallest integer for p prime such that Sigma[SW(p)] is divisible by p. If pSigma(n) for all n<p, ...

The nth Smarandache-Wellin number is formed from the consecutive number sequence obtained by concatenating of the digits of the first n primes. The first few are 2, 23, 235, ...

SNTP(n) is the smallest prime such that p#-1, p#, or p#+1 is divisible by n, where p# is the primorial of p. Ashbacher (1996) shows that SNTP(n) only exists 1. If there are ...