Search Results for ""

Gaussian primes are Gaussian integers z=a+bi satisfying one of the following properties. 1. If both a and b are nonzero then, a+bi is a Gaussian prime iff a^2+b^2 is an ...

Turing machines are defined by sets of rules that operate on four parameters: (state, tape cell color, operation, state). Let the states and tape cell colors be numbered and ...

A root-finding method which was among the most popular methods for finding roots of univariate polynomials in the 19th and 20th centuries. It was invented independently by ...

p^x is an infinitary divisor of p^y (with y>0) if p^x|_(y-1)p^y, where d|_kn denotes a k-ary Divisor (Guy 1994, p. 54). Infinitary divisors therefore generalize the concept ...

The Löwenheim-Skolem theorem is a fundamental result in model theory which states that if a countable theory has a model, then it has a countable model. Furthermore, it has a ...

The number M_2(n) = 1/nsum_(k=1)^(n^2)k (1) = 1/2n(n^2+1) (2) to which the n numbers in any horizontal, vertical, or main diagonal line must sum in a magic square. The first ...

A Diophantine problem (i.e., one whose solution must be given in terms of integers) which seeks a solution to the following problem. Given n men and a pile of coconuts, each ...

An algorithm which can be used to find integer relations between real numbers x_1, ..., x_n such that a_1x_1+a_2x_2+...+a_nx_n=0, with not all a_i=0. Although the algorithm ...

A prime magic square is a magic square consisting only of prime numbers (although the number 1 is sometimes allowed in such squares). The left square is the 3×3 prime magic ...

A prime constellation of four successive primes with minimal distance (p,p+2,p+6,p+8). The term was coined by Paul Stäckel (1892-1919; Tietze 1965, p. 19). The quadruplet (2, ...