Search Results for ""

A set of generators (g_1,...,g_n) is a set of group elements such that possibly repeated application of the generators on themselves and each other is capable of producing ...

An algorithm for finding integer relations whose running time is bounded by a polynomial in the number of real variables (Ferguson and Bailey 1992). Unfortunately, it is ...

Sequences of integers generated in the Collatz problem. For example, for a starting number of 7, the sequence is 7, 22, 11, 34, 17, 52, 26, 13, 40, 20, 10, 5, 16, 8, 4, 2, 1, ...

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

Given integers a and b with close to 2n bits each, the half-GCD of a and b is a 2×2 matrix [u v; u^' v^'] with determinant equal to -1 or 1 such that ua+vb=r and ...

An apodization function chosen to minimize the height of the highest sidelobe (Hamming and Tukey 1949, Blackman and Tukey 1959). The Hamming function is given by ...

An apodization function, also called the Hann function, frequently used to reduce leakage in discrete Fourier transforms. The illustrations above show the Hanning function, ...

A harmonic series is a continued fraction-like series [n;a,b,c,...] defined by x=n+1/2(a+1/3(b+1/4(c+...))) (Havil 2003, p. 99). Examples are given in the following table. c ...

A number which is simultaneously a heptagonal number Hep_n and hexagonal number Hex_m. Such numbers exist when 1/2n(5n-3)=m(2m-1). (1) Completing the square and rearranging ...

A number which is simultaneously a heptagonal number H_n and pentagonal number P_m. Such numbers exist when 1/2n(5n-3)=1/2m(3m-1). (1) Completing the square and rearranging ...