Search Results for ""

Let n be a positive number having primitive roots. If g is a primitive root of n, then the numbers 1, g, g^2, ..., g^(phi(n)-1) form a reduced residue system modulo n, where ...

There are two kinds of power sums commonly considered. The first is the sum of pth powers of a set of n variables x_k, S_p(x_1,...,x_n)=sum_(k=1)^nx_k^p, (1) and the second ...

A recurrence equation (also called a difference equation) is the discrete analog of a differential equation. A difference equation involves an integer function f(n) in a form ...

Yahtzee is a game played with five 6-sided dice. Players take turns rolling the dice, and trying to get certain types of rolls, each with an assigned point value, as ...

There are a great many beautiful identities involving q-series, some of which follow directly by taking the q-analog of standard combinatorial identities, e.g., the ...

The Bailey mod 9 identities are a set of three Rogers-Ramanujan-like identities appearing as equations (1.6), (1.8), and (1.7) on p. 422 of Bailey (1947) given by A(q) = ...

Salem constants, sometimes also called Salem numbers, are a set of numbers of which each point of a Pisot number is a limit point from both sides (Salem 1945). The Salem ...

The Catalan numbers on nonnegative integers n are a set of numbers that arise in tree enumeration problems of the type, "In how many ways can a regular n-gon be divided into ...

The factorial n! is defined for a positive integer n as n!=n(n-1)...2·1. (1) So, for example, 4!=4·3·2·1=24. An older notation for the factorial was written (Mellin 1909; ...

An automorphism of a graph is a graph isomorphism with itself, i.e., a mapping from the vertices of the given graph G back to vertices of G such that the resulting graph is ...