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

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

For any prime number p and any positive integer n, the p^n-rank r_(p^n)(G) of a finitely generated Abelian group G is the number of copies of the cyclic group Z_(p^n) ...

The function intx gives the integer part of x. In many computer languages, the function is denoted int(x). It is related to the floor and ceiling functions |_x_| and [x] by ...

where _5F_4(a,b,c,d,e;f,g,h,i;z) is a generalized hypergeometric function and Gamma(z) is the gamma function. Bailey (1935, pp. 25-26) called the Dougall-Ramanujan identity ...

By analogy with the divisor function sigma_1(n), let pi(n)=product_(d|n)d (1) denote the product of the divisors d of n (including n itself). For n=1, 2, ..., the first few ...

The vertical line test is a graphical method of determining whether a curve in the plane represents the graph of a function by visually examining the number of intersections ...

The map which assigns every member of a set A to the same element id_A. It is identical to the identity function.

A set A of integers is recursively isomorphic to set B if there is a bijective recursive function f such that f(A)=B.

The sequency k of a Walsh function is defined as half the number of zero crossings in the time base.