On some problems in
Some problems involving the classical Hardy function , are discussed. In particular we discuss the odd moments of Z(t) and the distribution of its positive and negative values.
Let σ(n) denote the sum of positive divisors of the integer n, and let ϕ denote Euler's function, that is, ϕ(n) is the number of integers in the interval [1,n] that are relatively prime to n. It has been conjectured by Mąkowski and Schinzel that σ(ϕ(n))/n ≥ 1/2 for all n. We show that σ(ϕ(n))/n → ∞ on a set of numbers n of asymptotic density 1. In addition, we study the average order of σ(ϕ(n))/n as well as its range. We use similar methods to prove a conjecture of Erdős that ϕ(n-ϕ(n)) < ϕ(n)...
Letting (resp. ) be the n-th Chebyshev polynomials of the first (resp. second) kind, we prove that the sequences and for n - 2⎣n/2⎦ ≤ k ≤ n - ⎣n/2⎦ are two basis of the ℚ-vectorial space formed by the polynomials of ℚ[X] having the same parity as n and of degree ≤ n. Also and admit remarkableness integer coordinates on each of the two basis.
We study a special class of -nets in base 2. In particular, we are concerned with the two-dimensional Hammersley net that plays a special role among these since we prove that it is the worst distributed with respect to the star discrepancy. By showing this, we also improve an existing upper bound for the star discrepancy of digital -nets over . Moreover, we show that nets with very low star discrepancy can be obtained by transforming the Hammersley point set in a suitable way.
A recent result of Balandraud shows that for every subset of an abelian group there exists a non trivial subgroup such that holds only if . Notice that Kneser’s Theorem only gives .This strong form of Kneser’s theorem follows from some nice properties of a certain poset investigated by Balandraud. We consider an analogous poset for nonabelian groups and, by using classical tools from Additive Number Theory, extend some of the above results. In particular we obtain short proofs of Balandraud’s...
Let be a subset of , the field of elements and a polynomial of degree with no roots in . Consider the group generated by the image of in the group of units of the ring . In this paper we present a number of lower bounds for the size of this group. Our main motivation is an application to the recent polynomial time primality testing algorithm [AKS]. The bounds have also applications to graph theory and to the bounding of the number of rational points on abelian covers of the projective...