Search Results for ""

In a monoid or multiplicative group where the operation is a product ·, the multiplicative inverse of any element g is the element g^(-1) such that g·g^(-1)=g^(-1)·g=1, with ...

Proper covers are defined as covers of a set X which do not contain the entire set X itself as a subset (Macula 1994). Of the five covers of {1,2}, namely {{1},{2}}, {{1,2}}, ...

The number k in the expression s(n)=kn for a multiperfect number is called its class.

A method for finding roots of a polynomial equation f(x)=0. Now find an equation whose roots are the roots of this equation diminished by r, so (1) The expressions for f(r), ...

In a set X equipped with a binary operation · called a product, the multiplicative identity is an element e such that e·x=x·e=x for all x in X. It can be, for example, the ...

There appears to be no term in standard use for a graph with graph crossing number 1. Furthermore, the terms "almost planar" and "1-planar" are used in the literature for ...

A generalization of the Fibonacci numbers defined by 1=G_1=G_2=...=G_(c-1) and the recurrence relation G_n=G_(n-1)+G_(n-c). (1) These are the sums of elements on successive ...

The von Staudt-Clausen theorem, sometimes also known as the Staudt-Clausen theorem (Carlitz 1968), states that B_(2n)=A_n-sum_(p_k; (p_k-1)|2n)1/(p_k), (1) where B_(2n) is a ...

The nth Monica set M_n is defined as the set of composite numbers x for which n|[S(x)-S_p(x)], where x = a_0+a_1(10^1)+...+a_d(10^d) (1) = p_1p_2...p_m, (2) and S(x) = ...

A graph whose nodes are sequences of symbols from some alphabet and whose edges indicate the sequences which might overlap. The above figures show the first few n-dimensional ...