Search Results for ""

Given an integer sequence {a_n}_(n=1)^infty, a prime number p is said to be a primitive prime factor of the term a_n if p divides a_n but does not divide any a_m for m<n. It ...

A factor is a portion of a quantity, usually an integer or polynomial that, when multiplied by other factors, gives the entire quantity. The determination of factors is ...

A Hajós group is a group for which all factorizations of the form (say) Z_n=A direct sum B have A or B periodic, where the period is a divisor of n. Hajós groups arose after ...

Find two numbers such that x^2=y^2 (mod n). If you know the greatest common divisor of n and x-y, there exists a high probability of determining a prime factor. Taking small ...

Let n>1 be any integer and let lpf(n) (also denoted LD(n)) be the least integer greater than 1 that divides n, i.e., the number p_1 in the factorization ...

Let G be a graph and S a subgraph of G. Let the number of odd components in G-S be denoted S^', and |S| the number of graph vertices of S. The condition |S|>=S^' for every ...

A prime factor is a factor that is prime, i.e., one that cannot itself be factored. In general, a prime factorization takes the form ...

RSA numbers are difficult to-factor composite numbers having exactly two prime factors (i.e., so-called semiprimes) that were listed in the Factoring Challenge of RSA ...

If a polynomial P(x) has a root x=a, i.e., if P(a)=0, then x-a is a factor of P(x).

If a is a point in the open unit disk, then the Blaschke factor is defined by B_a(z)=(z-a)/(1-a^_z), where a^_ is the complex conjugate of a. Blaschke factors allow the ...