Search Results for ""

A polynomial P(x) that, when evaluated over each x in the domain of definition, results in the same value. The simplest example is P(x)=c for x in R and c a constant.

A function f is said to have a lower bound c if c<=f(x) for all x in its domain. The greatest lower bound is called the infimum.

A number theoretic function is a function whose domain is the set of positive integers.

A triple (S,S,P) on the domain S, where (S,S) is a measurable space, S are the measurable subsets of S, and P is a measure on S with P(S)=1.

For a discrete function f(n), the summatory function is defined by F(n)=sum_(k in D)^nf(k), where D is the domain of the function.

An element a of a ring which is nonzero, not a unit, and whose only divisors are the trivial ones (i.e., the units and the products ua, where u is a unit). Equivalently, an ...

Let U subset= C be a domain, and let f be an analytic function on U. Then if there is a point z_0 in U such that |f(z_0)|>=|f(z)| for all z in U, then f is constant. The ...

If 1<=b<a and (a,b)=1 (i.e., a and b are relatively prime), then a^n-b^n has at least one primitive prime factor with the following two possible exceptions: 1. 2^6-1^6. 2. ...

An almost unit is a nonunit in the integral domain of formal power series with a nonzero first coefficient, P=a_1x+a_2x^2+..., where a_1!=0. Under the operation of ...

The domain of Booleans, sometimes denoted B, consisting of the elements True and False, implemented in the Wolfram Language as Booleans. In the Wolfram Language, a quantity ...