Search Results for ""

A Fibonacci prime is a Fibonacci number F_n that is also a prime number. Every F_n that is prime must have a prime index n, with the exception of F_4=3. However, the converse ...

Nonstandard analysis is a branch of mathematical logic which introduces hyperreal numbers to allow for the existence of "genuine infinitesimals," which are numbers that are ...

Percolation, the fundamental notion at the heart of percolation theory, is a difficult idea to define precisely though it is quite easy to describe qualitatively. From the ...

There are (at least) three different types of points known as Steiner points. The point S of concurrence of the three lines drawn through the vertices of a triangle parallel ...

The n-dimensional Keller graph, sometimes denoted G_n (e.g., Debroni et al. 2011), can be defined on a vertex set of 4^n elements (m_1,...,m_n) where each m_i is 0, 1, 2, or ...

A primality test is a test to determine whether or not a given number is prime, as opposed to actually decomposing the number into its constituent prime factors (which is ...

A prime factor is a factor that is prime, i.e., one that cannot itself be factored. In general, a prime factorization takes the form ...

A rooted tree is a tree in which a special ("labeled") node is singled out. This node is called the "root" or (less commonly) "eve" of the tree. Rooted trees are equivalent ...

Wavelets are a class of a functions used to localize a given function in both space and scaling. A family of wavelets can be constructed from a function psi(x), sometimes ...

Also called Chvátal's art gallery theorem. If the walls of an art gallery are made up of n straight line segments, then the entire gallery can always be supervised by |_n/3_| ...