Search Results for ""

In many computer languages (such as FORTRAN or the Wolfram Language), the common residue of b (mod m) is written mod(b, m) (FORTRAN) or Mod[b, m] (Wolfram Language). The ...

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 ...

Let three isoscelizers I_(AC)I_(AB), I_(BA)I_(BC), and I_(CA)I_(CB) be constructed on a triangle DeltaABC, one for each side. This makes all of the inner triangles similar to ...

What is the maximum number of queens that can be placed on an n×n chessboard such that no two attack one another? The answer is n-1 queens for n=2 or n=3 and n queens ...

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 ...

A field K is said to be an extension field (or field extension, or extension), denoted K/F, of a field F if F is a subfield of K. For example, the complex numbers are an ...

The Gegenbauer polynomials C_n^((lambda))(x) are solutions to the Gegenbauer differential equation for integer n. They are generalizations of the associated Legendre ...

If all the diagonals--including those obtained by "wrapping around" the edges--of a magic square sum to the same magic constant, the square is said to be a panmagic square ...

A factor of a polynomial P(x) of degree n is a polynomial Q(x) of degree less than n which can be multiplied by another polynomial R(x) of degree less than n to yield P(x), ...

The fraction of odd values of the partition function P(n) is roughly 50%, independent of n, whereas odd values of Q(n) occur with ever decreasing frequency as n becomes ...