Search Results for ""

The function f(x,y)=(1-x)^2+100(y-x^2)^2 that is often used as a test problem for optimization algorithms (where a variation with 100 replaced by 105 is sometimes used; ...

For p(z)=a_nz^n+a_(n-1)z^(n-1)+...+a_0, (1) polynomial of degree n>=1, the Schur transform is defined by the (n-1)-degree polynomial Tp(z) = a^__0p(z)-a_np^*(z) (2) = ...

Let p be a prime number, G a finite group, and |G| the order of G. 1. If p divides |G|, then G has a Sylow p-subgroup. 2. In a finite group, all the Sylow p-subgroups are ...

The first Hardy-Littlewood conjecture is called the k-tuple conjecture. It states that the asymptotic number of prime constellations can be computed explicitly. A particular ...

A Belphegor number (also known as a Beelphegor number or a beastly palindromic prime) is a palindromic number of the form 1(0...)666(0...)1. Numbers of this form are named ...

An equation for a lattice sum b_3(1) (Borwein and Bailey 2003, p. 26) b_3(1) = sum^'_(i,j,k=-infty)^infty((-1)^(i+j+k))/(sqrt(i^2+j^2+k^2)) (1) = ...

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

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