Search Results for ""

A number of the form 2^n-1 obtained by setting x=1 in a Fermat-Lucas polynomial, more commonly known as a Mersenne number.

The compositeness test consisting of the application of Fermat's little theorem.

The Diophantine equation x^n+y^n=z^n. The assertion that this equation has no nontrivial solutions for n>2 has a long and fascinating history and is known as Fermat's last ...

A knot or link L^n in S^(n+2) is said to be fibered if there exists a fibration f:S^(n+2)-L->S^1 and if the fibration is well-behaved near L (Rolfsen 1976, p. 323). Examples ...

A number x is said to have "n figures" if it takes n digits to express it. The number of figures is therefore equal to one more than the power of 10 in the scientific ...

A ring equipped with a filtration.

A filtration of ideals of a commutative unit ring R is a sequence of ideals ... subset= I_2 subset= I_1 subset= I_0=R, such that I_iI_j subset= I_(i+j) for all indices i,j. ...

A set function mu is finitely additive if, given any finite disjoint collection of sets {E_k}_(k=1)^n on which mu is defined, mu( union _(k=1)^nE_k)=sum_(k=1)^nmu(E_k).

A group G is said to be finitely generated if there exists a finite set of group generators for G.

Let D be a planar Abelian difference set and t be any divisor of n. Then t is a numerical multiplier of D, where a multiplier is defined as an automorphism alpha of a group G ...