Search Results for ""

A p-element x of a group G is semisimple if E(C_G(x))!=1, where E(H) is the commuting product of all components of H and C_G(x) is the centralizer of G.

Theta(G;A)=<theta(a):a in A-1> is an A-invariant solvable p^'-subgroup of G.

Q is said to be tightly embedded if |Q intersection Q^g| is odd for all g in G-N_G(Q), where N_G(Q) is the normalizer of Q in G.

The p-layer of H, L_(p^')(H) is the unique minimal normal subgroup of H which maps onto E(H/O_(p^')(H)).

The Euclidean algorithm, also called Euclid's algorithm, is an algorithm for finding the greatest common divisor of two numbers a and b. The algorithm can also be defined for ...

The heptanacci constant is the limiting ratio of adjacent heptanacci numbers. It is the algebraic number P = (x^7-x^6-x^5-x^4-x^3-x^2-x-1)_1 (1) = 1.99196419660... (2) (OEIS ...

The hexanacci constant is the limiting ratio of adjacent hexanacci numbers. It is the algebraic number P = (x^6-x^5-x^4-x^3-x^2-x-1)_2 (1) = 1.98358284342... (2) (OEIS ...

The pentanacci constant is the limiting ratio of adjacent pentanacci numbers. It is the algebraic number P = (x^5-x^4-x^3-x^2-x-1)_1 (1) = 1.96594823... (2) (OEIS A103814), ...

The Spencer-Brown form is a simple mathematical concept that formalizes what a mathematical object is formally identical to what it is not (Spencer-Brown 1997, pp. ix and ...

An ordinary differential equation (frequently called an "ODE," "diff eq," or "diffy Q") is an equality involving a function and its derivatives. An ODE of order n is an ...