Search Results for ""

A number (usually base 10 unless specified otherwise) which has no digitaddition generator. Such numbers were originally called Colombian numbers (S. 1974). There are ...

The Sierpiński carpet is the fractal illustrated above which may be constructed analogously to the Sierpiński sieve, but using squares instead of triangles. It can be ...

There appears to be no term in standard use for a graph with graph crossing number 1. Furthermore, the terms "almost planar" and "1-planar" are used in the literature for ...

A square matrix that does not have a matrix inverse. A matrix is singular iff its determinant is 0. For example, there are 10 singular 2×2 (0,1)-matrices: [0 0; 0 0],[0 0; 0 ...

A Smarandache-Wellin number that is prime is known as a Smarandache-Wellin prime. Concatenations of the first n=1, 2, 4, 128, 174, 342, 435, 1429 (OEIS A046035; Ibstedt 1998, ...

A Smarandache-like function which is defined where S_k(n) is defined as the smallest integer for which n|S_k(n)^k. The Smarandache S_k(n) function can therefore be obtained ...

A Smarandache prime is a prime Smarandache number, i.e., a prime number of the form 1234...n. Surprisingly, no Smarandache primes are known as of Nov. 2015. Upper limits on ...

The logarithmic integral is defined as the Cauchy principal value li(x) = PVint_0^x(dt)/(lnt) (1) = ...

A solitary number is a number which does not have any friends. Solitary numbers include all primes, prime powers, and numbers for which (n,sigma(n))=1, where (a,b) is the ...

A sparse polynomial square is a square of a polynomial [P(x)]^2 that has fewer terms than the original polynomial P(x). Examples include Rényi's polynomial (1) (Rényi 1947, ...