Search Results for ""

An integer n>1 is said to be highly cototient if the equation x-phi(x)=n has more solutions than the equations x-phi(x)=k for all 1<k<n, where phi is the totient function. ...

A synonym for analytic function, regular function, differentiable function, complex differentiable function, and holomorphic map (Krantz 1999, p. 16). The word derives from ...

An indirectly conformal mapping, sometimes called an anticonformal mapping, is a mapping that reverses all angles, whereas an isogonal mapping can reverse some angles and ...

The (lower) irredundance number ir(G) of a graph G is the minimum size of a maximal irredundant set of vertices in G. The upper irredundance number is defined as the maximum ...

The term "isomorphic" means "having the same form" and is used in many branches of mathematics to identify mathematical objects which have the same structural properties. ...

The jinc function is defined as jinc(x)=(J_1(x))/x, (1) where J_1(x) is a Bessel function of the first kind, and satisfies lim_(x->0)jinc(x)=1/2. The derivative of the jinc ...

An algorithm for finding a graph's spanning tree of minimum length. It sorts the edges of a graph in order of increasing cost and then repeatedly adds edges that bridge ...

The Landau-Mignotte bound, also known as the Mignotte bound, is used in univariate polynomial factorization to determine the number of Hensel lifting steps needed. It gives ...

n vectors X_1, X_2, ..., X_n are linearly dependent iff there exist scalars c_1, c_2, ..., c_n, not all zero, such that sum_(i=1)^nc_iX_i=0. (1) If no such scalars exist, ...

Let p(d,a) be the smallest prime in the arithmetic progression {a+kd} for k an integer >0. Let p(d)=maxp(d,a) such that 1<=a<d and (a,d)=1. Then there exists a d_0>=2 and an ...