Filter

Refine by Access

Refine By Collections

Refine by Type

Refine by Date

—
  • Print
  • Save

Search Results

You are looking at 1 - 6 of 6 items for :

  • "distribution modulo 1" x
  • All content x
Clear All

On the Distribution Modulo 1 of q-Additive Functions

Acta Mathematica Hungarica
Volume/Issue:
Volume 90: Issue 1-2
DOI:
https://doi.org/10.1023/a:1006783724203
Author: Dong-Hyun Kim

Abstract  

We consider the asymptotic behavior of the distribution functions defined by FN(z)=1―N{1≦ n ≦ N : f(n)≦ z (mod 1)} in the case when f is q-additive. We give necessary and sufficient conditions for a q-additive function to have a uniform distribution modulo 1 or to have a non-uniform distribution modulo 1.

Restricted access

Distribution Modulo 1 of Some Oscillating Sequences. III

Acta Mathematica Hungarica
Volume/Issue:
Volume 95: Issue 1-2
DOI:
https://doi.org/10.1023/a:1015678014546
Authors: Daniel Berend, Michael Boshernitzan, and Grigori Kolesnik
Restricted access

Almost Uniform Distribution Modulo 1 and the Distribution of Primes

Acta Mathematica Hungarica
Volume/Issue:
Volume 78: Issue 1-2
DOI:
https://doi.org/10.1023/a:1006514302520
Author: S. Akiyama
Restricted access

On the probability that n and [n c] are coprime

Periodica Mathematica Hungarica
Volume/Issue:
Volume 45: Issue 1-2
DOI:
https://doi.org/10.1023/a:1022337727769
Authors: Francine Delmer and Jean-Marc Deshouillers

Abstract  

We prove that for any positive real number

\documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$c$$ \end{document}
which is not an integer, the density of the integers
\documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$n$$ \end{document}
which are coprime to
\documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$n^c {\text{ is }}6/\pi ^2$$ \end{document}
, a result conjectured by Moser, Lambek and Erd Hs.

Restricted access

Randomness of the square root of 2 and the Giant Leap, Part 1

Periodica Mathematica Hungarica
Volume/Issue:
Volume 60: Issue 2
DOI:
https://doi.org/10.1007/s10998-010-2137-9
Author: József Beck

Abstract  

We prove that the “quadratic irrational rotation” exhibits a central limit theorem. More precisely, let α be an arbitrary real root of a quadratic equation with integer coefficients; say, α =

\documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\sqrt 2$$ \end{document}
. Given any rational number 0 < x < 1 (say, x = 1/2) and any positive integer n, we count the number of elements of the sequence α, 2α, 3α, …, nα modulo 1 that fall into the subinterval [0, x]. We prove that this counting number satisfies a central limit theorem in the following sense. First, we subtract the “expected number” nx from the counting number, and study the typical fluctuation of this difference as n runs in a long interval 1 ≤ n ≤ N. Depending on α and x, we may need an extra additive correction of constant times logarithm of N; furthermore, what we always need is a multiplicative correction: division by (another) constant times square root of logarithm of N. If N is large, the distribution of this renormalized counting number, as n runs in 1 ≤ n ≤ N, is very close to the standard normal distribution (bell shaped curve), and the corresponding error term tends to zero as N tends to infinity. This is the main result of the paper (see Theorem 1.1). The proof is rather complicated and long; it has many interesting detours and byproducts. For example, the exact determination of the key constant factors (in the additive and multiplicative norming), which depend on α and x, requires surprisingly deep algebraic tools such as Dedeking sums, the class number of quadratic fields, and generalized class number formulas. The crucial property of a quadratic irrational is the periodicity of its continued fraction. Periodicity means self-similarity, which leads us to Markov chains: our basic probabilistic tool to prove the central limit theorem. We also use a lot of Fourier analysis. Finally, I just mention one byproduct of this research: we solve an old problem of Hardy and Littlewood on diophantine sums. The whole paper consists of an introduction and 17 sections. Part 1 contains the Introduction and Sections 1–7.

Restricted access

Randomness of the square root of 2 and the giant leap, part 2

Periodica Mathematica Hungarica
Volume/Issue:
Volume 62: Issue 2
DOI:
https://doi.org/10.1007/s10998-011-6127-3
Author: József Beck

Abstract  

We prove that the “quadratic irrational rotation” exhibits a central limit theorem. More precisely, let α be an arbitrary real root of a quadratic equation with integer coefficients; say, . Given any rational number 0 < x < 1 (say, x = 1/2) and any positive integer n, we count the number of elements of the sequence α, 2α, 3α, ..., nα modulo 1 that fall into the subinterval [0, x]. We prove that this counting number satisfies a central limit theorem in the following sense. First, we subtract the “expected number” nx from the counting number, and study the typical fluctuation of this difference as n runs in a long interval 1 ≤ n ≤ N. Depending on α and x, we may need an extra additive correction of constant times logarithm of N; furthermore, what we always need is a multiplicative correction: division by (another) constant times square root of logarithm of N. If N is large, the distribution of this renormalized counting number, as n runs in 1 ≤ n ≤ N, is very close to the standard normal distribution (bell shaped curve), and the corresponding error term tends to zero as N tends to infinity. This is the main result of the paper (see Theorem 1.1).

Restricted access