On a theorem of Heilbronn
From MaRDI portal
Publication:4075533
DOI10.1112/S0025579300004459zbMath0316.10019OpenAlexW2094130125WikidataQ56047908 ScholiaQ56047908MaRDI QIDQ4075533
Publication date: 1975
Published in: Mathematika (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/s0025579300004459
Related Items
Asymptotic formula for the convolution of a generalized divisor function, On semi-regular finite continued fractions, Average number of local minima for three-dimensional integral lattices, Computer algebra: Past and future, On the period length of some special continued fractions, Bias in the number of steps in the Euclidean algorithm and a conjecture of Ito on Dedekind sums, On the distribution of partial quotients of reduced fractions with fixed denominator, A rigorous version of R. P. Brent's model for the binary Euclidean algorithm, The average length of finite continued fractions with fixed denominator, On the asymptotic analysis of the Euclidean algorithm, The mean number of steps in the Euclidean algorithm with odd partial quotients, Über die Teilnenner endlicher Kettenbrueche, High moments of the Estermann function, Computing GCD's by normalized division, Estimate for dispersion of lengths of continued fractions, On Gauss-Kuz'min statistics for finite continued fractions, On the statistical properties of finite continued fractions, Evaluation of Porter's constant, On the number of solutions of the congruence $xy\equiv l\pmod {q}$ under the graph of a twice continuously differentiable function, On the worst case of three algorithms for computing the Jacobi symbol, The mean number of steps in the Euclidean algorithm with least absolute value remainders, Mean for the sum of elements over a class of finite continued fractions, Unnamed Item, Sum of squares in imaginary quadratic fields
Cites Work
