On the discrepancy estimate of normal numbers
We construct a Markov normal sequence with a discrepancy of . The estimation of the discrepancy was previously known to be .
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.
In this article the discrete logarithm problem in degree 0 class groups of curves over finite fields given by plane models is studied. It is proven that the discrete logarithm problem for non-hyperelliptic curves of genus 3 (given by plane models of degree 4) can be solved in an expected time of , where is the cardinality of the ground field. Moreover, it is proven that for every fixed natural number the following holds: We consider the discrete logarithm problem for curves given by plane models...
For an integer k ≥ 2, let be the k-Fibonacci sequence which starts with 0,..., 0,1 (k terms) and each term afterwards is the sum of the k preceding terms. This paper completes a previous work of Marques (2014) which investigated the spacing between terms of distinct k-Fibonacci sequences.
This paper gives further results about the distribution in the arithmetic progressions (modulo a product of two primes) of reducible quadratic polynomials in short intervals , where now . Here we use the Dispersion Method instead of the Large Sieve to get results beyond the classical level , reaching (thus improving also the level of the previous paper, i.e. ), but our new results are different in structure. Then, we make a graphical comparison of the two methods.