Search Results for ""

Given a positive integer m>1, let its prime factorization be written m=p_1^(a_1)p_2^(a_2)p_3^(a_3)...p_k^(a_k). (1) Define the functions h(n) and H(n) by h(1)=1, H(1)=1, and ...

An extremely fast factorization method developed by Pollard which was used to factor the RSA-130 number. This method is the most powerful known for factoring general numbers, ...

pi may be computed using a number of iterative algorithms. The best known such algorithms are the Archimedes algorithm, which was derived by Pfaff in 1800, and the ...

The Pierce expansion, or alternated Egyptian product, of a real number 0<x<1 is the unique increasing sequence {a_1,a_2,...} of positive integers a_i such that ...

The word "pole" is used prominently in a number of very different branches of mathematics. Perhaps the most important and widespread usage is to denote a singularity of a ...

Consider a set A_n={a_1,a_2,...,a_n} of n positive integer-denomination postage stamps sorted such that 1=a_1<a_2<...<a_n. Suppose they are to be used on an envelope with ...

Hardy and Littlewood (1914) proved that the sequence {frac(x^n)}, where frac(x) is the fractional part, is equidistributed for almost all real numbers x>1 (i.e., the ...

The Pratt certificate is a primality certificate based on Fermat's little theorem converse. Prior to the work of Pratt (1975), the Lucas-Lehmer test had been regarded purely ...

A prime partition of a positive integer n>=2 is a set of primes p_i which sum to n. For example, there are three prime partitions of 7 since 7=7=2+5=2+2+3. The number of ...

A primitive polynomial is a polynomial that generates all elements of an extension field from a base field. Primitive polynomials are also irreducible polynomials. For any ...