Related papers: On the difference in values of the Euler totient f…

We show that whenever $\delta>0$, $\eta$ is real and constants $\lambda_i$ satisfy some necessary conditions, there are infinitely many prime triples $p_1,\, p_2,\, p_3$ satisfying the inequality $|\lambda_1p_1 + \lambda_2p_2 +…

We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that…

Lehmer conjectured that Ramanujan's tau function never vanishes. As a variation of this conjecture, it is proved that \begin{equation*} \tau(n)\neq \pm \ell, \pm 2\ell, \pm 2\ell^2, \end{equation*} where $\ell<100$ is an odd prime, by…

We consider almost-primes of the form $f(p)$ where $f$ is an irreducible polynomial over $\mathbb Z$ and $p$ runs over primes. We improve a result of Richert for polynomials of degree at least $3$. In particular we show that, when the…

It is shown that the behavior of the solutions of the nonlinear recursion $y(\ell + 1) = [1-y(\ell)]^p$ -- where the dependent variable $y(l)$ is a real number, $\ell= 0; 1; 2...$ is the independent variable, and $p$ is an arbitrary…

Let $b>1$ be an odd positive integer and $k, l \in \mathbb{N}$. In this paper, we show that every positive rational number can be written as $\varphi(m^{2})/(\varphi(n^{2}))^{b}$ and $\varphi(k(m^{2}-1))/\varphi(ln^{2})$, where $m, n\in…

Let $\xi$ and $m$ be integers satisfying $\xi\ne 0$ and $m\ge 3$. We show that for any given integers $a$ and $b$, $b \neq 0$, there are $\frac{\varphi(m)}{2}$ reduced residue classes modulo $m$ each containing infinitely many primes $p$…

Let $\phi(x)=\sum \alpha_n x^n$ be a formal power series with real coefficients, and let $D$ denote differentiation. It is shown that "for every real polynomial $f$ there is a positive integer $m_0$ such that $\phi(D)^mf$ has only real…

Let $\phi(\cdot)$ and $\sigma(\cdot)$ denote the Euler function and the sum of divisors function, respectively. In this paper, we give a lower bound for the number of positive integers $m\le x$ for which the equation $m=n-\phi(n)$ has no…

We prove that an odd number is an Euler pseudoprime for exactly one half of the admissible bases if and only if it is a special Carmichael number.

Euler's totient function counts the positive integers up to a given integer n that are relatively prime to n. The aim of this article is to give a result about the sum of euler's totient function from k equal 1 to n whene p divides n and p…

We obtain an upper bound for the sum $\sum_{n\leq N} (a_{n}/\varphi (a_{n}))^{s}$, where $\varphi$ is Euler's totient function, $s\in \mathbb{N}$, and $a_{1},\ldots, a_{N}$ are positive integers (not necessarily distinct) with some…

For all positive integers $\ell$, we prove non-trivial bounds for the $\ell$-torsion in the class group of $K$, which hold for almost all number fields $K$ in certain families of cyclic extensions of arbitrarily large degree. In particular,…

A composite number $n$ is called a Lehmer number when $\phi(n) | n - 1$, where $\phi$ is the Euler totient function. Lehmer's totient problem asks if there exist any composite numbers $n$ such that $\phi(n)| n-1$? No such numbers are known.…

Let $\ell \geq 5$ be prime. For the partition function $p(n)$ and $5 \leq \ell \leq 31$, Atkin found a number of examples of primes $Q \geq 5$ such that there exist congruences of the form $p(\ell Q^{3} n+\beta) \equiv 0 \pmod{\ell}.$…

Ramanujan's celebrated partition congruences modulo $\ell\in \{5, 7, 11\}$ assert that $$ p(\ell n+\delta_{\ell})\equiv 0\pmod{\ell}, $$ where $0<\delta_{\ell}<\ell$ satisfies $24\delta_{\ell}\equiv 1\pmod{\ell}.$ By proving Subbarao's…

Let $n$ be a positive integer, $p$ be an odd prime and integers $a,b \not= 0$ with $gcd(a,b)=1$, $p \nmid ab$, and $p|(a^n \pm b^n)$, we prove the identity $$\nu_p(a^n \pm b^n)-\nu_p(n)=\nu_p(a^{p-1}-b^{p-1}).$$ An unintended interesting…

An odd prime $p$ is called irregular with respect to Euler polynomials if it divides the numerator of one of the numbers $$E_1(0),E_{3}(0),\ldots,E_{p-2}(0),$$ where $E_n(x)$ is the $n$-th Euler polynomial. As in the classical case, we link…

We prove lower bounds for the number of primes $p \leq N + b$ such that $p-b$ is divisible by $2^{k(N)}$ and has at most $k$ odd prime factors ($k \geq 2$), assuming $2^{k(N)} \leq N^\theta$ for some $\theta > 0$ depending on $k$. The proof…

In this paper we propose a construction of $p$-adic Euler $\ell$-function using Kubota-Leopoldt's approach and Washington's one. We also compute the derivative of $p$-adic Euler $\ell$-function at $s=0$ and the values of $p$-adic Euler…