Search Results for ""

Let n-1=FR where F is the factored part of a number F=p_1^(a_1)...p_r^(a_r), (1) where (R,F)=1, and R<sqrt(n). Pocklington's theorem, also known as the Pocklington-Lehmer ...

Let alpha be a nonzero rational number alpha=+/-p_1^(alpha_1)p_2^(alpha_2)...p_L^(alpha_L), where p_1, ..., p_L are distinct primes, alpha_l in Z and alpha_l!=0. Then ...

A lattice path from one point to another is p-good if it lies completely below the line y=(p-1)x. (1) Hilton and Pederson (1991) show that the number of p-good paths from (1, ...

Take K a number field and m a divisor of K. A congruence subgroup H is defined as a subgroup of the group of all fractional ideals relative prime to m (I_K^m) that contains ...

Let I(G) denote the set of all independent sets of vertices of a graph G, and let I(G,u) denote the independent sets of G that contain the vertex u. A fractional coloring of ...

The reversal of a positive integer abc...z is z...cba. The reversal of a positive integer n is implemented in the Wolfram Language as IntegerReverse[n]. A positive integer ...

The Gelfond-Schneider constant is the number 2^(sqrt(2))=2.66514414... (OEIS A007507) that is known to be transcendental by Gelfond's theorem. Both the Gelfand-Schneider ...

The ring of integers is the set of integers ..., -2, -1, 0, 1, 2, ..., which form a ring. This ring is commonly denoted Z (doublestruck Z), or sometimes I (doublestruck I). ...

A brute-force method of finding a divisor of an integer n by simply plugging in one or a set of integers and seeing if they divide n. Repeated application of trial division ...

A Thâbit ibn Kurrah prime, sometimes called a 321-prime, is a Thâbit ibn Kurrah number (i.e., a number of the form 3·2^n-1 for nonnegative integer n) that is prime. The ...