Related papers: A note on the $\Sopfr(n)$ function
We define the $k$-dimensional generalized Euler function $\varphi_k(n)$ as the number of ordered $k$-tuples $(a_1,\ldots,a_k)\in {\Bbb N}^k$ such that $1\le a_1,\ldots,a_k\le n$ and both the product $a_1\cdots a_k$ and the sum $a_1+\cdots…
In this paper a small survey is presented on eighteen new functions and four new sequences, such as: Inferior/Superior f-Part, Fractional f-Part, Complementary function with respect with another function, S-Multiplicative, Primitive…
The paper compares the asymptotic of the expressions $\frac {1} {x} \sum\limits_{n \leq x} {f(n)}$ and $\sum\limits_{n \leq x} {\frac {f(n)} {n}}$, $\frac {1} {x} \sum\limits_{p \leq x} {f(p)}$ and $\sum\limits_{p \leq x} {\frac {f(p)}…
Let omega(n) be the number of distinct prime factors dividing n and m > n natural numbers. We calculate a formula showing which prime numbers in which intervals divide a given binomial coefficient. From this formula we get an identity…
We investigate the problem of the distribution of sums of functions of prime numbers located on an arithmetic progression. This problem is closely related to the problem of the distribution of prime numbers on an arithmetic progression.…
We develop a theory of multiplicative functions (with values inside or on the unit circle) in arithmetic progressions analogous to the well-known theory of primes in arithmetic progressions.
A representation of divisor function $\tau(n)\equiv \sigma_{0}(n)$ by means of logarithmic residue of a function of complex variable is suggested. This representation may be useful theoretical instrument for further investigations of…
Having a function $f$ and a set of functionals $\{\mathcal{C}_{n}\}$, $c_n^f \equiv \mathcal{C}_n \left(f\right)$, one can interpret function approximation very generally as a construction of some function $\mathcal{A}_{N}^{f}$ such that…
A natural connection between rational functions of several real or complex variables, and subspace collections is explored. A new class of function, superfunctions, are introduced which are the counterpart to functions at the level of…
Aggregation functions are generally defined and used to combine several numerical values into a single one, so that the final result of the aggregation takes into account all the individual values in a given manner. Such functions are…
The series of some new estimates for the sums of the type \[ S_{q}(x;f)\,=\,\mathop{{\sum}'}\limits_{n\leqslant x}f(n)e_{q}(an^{*}+bn) \] is obtained. Here $q$ is a sufficiently large integer, $\sqrt{q}(\log{q})\!\ll\!x\leqslant q$, $a,b$…
This paper is devoted to study some expressions of the type $\prod_{p} p^{\lfloor\frac{x}{f(p)}\rfloor}$, where $x$ is a nonnegative real number, $f$ is an arithmetic function satisfying some conditions, and the product is over the primes…
A representation number is a function which expresses the number of ways an integer can be written as a sum of elements of chosen sets. One of the oldest number-theoretic results on representation numbers is Fermat's theorem which says that…
The Fourier transform is naturally defined for integrable functrions. Otherwise, it should be stipulated in which sense the Fourier transform is understood. We consider some class of radial and, generally saying, nonintegrable functions.…
Let $w(n)$ be an additive non-negative integer-valued arithmetic function which is equal to $1$ on primes. We study the distribution of $n + w(n)$ $\pmod p$ and give a lower bound for the density of the set of numbers which are not…
Let $N(n)$ denote the number of isomorphism types of groups of order $n$. We consider the integers $n$ that are products of at most $4$ not necessarily distinct primes and exhibit formulas for $N(n)$ for such $n$.
Define {\em the Liouville function for $A$}, a subset of the primes $P$, by $\lambda_{A}(n) =(-1)^{\Omega_A(n)}$ where $\Omega_A(n)$ is the number of prime factors of $n$ coming from $A$ counting multiplicity. For the traditional Liouville…
A sharper estimate for the summatory Euler phi function $\sum_{n \leq x} \varphi(n)$ is presented in this work. It improves the established estimate in the current mathematical literature. In addition, an estimate for its reciprocal…
Based on new explicit estimates for the prime counting function, we improve the currently known estimates for the particular sequence $C_n = np_n - \sum_{k \leq n}p_k$, $n \geq 1$, involving the prime numbers.
Quite recently, in [8] the authoor of this paper considered the distribution of primes in the sequence $(S_n)$ whose $n$th term is defined as $S_n=\sum_{k=1}^{2n}p_k$, where $p_k$ is the $k$th prime. Some heuristic arguments and the…