Search Results for ""

The function defined by [n]_q = [n; 1]_q (1) = (1-q^n)/(1-q) (2) for integer n, where [n; k]_q is a q-binomial coefficient. The q-bracket satisfies lim_(q->1^-)[n]_q=n. (3)

If for each positive integer h, the sequence {u_(n+h)-u_n} is uniformly distributed (mod 1), then the sequence {u_n} is uniformly distributed (mod 1) (Montgomery 2001).

The number 10 (ten) is the basis for the decimal system of notation. In this system, each "decimal place" consists of a digit 0-9 arranged such that each digit is multiplied ...

The third prime number, which is also the second Fermat prime, the third Sophie Germain prime, and Fibonacci number F_4. It is an Eisenstein prime, but not a Gaussian prime, ...

An acyclic digraph is a directed graph containing no directed cycles, also known as a directed acyclic graph or a "DAG." Every finite acyclic digraph has at least one node of ...

An additive group is a group where the operation is called addition and is denoted +. In an additive group, the identity element is called zero, and the inverse of the ...

Let B_k be the kth Bernoulli number and consider nB_(n-1)=-1 (mod n), where the residues of fractions are taken in the usual way so as to yield integers, for which the ...

In most computer programs and computing environments, the precision of any calculation (even including addition) is limited by the word size of the computer, that is, by ...

A binomial number is a number of the form a^n+/-b^n, where a,b, and n are integers. Binomial numbers can be factored algebraically as ...

Define a Bouniakowsky polynomial as an irreducible polynomial f(x) with integer coefficients, degree >1, and GCD(f(1),f(2),...)=1. The Bouniakowsky conjecture states that ...