Related papers: A Generalisation of Euler Totient Function

The discrete Fourier transform of the greatest common divisor is a multiplicative function that generalises both the gcd-sum function and Euler's totient function. On the one hand it is the Dirichlet convolution of the identity with…

We study the arithmetic function sopfr$(n)$ (OEIS A001414) which gives the sum of prime factors (with repetition) of a number $n$. In particular we obtain the asymptotic formula $$ \sum_{n \leq x} \rm{sopfr}(n) \sim \frac{\pi^2}{12}…

Let $\mathcal{F}_{n}^*$ be the set of Boolean functions depending on all $n$ variables. We prove that for any $f\in \mathcal{F}_{n}^*$, $f|_{x_i=0}$ or $f|_{x_i=1}$ depends on the remaining $n-1$ variables, for some variable $x_i$. This…

Let $n=p_1^{\nu_1}... p_r^{\nu_r} >1$ be an integer. An integer $a$ is called regular (mod $n$) if there is an integer $x$ such that $a^2x\equiv a$ (mod $n$). Let $\varrho(n)$ denote the number of regular integers $a$ (mod $n$) such that…

Let $\phi(n)$denote Euler's phi function. We study the distribution of the numbers $gcd(n,\phi(n))$ and their divisors. Our results generalize previous results of Erd\H{o}s and Pollack.

We prove unconditionally that for each $\ell \geq 1$, the difference $\phi(p-\ell) - \phi(p+\ell)$ is positive for $50\%$ of odd primes $p$ and negative for $50\%$.

We define a generalization of the Eulerian polynomials and the Eulerian numbers by considering a descent statistic on segmented permutations coming from the study of 2-species exclusion processes and a change of basis in a Hopf algebra. We…

The {\em Total Influence} ({\em Average Sensitivity) of a discrete function is one of its fundamental measures. We study the problem of approximating the total influence of a monotone Boolean function \ifnum\plusminus=1 $f: \{\pm1\}^n…

We introduce and analyse a general class of not necessarily bounded multiplicative functions, examples of which include the function $n \mapsto \delta^{\omega (n)}$, where $\delta \neq 0$ and where $\omega$ counts the number of distinct…

We examine the sums $S(k,\,n)$ of the $k-$th powers of the $\phi(n)$ integers $\alpha_1<\alpha_2<\cdots<\alpha_{\phi(n)}$ less than and prime to $n$ (Euler set) and prove a formula (new) for $S(3,\,n)$. If $n$ equals a prime $p$, we prove a…

Finding the mean square averages of the Dirichlet $L$-functions over Dirichlet characters $\chi$ of same parity is an active problem in number theory. Here we explicitly evaluate such averages of $L(3,\chi)$ and $L(4,\chi)$ using certain…

We obtain two sequences of rational numbers which converge to the Euler-Gompertz constant. Denote by <f(x)> the integral of f(x)e^{-x} from 0 to infinity. Recall that the Euler-Gompertz constant \delta is <ln(x+1)>. Main idea. Let P_n(x) be…

In this report, we show that all n-variable Boolean function can be represented as polynomial threshold functions (PTF) with at most $0.75 \times 2^n$ non-zero integer coefficients and give an upper bound on the absolute value of these…

The Green-Tao-Ziegler theorem provides asymptotics for the number of prime tuples of the form $(\psi_1(n),\ldots,\psi_t(n))$ when $n$ ranges among the integer vectors of a convex body $K\subset [-N,N]^d$ and $\Psi=(\psi_1,\ldots,\psi_t)$ is…

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…

Let $\Phi_k(n)=|\{ (x_1, x_2, \cdots, x_k)\in \left(\mathbb{Z}/n\mathbb{Z}\right)^k; \ \gcd(x_1^2+x_2^2+ \cdots+ x_k^2, n)=1\}|$ be a general totient function introduced first by Cald\'{e}ron et. al. Motivated by the classical works of…

A nonempty subset A of {1,2,...,n} is called primitive if gcd(A)=1. Let f(n) and f_k(n) denote, respectively, the number of primitive subsets and the number of primitive subsets of cardinality k of {1,2,...,n}. Recursion formulas and…

Motivated by a question of V. Bergelson and F. K. Richter (2017), we obtain asymptotic formulas for the number of relatively prime tuples composed of positive integers $n\le N$ and integer parts of polynomials evaluated at $n$. The error…

In 2000 Deaconescu raised a question whether there exists a composite $n$ for which $S_2(n)|\phi(n)-1$, where $\phi(n)$ is Euler's function and $S_2(n)$ is Schemmel's totient function. In this paper we prove that any such $n$ is odd,…

The function $\inf_n nx^{1/n}$ has the asymptotics $eu+e d^2(u)/(2u)+O(1/u^2)$ as $x\to\infty$, where $u=\log x$ and $d(u)$ is the distance from $u$ to the nearest integer. We generalize this observation. First, the curves $y=nx^{1/n}$ can…