Loading [MathJax]/extensions/MathZoom.js
Displaying 101 –
120 of
174
Let . We prove that for each root of unity there is an a > 0 such that as r → 1-. For roots of unity e(l/q) with q ≤ 100 we prove that these omega-estimates are true with a = 1/2. From omega-estimates for (z) we obtain omega-estimates for some finite sums.
If denotes the sequence of best approximation denominators to a real , and denotes the sum of digits of in the digit representation of to base , then for all irrational, the sequence is uniformly distributed modulo one. Discrepancy estimates for the discrepancy of this sequence are given, which turn out to be best possible if has bounded continued fraction coefficients.
A positive integer is called a square-free number if it is not divisible by a perfect square except . Let be an odd prime. For with , the smallest positive integer such that is called the exponent of modulo . If the exponent of modulo is , then is called a primitive root mod . Let be the characteristic function of the square-free primitive roots modulo . In this paper we study the distribution
and give an asymptotic formula by using properties of character sums.
Currently displaying 101 –
120 of
174