Search Results for ""

Consider the Fibonacci-like recurrence a_n=+/-a_(n-1)+/-a_(n-2), (1) where a_0=0, a_1=1, and each sign is chosen independently and at random with probability 1/2. ...

The uniformity conjecture postulates a relationship between the syntactic length of expressions built up from the natural numbers using field operations, exponentials, and ...

A pair of numbers m and n such that sigma^*(m)=sigma^*(n)=m+n, where sigma^*(n) is the unitary divisor function. Hagis (1971) and García (1987) give 82 such pairs. The first ...

A Wilson prime is a prime satisfying W(p)=0 (mod p), where W(p) is the Wilson quotient, or equivalently, (p-1)!=-1 (mod p^2). The first few Wilson primes are 5, 13, and 563 ...

An antimagic square is an n×n array of integers from 1 to n^2 such that each row, column, and main diagonal produces a different sum such that these sums form a sequence of ...

The Cayley-Purser algorithm is a public-key cryptography algorithm that relies on the fact that matrix multiplication is not commutative. It was devised by Sarah Flannery ...

A cyclic group is a group that can be generated by a single element X (the group generator). Cyclic groups are Abelian. A cyclic group of finite group order n is denoted C_n, ...

There are (at least) three types of Euler transforms (or transformations). The first is a set of transformations of hypergeometric functions, called Euler's hypergeometric ...

Keller conjectured that tiling an n-dimensional space with n-dimensional hypercubes of equal size yields an arrangement in which at least two hypercubes have an entire ...

Multivariate zeta function, also called multiple zeta values, multivariate zeta constants (Bailey et al. 2006, p. 43), multi-zeta values (Bailey et al. 2006, p. 17), and ...