Search Results for ""

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 ...

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 ...

An important result in valuation theory which gives information on finding roots of polynomials. Hensel's lemma is formally stated as follows. Let (K,|·|) be a complete ...

The computation of points or values between ones that are known or tabulated using the surrounding points or values. In particular, given a univariate function f=f(x), ...

There are at least three theorems known as Jensen's theorem. The first states that, for a fixed vector v=(v_1,...,v_m), the function |v|_p=(sum_(i=1)^m|v_i|^p)^(1/p) is a ...

A root-finding algorithm which converges to a complex root from any starting position. To motivate the formula, consider an nth order polynomial and its derivatives, P_n(x) = ...

A lucky number of Euler is a number p such that the prime-generating polynomial n^2-n+p is prime for n=1, 2, ..., p-1. Such numbers are related to the imaginary quadratic ...