Search Results for ""

Algebraic number theory is the branch of number theory that deals with algebraic numbers. Historically, algebraic number theory developed as a set of tools for solving ...

Algorithmic graph theory is the study of graph traversal and generation and the complexity of these operations. Topics in algorithmic graph theory include Eulerian and ...

An amicable quadruple as a quadruple (a,b,c,d) such that sigma(a)=sigma(b)=sigma(c)=sigma(d)=a+b+c+d, (1) where sigma(n) is the divisor function. If (a,b) and (x,y) are ...

Dickson (1913, 2005) defined an amicable triple to be a triple of three numbers (l,m,n) such that s(l) = m+n (1) s(m) = l+n (2) s(n) = l+m, (3) where s(n) is the restricted ...

R. C. Read defined the anarboricity of a graph G as the maximum number of edge-disjoint nonacyclic (i.e., cyclic) subgraphs of G whose union is G (Harary and Palmer 1973, p. ...

Given a graph G, the arboricity Upsilon(G) is the minimum number of edge-disjoint acyclic subgraphs (i.e., spanning forests) whose union is G. An acyclic graph therefore has ...

Let a_n and b_n be the perimeters of the circumscribed and inscribed n-gon and a_(2n) and b_(2n) the perimeters of the circumscribed and inscribed 2n-gon. Then a_(2n) = ...

A method of solving combinatorial problems by means of an algorithm which is allowed to run forward until a dead end is reached, at which point previous steps are retraced ...

A number n is called a barrier of a number-theoretic function f(m) if, for all m<n, m+f(m)<=n. Neither the totient function phi(n) nor the divisor function sigma(n) has a ...

(dy)/(dx)+p(x)y=q(x)y^n. (1) Let v=y^(1-n) for n!=1. Then (dv)/(dx)=(1-n)y^(-n)(dy)/(dx). (2) Rewriting (1) gives y^(-n)(dy)/(dx) = q(x)-p(x)y^(1-n) (3) = q(x)-vp(x). (4) ...