Search Results for ""

A grammar defining formal language L is a quadruple (N,T,R,S), where N is a finite set of nonterminals, T is a finite set of terminal symbols, R is a finite set of ...

There are four fully supported stellations of the rhombic dodecahedron including as usual the original solid in the count (Wells 1991; Webb). The three nontrivial ones ...

Ede (1958) enumerates 13 basic series of stellations of the rhombic triacontahedron, the total number of which is extremely large. Pawley (1973) gave a set of restrictions ...

The Glaisher-Kinkelin constant A is defined by lim_(n->infty)(H(n))/(n^(n^2/2+n/2+1/12)e^(-n^2/4))=A (1) (Glaisher 1878, 1894, Voros 1987), where H(n) is the hyperfactorial, ...

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 ...

An idoneal number, also called a suitable number or convenient number, is a positive integer D for which the fact that a number is a monomorph (i.e., is expressible in only ...

Long multiplication is the method of multiplication that is commonly taught to elementary school students throughout the world. It can be used on two numbers of arbitrarily ...

Given a positive integer m>1, let its prime factorization be written m=p_1^(a_1)p_2^(a_2)p_3^(a_3)...p_k^(a_k). (1) Define the functions h(n) and H(n) by h(1)=1, H(1)=1, and ...

A Wagstaff prime is a prime number of the form (2^p+1)/3 for p a prime number. The first few are given by p=3, 5, 7, 11, 13, 17, 19, 23, 31, 43, 61, 79, 101, 127, 167, 191, ...

A cellular automaton is a collection of "colored" cells on a grid of specified shape that evolves through a number of discrete time steps according to a set of rules based on ...