Search Results for ""

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

Gödel's first incompleteness theorem states that all consistent axiomatic formulations of number theory which include Peano arithmetic include undecidable propositions ...

The first Göllnitz-Gordon identity states that the number of partitions of n in which the minimal difference between parts is at least 2, and at least 4 between even parts, ...

Let A(n) denote the number of partitions of n into parts =2,5,11 (mod 12), let B(n) denote the number of partitions of n into distinct parts =2,4,5 (mod 6), and let C(n) ...

A pair of primes (p,q) that sum to an even integer 2n=p+q are known as a Goldbach partition (Oliveira e Silva). Letting r(2n) denote the number of Goldbach partitions of 2n ...

Given a rectangle having sides in the ratio 1:phi, the golden ratio phi is defined such that partitioning the original rectangle into a square and new rectangle results in a ...

The Golomb graph is a unit-distance graph discovered around 1960-1965 by Golomb (Soifer 2008, p. 19). It is implemented in the Wolfram Language as GraphData["GolombGraph"]. A ...

An algorithm for finding closed form hypergeometric identities. The algorithm treats sums whose successive terms have ratios which are rational functions. Not only does it ...

Gossiping and broadcasting are two problems of information dissemination described for a group of individuals connected by a communication network. In gossiping, every person ...

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