Related papers: An arithmetic theorem and its demonstration

A finite sum of exponential functions may be expressed by a linear combination of powers of the independent variable and by successive integrals of the sum. This is proved for the general case and the connection between the parameters in…

In this article, we give an asymptotic bound for the exponential sum of the M\"obius function $\sum_{n \le x} \mu(n) e(\alpha n)$ for a fixed irrational number $\alpha\in\mathbb{R}$. This exponential sum was originally studied by Davenport…

In this article we obtain an explicit formula in terms of the partitions of the positive integer $n$ to express the $n$-th term of a wide class of sequences of numbers defined by recursion. Our proof is based only on arithmetics. We compare…

A recent asymptotic expansion for the positive zeros $x=j_{\nu,m}$ ($m=1,2,3,\ldots$) of the Bessel function of the first kind $J_{\nu}(x)$ is studied, where the order $\nu$ is positive. Unlike previous well-known expansions in the…

For a fixed unit vector $a=(a_1,a_2,\ldots,a_n)\in S^{n-1}$, we consider the $2^n$ sign vectors $\varepsilon=(\varepsilon^1,\varepsilon^2,\ldots,\varepsilon^n)\in \{+1,-1\}^n$ and the corresponding scalar products $\varepsilon\cdot…

Euler gives a continued fraction representation of (1 + x)n. involving 1,3,5,7,... and n^2-1,n^2-4,n^3-9,... and squares of z, for x=2y and y=z/(1-z). He evaluates this continued fraction at z=t sqrt(-1), for "vanishing" n, and for infinite…

In the paper, the author elementarily unifies and generalizes eight identities involving the functions $\frac{\pm1}{e^{\pm t}-1}$ and their derivatives. By one of these identities, the author establishes two explicit formulae for computing…

We define the $m$th-order Eulerian numbers with a combinatorial interpretation. The recurrence relation of the $m$th-order Eulerian numbers, the row generating function and the row sums of the $m$th-order Eulerian triangle are presented. We…

Let $m\in\N_{\geq 2}$ and for given $k\in\N_{+}$ consider the sequence $(A_{m,k}(n))_{n\in\N}$ defined by the power series expansion $$ \prod_{n=0}^{\infty}\frac{1}{\left(1-x^{m^{n}}\right)^{k}}=\sum_{n=0}^{\infty}A_{m,k}(n)x^{n}. $$ The…

The purpose of this paper is to give some explicit formulas involving M\"obius functions, which may be known under the generalized Riemann Hypothesis, but unconditional in this paper. Concretely, we prove explicit formulas of partial sums…

We discuss an elementary method for the evaluation of the convolution sums $\underset{\substack{ {(l,m)\in\mathbb{N}_{0}^{2}} \\ {\alpha\,l+\beta\,m=n} } }{\sum}\sigma(l)\sigma(m)$ for those $\alpha,\beta\in\mathbb{N}$ for which…

For positive integers $p_1,p_2,\ldots,p_k,q$ with $q>1$, we define the Euler $T$-sum $T_{p_1p_2\cdots p_k,q}$ as the sum of those terms of the usual infinite series for the classical Euler sum $S_{p_1p_2\cdots p_k,q}$ with odd denominators.…

Euler defines a function f(x) somehow as an infinite product and a generalization of [x], where [x] ist, what we now call following Legendre the Gamma-Funktion. He gets some recursive relationships for f(x), by applying some very nice…

Let $m\ge 2$ be a fixed positive integer. Suppose that $m^j \leq n< m^{j+1}$ is a positive integer for some $j\ge 0$. Denote $b_{m}(n)$ the number of $m$-ary partitions of $n$, where each part of the partition is a power of $m$. In this…

The Dirichlet series $L_m(s)$ are of fundamental importance in number theory. Shanks defined the generalized Euler and class numbers in connection with these Dirichlet series, denoted by $\{s_{m,n}\}_{n\geq 0}$. We obtain a formula for the…

We obtain reasonably tight upper and lower bounds on the sum $\sum_{n \leqslant x} \varphi \left( \left\lfloor{x/n}\right\rfloor\right)$, involving the Euler functions $\varphi$ and the integer parts $\left\lfloor{x/n}\right\rfloor$ of the…

In the sixth chapter of his notebooks Ramanujan introduced a method of summing divergent series which assigns to the series the value of the associated Euler-MacLaurin constant that arises by applying the Euler-MacLaurin summation formula…

In 1930s Paul Erdos conjectured that for any positive integer $C$ in any infinite $\pm 1$ sequence $(x_n)$ there exists a subsequence $x_d, x_{2d}, x_{3d},\dots, x_{kd}$, for some positive integers $k$ and $d$, such that $\mid \sum_{i=1}^k…

In this paper, we intend to revisit Theorem 2 of [3] formulating it in a way that, weakening the hypotheses and, at the same time, highlighting the richer conclusion allowed by the proof, it can potentially be applicable to a broader range…

For a function $f\colon \mathbb{N}\to\mathbb{N}$, define $N^{\times}_{f}(x)=\#\{n\leq x: n=kf(k) \mbox{ for some $k$} \}$. Let $\tau(n)=\sum_{d|n}1$ be the divisor function, $\omega(n)=\sum_{p|n}1$ be the prime divisor function, and…