Search Results for ""

The roots (sometimes also called "zeros") of an equation f(x)=0 are the values of x for which the equation is satisfied. Roots x which belong to certain sets are usually ...

Given a polynomial p(x)=a_nx^n+a_(n-1)x^(n-1)+...+a_1x+a_0 (1) of degree n with roots alpha_i, i=1, ..., n and a polynomial q(x)=b_mx^m+b_(m-1)x^(m-1)+...+b_1x+b_0 (2) of ...

In August 2002, M. Agrawal and colleagues announced a deterministic algorithm for determining if a number is prime that runs in polynomial time (Agrawal et al. 2004). While ...

In general, polynomial equations higher than fourth degree are incapable of algebraic solution in terms of a finite number of additions, subtractions, multiplications, ...

An algorithm that can be used to factor a polynomial f over the integers. The algorithm proceeds by first factoring f modulo a suitable prime p via Berlekamp's method and ...

Bézout's theorem for curves states that, in general, two algebraic curves of degrees m and n intersect in m·n points and cannot meet in more than m·n points unless they have ...

An algebraic surface with affine equation P_d(x_1,x_2)+T_d(x_3)=0, (1) where T_d(x) is a Chebyshev polynomial of the first kind and P_d(x_1,x_2) is a polynomial defined by ...

Computational number theory is the branch of number theory concerned with finding and implementing efficient computer algorithms for solving various problems in number ...

The term "continued fraction" is used to refer to a class of expressions of which generalized continued fraction of the form b_0+(a_1)/(b_1+(a_2)/(b_2+(a_3)/(b_3+...))) ...

For a graph G and a subset S of the vertex set V(G), denote by N_G[S] the set of vertices in G which are in S or adjacent to a vertex in S. If N_G[S]=V(G), then S is said to ...