Search Results for ""

The Euclidean algorithm, also called Euclid's algorithm, is an algorithm for finding the greatest common divisor of two numbers a and b. The algorithm can also be defined for ...

A Euclidean number is a number which can be obtained by repeatedly solving the quadratic equation. Euclidean numbers, together with the rational numbers, can be constructed ...

For p an odd prime and a positive integer a which is not a multiple of p, a^((p-1)/2)=(a/p) (mod p), where (a|p) is the Legendre symbol.

The Feller-Tornier constant is the density of integers that have an even number of prime factors p_i^(a_i) with a_1>1 in their prime factorization. It is given by ...

An integer d is a fundamental discriminant if it is not equal to 1, not divisible by any square of any odd prime, and satisfies d=1 (mod 4) or d=8,12 (mod 16). The function ...

Consider h_+(d) proper equivalence classes of forms with discriminant d equal to the field discriminant, then they can be subdivided equally into 2^(r-1) genera of ...

An irrational number x can be called GK-regular (defined here for the first time) if the distribution of its continued fraction coefficients is the Gauss-Kuzmin distribution. ...

The Heath-Brown-Moroz constant is defined by C_(Heath-Brown-Moroz) = product_(p)(1-1/p)^7(1+(7p+1)/(p^2)) (1) = 0.00131764115... (2) (OEIS A118228), where the product is ...

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