Search Results for ""

There are two camps of thought on the meaning of general recursive function. One camp considers general recursive functions to be equivalent to the usual recursive functions. ...

A number given by the generating function (2t)/(e^t+1)=sum_(n=1)^inftyG_n(t^n)/(n!). (1) It satisfies G_1=1, G_3=G_5=G_7=...=0, and even coefficients are given by G_(2n) = ...

Given a hereditary representation of a number n in base b, let B[b](n) be the nonnegative integer which results if we syntactically replace each b by b+1 (i.e., B[b] is a ...

Two distinct knots cannot have the same exterior. Or, equivalently, a knot is completely determined by its knot exterior (Cipra 1988; Adams 1994, p. 261). The question was ...

There are two different statements, each separately known as the greatest common divisor theorem. 1. Given positive integers m and n, it is possible to choose integers x and ...

The grid shading problem is the problem of proving the unimodality of the sequence {a_1,a_2,...,a_(mn)}, where for fixed m and n, a_i is the number of partitions of i with at ...

In the original formulation, a quantity associated with ideal class groups. According to Chevalley's formulation, a Grössencharakter is a multiplicative character of the ...

Let sigma(n) be the divisor function. Then lim sup_(n->infty)(sigma(n))/(nlnlnn)=e^gamma, where gamma is the Euler-Mascheroni constant. Ramanujan independently discovered a ...

An extension of a group H by a group N is a group G with a normal subgroup M such that M=N and G/M=H. This information can be encoded into a short exact sequence of groups ...

The number of elements in a group G, denoted |G|. If the order of a group is a finite number, the group is said to be a finite group. The order of an element g of a finite ...