Search Results for ""

Taking a connected graph or network with a high graph diameter and adding a very small number of edges randomly, the diameter tends to drop drastically. This is known as the ...

"The" Smarandache constant is the smallest solution to the generalized Andrica's conjecture, x approx 0.567148 (OEIS A038458). The first Smarandache constant is defined as ...

Consider the consecutive number sequences formed by the concatenation of the first n positive integers: 1, 12, 123, 1234, ... (OEIS A007908; Smarandache 1993, Dumitrescu and ...

A Smith number is a composite number the sum of whose digits is the sum of the digits of its prime factors (excluding 1). (The primes are excluded since they trivially ...

An integer is k-smooth if it has no prime factors >k. The following table gives the first few k-smooth numbers for small k. Berndt (1994, p. 52) called the 7-smooth numbers ...

The snub cubical graph is the Archimedean graph on 24 nodes and 60 edges obtained by taking the skeleton of the snub cube. It is a quintic graph, is planar, Hamiltonian, and ...

The snub dodecahedral graph is a quintic graph on 60 nodes and 150 edges that corresponds to the skeleton of the snub dodecahedron, great inverted snub icosidodecahedron, ...

The Sobolev embedding theorem is a result in functional analysis which proves that certain Sobolev spaces W^(k,p)(Omega) can be embedded in various spaces including ...

Ramanujan calculated mu=1.45136380... (Hardy 1999, Le Lionnais 1983, Berndt 1994), while the correct value is mu=1.45136923488... (OEIS A070769; Derbyshire 2004, p. 114). The ...

A solvable group is a group having a normal series such that each normal factor is Abelian. The special case of a solvable finite group is a group whose composition indices ...