Gaps in the sequence \(n^ 2\vartheta \,(mod\,1)\) (Q1090701)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4008494
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Gaps in the sequence \(n^ 2\vartheta \,(mod\,1)\) |
scientific article; zbMATH DE number 4008494 |
Statements
Gaps in the sequence \(n^ 2\vartheta \,(mod\,1)\) (English)
0 references
1987
0 references
Two ingredients are put together in this paper: some simple lemmas on fractional parts of \{\(n\vartheta\}\) and an upper bound for the number of divisors of a given number. The result is the following theorem: Let \(\vartheta\) be irrational. Consider the sequence \(\{k^ 2\vartheta \}\), \(1\leq k\leq N\). Then a partition of [0,1] into \(N+1\) subintervals results. Let T(N) be the number of distinct lengths which show up in this set of intervals. Then \(T(N)\gg N^{1-\delta}\). [The paper actually gives a sharper bound and states a generalization to the sequence \(\{k^ p\vartheta \}\), \(p\geq 2.]\)
0 references
uniform distribution mod 1
0 references
fractional parts
0 references
upper bound
0 references
number of divisors
0 references
number of distinct lengths
0 references
0.8247359991073608
0 references
0.7866844534873962
0 references
0.7833205461502075
0 references
0.7771562933921814
0 references
0.769702672958374
0 references
