Displaying 1561 – 1580 of 1815

Showing per page

The cubic mapping graph for the ring of Gaussian integers modulo n

Yangjiang Wei, Jizhu Nan, Gaohua Tang (2011)

Czechoslovak Mathematical Journal

The article studies the cubic mapping graph Γ ( n ) of n [ i ] , the ring of Gaussian integers modulo n . For each positive integer n > 1 , the number of fixed points and the in-degree of the elements 1 ¯ and 0 ¯ in Γ ( n ) are found. Moreover, complete characterizations in terms of n are given in which Γ 2 ( n ) is semiregular, where Γ 2 ( n ) is induced by all the zero-divisors of n [ i ] .

The diophantine equation a x 2 + b x y + c y 2 = N , D = b 2 - 4 a c > 0

Keith Matthews (2002)

Journal de théorie des nombres de Bordeaux

We make more accessible a neglected simple continued fraction based algorithm due to Lagrange, for deciding the solubility of a x 2 + b x y + c y 2 = N in relatively prime integers x , y , where N 0 , gcd ( a , b , c ) = gcd ( a , N ) = 1 et D = b 2 - 4 a c > 0 is not a perfect square. In the case of solubility, solutions with least positive y, from each equivalence class, are also constructed. Our paper is a generalisation of an earlier paper by the author on the equation x 2 - D y 2 = N . As in that paper, we use a lemma on unimodular matrices that gives a much simpler proof than Lagrange’s for...

The distribution of the sum-of-digits function

Michael Drmota, Johannes Gajdosik (1998)

Journal de théorie des nombres de Bordeaux

By using a generating function approach it is shown that the sum-of-digits function (related to specific finite and infinite linear recurrences) satisfies a central limit theorem. Additionally a local limit theorem is derived.

Currently displaying 1561 – 1580 of 1815