Search Results for ""

Let p_i denote the ith prime, and write m=product_(i)p_i^(v_i). Then the exponent vector is v(m)=(v_1,v_2,...).

A polynomial factorization algorithm that proceeds by considering the vector of coefficients of a polynomial P, calculating b_i=P(i)/a_i, constructing the Lagrange ...

The fundamental theorem of arithmetic states that every positive integer (except the number 1) can be represented in exactly one way apart from rearrangement as a product of ...

Hoffman (1998, p. 90) calls the sum of the exponents in the prime factorization of a number its roundness. The first few values for n=1, 2, ... are 0, 1, 1, 2, 1, 2, 1, 3, 2, ...

Given the binary quadratic form ax^2+2bxy+cy^2 (1) with polynomial discriminant b^2-ac, let x = pX+qY (2) y = rX+sY. (3) Then a(pX+qY)^2+2b(pX+qY)(rX+sY)+c(rX+sY)^2 ...

The compositeness test consisting of the application of Fermat's little theorem.

1 and -1 are the only integers which divide every integer. They are therefore called the prime units.

A subset tau in S_n of a permutation {1,...,n} is said to contain alpha in S_k if there exist 1<=i_1<...<i_k<=n such that tau=(tau_i,...,tau_k) is order isomorphic to ...

Isomorphism is a very general concept that appears in several areas of mathematics. The word derives from the Greek iso, meaning "equal," and morphosis, meaning "to form" or ...

Let graph G have p points v_i and graph H have p points u_i, where p>=3. Then if for each i, the subgraphs G_i=G-v_i and H_i=H-u_i are isomorphic, then the graphs G and H are ...