An iteration problem involving the divisor function
We consider the Golomb and the Kirch topologies in the set of natural numbers. Among other results, we show that while with the Kirch topology every arithmetic progression is aposyndetic, in the Golomb topology only for those arithmetic progressions with the property that every prime number that divides also divides , it follows that being connected, being Brown, being totally Brown, and being aposyndetic are all equivalent. This characterizes the arithmetic progressions which are aposyndetic...
We generalize and unify the proofs of several results on algebraic independence of arithmetic functions and Dirichlet series by using a theorem of Ax on the differential Schanuel conjecture. Along the way, we find counter-examples to some results in the literature.
The computation of polynomial greatest common divisor (GCD) ranks among basic algebraic problems with many applications, for example, in image processing and control theory. The problem of the GCD computing of two exact polynomials is well defined and can be solved symbolically, for example, by the oldest and commonly used Euclid’s algorithm. However, this is an ill-posed problem, particularly when some unknown noise is applied to the polynomial coefficients. Hence, new methods for the GCD computation...
We compute upper and lower bounds for the approximation of hyperbolic functions at points
Let β ∈ (1,2) and x ∈ [0,1/(β-1)]. We call a sequence a β-expansion for x if . We call a finite sequence an n-prefix for x if it can be extended to form a β-expansion of x. In this paper we study how good an approximation is provided by the set of n-prefixes. Given , we introduce the following subset of ℝ: In other words, is the set of x ∈ ℝ for which there exist infinitely many solutions to the inequalities . When , the Borel-Cantelli lemma tells us that the Lebesgue measure of is...