Search Results for ""

The quartic curve given by the implicit equation (x^2-a^2)(x-a)^2+(y^2-a^2)^2=0, (1) so-named because of its resemblance to a tooth. The bicuspid curve has cusps at (a,-a) ...

Gauss stated the reciprocity theorem for the case n=4 x^4=q (mod p) (1) can be solved using the Gaussian integers as ...

The number of binary bits necessary to represent a number, given explicitly by BL(n) = 1+|_lgn_| (1) = [lg(n+1)], (2) where [x] is the ceiling function, |_x_| is the floor ...

The downward Clenshaw recurrence formula evaluates a sum of products of indexed coefficients by functions which obey a recurrence relation. If f(x)=sum_(k=0)^Nc_kF_k(x) (1) ...

Two matrices A and B which satisfy AB=BA (1) under matrix multiplication are said to be commuting. In general, matrix multiplication is not commutative. Furthermore, in ...

Define I_n=(-1)^nint_0^infty(lnz)^ne^(-z)dz, (1) then I_n=(-1)^nGamma^((n))(1), (2) where Gamma^((n))(z) is the nth derivative of the gamma function. Particular values ...

For every k>=1, let C_k be the set of composite numbers n>k such that if 1<a<n, GCD(a,n)=1 (where GCD is the greatest common divisor), then a^(n-k)=1 (mod n). Special cases ...

The numbers defined by the recurrence relation K_(n+1)=1+min(2K_(|_n/2_|),3K_(|_n/3_|)), with K_0=1. The first few values for n=0, 1, 2, ... are 1, 3, 3, 4, 7, 7, 7, 9, 9, ...

Murata's constant is defined as C_(Murata) = product_(p)[1+1/((p-1)^2)] (1) = 2.82641999... (2) (OEIS A065485), where the product is over the primes p. It can also be written ...

The p×p square matrix formed by setting s_(ij)=xi^(ij), where xi is a pth root of unity. The Schur matrix has a particularly simple determinant given by ...