Search Results for ""

An inner automorphism of a group G is an automorphism of the form phi(g)=h^(-1)gh, where h is a fixed element of G. An outer automorphism of G is an automorphism which cannot ...

For n points in the plane, there are at least N_1=sqrt(n-3/4)-1/2 different distances. The minimum distance can occur only <=3n-6 times, and the maximum distance can occur ...

The quotient of two polynomials p(x) and q(x), discarding any polynomial remainder. Polynomial quotients are implemented in the Wolfram Language as PolynomialQuotient[p, q, ...

The remainder R(x) obtained when dividing a polynomial p(x) by another polynomial q(x). The polynomial remainder is implemented in the Wolfram Language as ...

A Pythagorean triangle is a right triangle with integer side lengths (i.e., whose side lengths (a,b,c) form a Pythagorean triple). A Pythagorean triangle with GCD(a,b,c)=1 is ...

Let z_0 be a point in a simply connected region R!=C, where C is the complex plane. Then there is a unique analytic function w=f(z) mapping R one-to-one onto the disk |w|<1 ...

A generalization of the Gaussian sum. For p and q of opposite parity (i.e., one is even and the other is odd), Schaar's identity states ...

The nth-order Sierpiński carpet graph is the connectivity graph of black squares in the nth iteration of the Sierpiński carpet fractal. The first three iterations are shown ...

The only irreducible spherical simplexes generated by reflection are A_n (n>=1), B_n (n>=4), C_n (n>=2), D_2^p (p>=5), E_6, E_7, E_8, F_4, G_3, and G_4. The only irreducible ...

A number of attractive 50-compounds of the regular tetrahedron can be constructed. The compounds illustrated above will be implemented in a future version of the Wolfram ...