Related papers: Some remarks on sum of Euler's totient function

Denote by $\tau$ k (n), $\omega$(n) and $\mu$ 2 (n) the number of representations of n as product of k natural numbers, the number of distinct prime factors of n and the characteristic function of the square-free integers, respectively. Let…

This research presents the results of a study on the existence and frequency distribution of the shell primes defined herein as prime numbers that result from the calculation of the "half-shell" of an p-dimensional entity of the form…

We prove that neither a prime nor {an l-almost prime} number theorem hold in the class of regular Toeplitz subshifts. But, {when a quantitative strengthening of the regularity with respect to the periodic structure involving Euler's totient…

Given an integer $n \ge 2$, its prime factorization is expressed as $n= \prod_{i=1}^s p_i^{a_i}$. We define the function $f(n)$ as the smallest positive integer such that $f(n)!$ is divisible by $n$. The main objective of this paper is to…

We introduce a natural definition for sums of the form \[ \sum_{\nu=1}^x f(\nu) \] when the number of terms x is a rather arbitrary real or even complex number. The resulting theory includes the known interpolation of the factorial by the…

In this short, we study sums of the shape $\sum_{n\leqslant x}{f([x/n])}/{[x/n]},$ where $f$ is Euler totient function $\varphi$, Dedekind function $\Psi$, sum-of-divisors function $\sigma$ or the alternating sum-of-divisors function…

We present a function that tests for primality, factorizes composites and builds a closed form expression of $\pi(n^2)$ in terms of $\sum_{3 \leq p \leq n} \frac{1}{p}$ and a weaker version of $\omega(n)$.

The divisor function $\sigma(n)$ denotes the sum of the divisors of the positive integer $n$. For a prime $p$ and $m \in \mathbb{N}$, the $p$-adic valuation of $m$ is the highest power of $p$ which divides $m$. Formulas for…

In this work we discuss Dirichlet products evaluated at Fibonacci numbers. As first applications of the results we get a representation of Fibonacci numbers in terms of Euler's totient function, an upper bound on the number of primitive…

Jacobsthal's function h(k) represents the smallest number m such that every sequence of m consecutive integers contains an integer coprime to P_k, the product of the first k primes. The best known bound on h(k) is h(k) < C (k ln k)^2 for…

Let $ x\geq 1 $ be a large number, let $ [x]=x-\{x\} $ be the largest integer function, and let $ \varphi(n)$ be the Euler totient function. The result $ \sum_{n\leq x}\varphi([x/n])=(6/\pi^2)x\log x+O\left ( x(\log x)^{2/3}(\log\log…

In this paper we give some interesting identities between Euler numbers and zeta functions. Finally we will give the new values of Euler zeta function at positive even integers.

We investigate the average number of representations of a positive integer as the sum of $k + 1$ perfect $k$-th powers of primes. We extend recent results of Languasco and the last Author, which dealt with the case $k = 2$ [6] and $k = 3$…

We define a family {$\gamma(P)$} of generalized Euler constants indexed by finite sets of primes $P$ and study their distribution. These arise from partial sums of reciprocals of integers not divisible by any prime in $P$. An apparent…

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…

We investigate the Waring-Goldbach problem of representing a positive integer $n$ as the sum of $s$ $k$th powers of almost equal prime numbers. Define $s_k=2k(k-1)$ when $k\ge 3$, and put $s_2=6$. In addition, put $\theta_2=\frac{19}{24}$,…

Let $k \ge 2$ be a fixed integer. We define the multiplicative function $D_k(n) = d_k(n)/d_k^*(n)$, such that $d_k(n)$ is the Piltz divisor function and $d_k^*(n) = k^{\omega(n)}$ is its unitary analogue, where $\omega(n)$ is the number of…

We show that for some $k\le 3570$ and all $k$ with $442720643463713815200|k$, the equation $\phi(n)=\phi(n+k)$ has infinitely many solutions $n$, where $\phi$ is Euler's totient function. We also show that for a positive proportion of all…

In this paper we investigate a certain category of cotangent sums and more specifically the sum $$\sum_{m=1}^{b-1}\cot\left(\frac{\pi m}{b}\right)\sin^{3}\left(2\pi m\frac{a}{b}\right)\:$$ and associate the distribution of its values to a…

We introduce Euler summability method for sequences of fuzzy numbers and state a Tauberian theorem concerning Euler summability method, of which proof provides an alternative to that of K. Knopp[\"Uber das Eulersche Summierungsverfahren II,…