Search Results for ""

The most general form of Lagrange's group theorem, also known as Lagrange's lemma, states that for a group G, a subgroup H of G, and a subgroup K of H, (G:K)=(G:H)(H:K), ...

Lehmer's totient problem asks if there exist any composite numbers n such that phi(n)|(n-1), where phi(n) is the totient function? No such numbers are known. However, any ...

Let s=1/(sqrt(2pi))[Gamma(1/4)]^2=5.2441151086... (1) (OEIS A064853) be the arc length of a lemniscate with a=1. Then the lemniscate constant is the quantity L = 1/2s (2) = ...

An operation on rings and modules. Given a commutative unit ring R, and a subset S of R, closed under multiplication, such that 1 in S, and 0 not in S, the localization of R ...

The Miquel point is the point of concurrence of the Miquel circles. It is therefore the radical center of these circles. Let the points defining the Miquel circles be ...

The multicomputational paradigm is a generalization of the computational paradigm to many computational threads of time. In the ordinary computational paradigm, time ...

A prime ideal is an ideal I such that if ab in I, then either a in I or b in I. For example, in the integers, the ideal a=<p> (i.e., the multiples of p) is prime whenever p ...

Quasi-Monte Carlo integration is a method of numerical integration that operates in the same way as Monte Carlo integration, but instead uses sequences of quasirandom numbers ...

The extension ring obtained from a commutative unit ring (other than the trivial ring) when allowing division by all non-zero divisors. The ring of fractions of an integral ...

The ruliad may be defined as the entangled limit of everything that is computationally possible, i.e., the result of following all possible computational rules in all ...