Related papers: Evaluating the Fabius function
Studying and comparing arithmetic properties of a given automatic sequence and the sequence of coefficients of the composition inverse of the associated formal power series (the formal inverse of that sequence) is an interesting problem.…
A pair of numbers is amicable if each number equals the sum of the proper divisors of the other. This paper after exploring the history and evolution of amicable numbers, introduces a novel characterization of amicable pairs whose greatest…
This work provides a complete characterization of congruent numbers in terms of Pythagorean triples. Specifically, we show that every congruent number can be written as $$\frac{nm\left(m-n\right)\left(m+n\right)}{\sigma^2}$$ were as…
We introduce certain linear positive operators and study some approximation properties of these operators in the space of functions, continuous on a compact set, of two variables. We also find the order of this approximation by using…
Let $d_1 = 1 < d_2 < d_3 < \cdots < d_{\tau(n)} = n$ denote the increasing sequence of the divisors of a positive integer $n$. In this paper, for real or complex values of $\alpha$, we define and study some properties of two new divisor…
Pointwise H\"older exponents describe the degree of regularity of a function near a point. For a function $f:\mathbb{R}\to\mathbb{R}$, a number $\alpha>0$ and a point $t_0\in\mathbb{R}$, write $f\in C^\alpha(t_0)$ if there is a constant $C$…
This paper naturally extends and generalizes our previous work "Thue-Morse constant is not badly approximable", arXiv:1407.3182 [math.NT]. Here we consider the Laurent series $f_d(x) = \prod_{n=0}^\infty (1 - x^{-d^n})$, $d\in\mathbb{N}$,…
Some fractional Newton methods have been proposed in order to find roots of nonlinear equations using fractional derivatives. In this paper we introduce a fractional Newton method with order $\alpha+1$ and compare with another fractional…
In modern usage the Bernoulli numbers and Bernoulli polynomials follow Euler's approach and are defined using generating functions. We consider the functional equation $f(x)+x^k=f(x+1)$ and show that a solution can be derived from…
We consider continuous functions f : [0,1] \to R that cut the real axis at every point of a measurable set of positive measure and we construct examples where f fails to have bounded variation, and at the opposite end, where f admits…
In a previous paper we considered a positive function f, uniquely determined for s>0 by the requirements f(1)=1, log(1/f) is convex and the functional equation f(s)=psi(f(s+1)) with psi(s)=s-1/s. We prove that the meromorphic extension of f…
We introduce two algorithms for accurately evaluating powers to a positive integer in floating-point arithmetic, assuming a fused multiply-add (fma) instruction is available. We show that our log-time algorithm always produce…
For a discrete function $f\left( x\right) $ on a discrete set, the finite difference can be either forward and backward. If $f\left( x\right) $ is a sum of two such functions $f\left( x\right) =f_{1}\left( x\right) +f_{2}\left( x\right) $,…
The number of tuples with positive integers pairwise relatively prime to each other with product at most $n$ is considered. A generalization of $\mu^{2}$ where $\mu$ is the M\"{o}bius function is used to formulate this divisor sum and…
For $k\geq 2$, the $k$-generalized Fibonacci sequence $(F_n^{(k)})_{n}$ is defined by the initial values $0,0,\ldots,0,1$ ($k$ terms) and such that each term afterwards is the sum of the $k$ preceding terms. In this paper, we search for…
The nearest integer continued fraction of a real number $x$ from $[-1/2, 1/2)$ is defined. Some metrical properties of these expansions are presented. We define the approximation coefficients and give an important result on them. The main…
Let $f$ be a positive multiplicative function and let $k\geq 2$ be an integer. We prove that if the prime values $f(p)$ converge to $1$ sufficiently slowly as $p\rightarrow +\infty$, in the sense that $\sum_{p}|f(p)-1|=\infty$, there exists…
Franel and Landau derived an arithmetic statement involving the Farey sequence that is equivalent to the Riemann hypothesis. Since there is a relationship between the Mertens function and the Riemann hypothesis, there should be a…
The arithmetic function of two variables is defined. Some properties of the function are given along with the formula that is an analog of the so-called Mobius' inversion formula. A heuristic statement is suggested.
We consider the problem of characterizing all functions $f$ defined on the set of integers modulo $n$ with the property that an average of some $n$th roots of unity determined by $f$ is always an algebraic integer. Examples of such…