Search Results for ""

An s-route of a graph G is a sequence of vertices (v_0,v_1,...,v_s) of G such that v_iv_(i+1) in E(G) for i=0, 1, ..., s-1 (where E(G) is the edge set of G) and ...

Legendre showed that there is no rational algebraic function which always gives primes. In 1752, Goldbach showed that no polynomial with integer coefficients can give a prime ...

Given a set of linear equations {a_1x+b_1y+c_1z=d_1; a_2x+b_2y+c_2z=d_2; a_3x+b_3y+c_3z=d_3, (1) consider the determinant D=|a_1 b_1 c_1; a_2 b_2 c_2; a_3 b_3 c_3|. (2) Now ...

A polynomial of the form f(x)=a_nx^n+a_(n-1)x^(n-1)+...+a_1x+a_0 having coefficients a_i that are all integers. An integer polynomial gives integer values for all integer ...

A graph with projective plane crossing number equal to 0 may be said to be projective planar. Examples of projective planar graphs with graph crossing number >=2 include the ...

Synthetic division is a shortcut method for dividing two polynomials which can be used in place of the standard long division algorithm. This method reduces the dividend and ...

The Banach density of a set A of integers is defined as lim_(d->infty)max_(n)(|{A intersection [n+1,...,n+d]}|)/d, if the limit exists. If the lim is replaced with lim sup or ...

Let t(m) denote the set of the phi(m) numbers less than and relatively prime to m, where phi(n) is the totient function. Then if S_m=sum_(t(m))1/t, (1) then {S_m=0 (mod m^2) ...

Probability is the branch of mathematics that studies the possible outcomes of given events together with the outcomes' relative likelihoods and distributions. In common ...

An Abelian semigroup is a set whose elements are related by a binary operation (such as addition, rotation, etc.) that is closed, associative, and commutative. A mathematical ...