Search Results for ""

A cryptarithmetic in which digits are used to represent other digits.

The number N_d^((b))(n) of digits d in the base-b representation of a number n is called the b-ary digit count for d. The digit count is implemented in the Wolfram Language ...

For a finite group of h elements with an n_ith dimensional ith irreducible representation, sum_(i)n_i^2=h.

The operator D=-i(d+d^*), where d^* is the adjoint.

A simple graph with n>=3 graph vertices in which each graph vertex has vertex degree >=n/2 has a Hamiltonian cycle.

Two quantities y and x are said to be directly proportional, proportional, or "in direct proportion" if y is given by a constant multiple of x, i.e., y=cx for c a constant. ...

The Dirichlet beta function is defined by the sum beta(x) = sum_(n=0)^(infty)(-1)^n(2n+1)^(-x) (1) = 2^(-x)Phi(-1,x,1/2), (2) where Phi(z,s,a) is the Lerch transcendent. The ...

If g is continuous and mu,nu>0, then int_0^t(t-xi)^(mu-1)dxiint_0^xi(xi-x)^(nu-1)g(xi,x)dx =int_0^tdxint_x^t(t-xi)^(mu-1)(xi-x)^(nu-1)g(xi,x)dxi.

Let |sum_(n=1)^pa_n|<K, (1) where K is independent of p. Then if f_n>=f_(n+1)>0 and lim_(n->infty)f_n=0, (2) it follows that sum_(n=1)^inftya_nf_n (3) converges.

A polynomial form which is the sum of two polynomial forms involving separate sets of variables.