Search Results for ""
491 - 500 of 831 for Computer programmingSearch Results

The converse of Fermat's little theorem is also known as Lehmer's theorem. It states that, if an integer x is prime to m and x^(m-1)=1 (mod m) and there is no integer e<m-1 ...
The Fibonacci factorial constant is the constant appearing in the asymptotic growth of the fibonorials (aka. Fibonacci factorials) n!_F. It is given by the infinite product ...
The fibonorial n!_F, also called the Fibonacci factorial, is defined as n!_F=product_(k=1)^nF_k, where F_k is a Fibonacci number. For n=1, 2, ..., the first few fibonorials ...
By choosing appropriate rules, it is possible to achieve many forms of synchronization within cellular automata. One version, known as the firing squad synchronization ...
French curves are plastic (or wooden) templates having an edge composed of several different curves. French curves are used in drafting (or were before computer-aided design) ...
The game of life is the best-known two-dimensional cellular automaton, invented by John H. Conway and popularized in Martin Gardner's Scientific American column starting in ...
Let C=C^+ union C^- (where C^+ intersection C^-=emptyset) be the disjoint union of two finite components C^+ and C^-. Let alpha and beta be two involutions on C, each of ...
Let p>3 be a prime number, then 4(x^p-y^p)/(x-y)=R^2(x,y)-(-1)^((p-1)/2)pS^2(x,y), where R(x,y) and S(x,y) are homogeneous polynomials in x and y with integer coefficients. ...
A golden rhombohedron is a rhombohedron whose faces consist of congruent golden rhombi. Golden rhombohedra are therefore special cases of a trigonal trapezohedron as well as ...
A golden rhombus is a rhombus whose diagonals are in the ratio p/q=phi, where phi is the golden ratio. The faces of the acute golden rhombohedron, Bilinski dodecahedron, ...

...