Search Results for ""

In a monoid or multiplicative group where the operation is a product ·, the multiplicative inverse of any element g is the element g^(-1) such that g·g^(-1)=g^(-1)·g=1, with ...

A mapping of random number triples to points in spherical coordinates according to theta = 2piX_n (1) phi = piX_(n+1) (2) r = sqrt(X_(n+2)) (3) in order to detect unexpected ...

There exist a variety of formulas for either producing the nth prime as a function of n or taking on only prime values. However, all such formulas require either extremely ...

Let F_n be the nth Fibonacci number, and let (p|5) be a Legendre symbol so that e_p=(p/5)={1 for p=1,4 (mod 5); -1 for p=2,3 (mod 5). (1) A prime p is called a Wall-Sun-Sun ...

A prime p is called a Wolstenholme prime if the central binomial coefficient (2p; p)=2 (mod p^4), (1) or equivalently if B_(p-3)=0 (mod p), (2) where B_n is the nth Bernoulli ...

If 1<=b<a and (a,b)=1 (i.e., a and b are relatively prime), then a^n-b^n has at least one primitive prime factor with the following two possible exceptions: 1. 2^6-1^6. 2. ...

Find a way to stack a square of cannonballs laid out on the ground into a square pyramid (i.e., find a square number which is also square pyramidal). This corresponds to ...

The Motzkin numbers enumerate various combinatorial objects. Donaghey and Shapiro (1977) give 14 different manifestations of these numbers. In particular, they give the ...

A permutation, also called an "arrangement number" or "order," is a rearrangement of the elements of an ordered list S into a one-to-one correspondence with S itself. The ...

A random matrix is a matrix of given type and size whose entries consist of random numbers from some specified distribution. Random matrix theory is cited as one of the ...