Related papers: A variation of a congruence of Subbarao for n=2^(a…

Let $q$ be a large prime number, $a$ be any integer, $\epsilon$ be a fixed small positive quantity. Friedlander and Shparlinksi \cite{FSh} have shown that there exists a positive integer $n\ll q^{5/2+\epsilon}$ such that $\phi(n)$ falls…

Let $\sigma(n)$ be the sum of the positive divisors of $n$. A positive integer $n$ is said to be $2$-near perfect when $\sigma(n)=2n+d_1+d_2$, where $d_1$ and $d_2$ are distinct positive divisors of $n$. We show that there are no odd…

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…

It is well-known that the congruence $\sum_{i=1}^{ n} i^{ n} \equiv 1 \pmod{n}$ has exactly five solutions: $\{1,2,6,42,1806\}$. In this work, we characterize the solutions to the congruence $1^n + 2^n + \dotsb + n^n\equiv p \pmod{n}$ for…

Alanzi et al. (2022) investigated overpartition of a positive integer $n$ with $\ell$-regular non-overlined parts denoted by $\overline R_\ell^\ast (n)$, and proved some results for the case $\ell=3$. As extension to the results of Alanzi…

In this note, we show that each positive rational number can be written as $\varphi(m^2)/\varphi(n^2)$, where $\varphi$ is Euler's totient function and $m$ and $n$ are positive integers.

For a pair of distinct non-CM newforms of weights at least 2, having rational integral Fourier coefficients $a_{1}(n)$ and $a_{2}(n)$, under GRH, we obtain an estimate for the set of primes $p$ such that $$ \omega(a_1(p)-a_2(p)) \le […

We study the validity of congruence inclusions of the form $ \alpha ( \beta \circ \alpha \gamma \circ \beta \circ \dotsc \circ \alpha \gamma \circ \beta ) \subseteq \alpha \beta \circ \alpha \gamma \circ \alpha \beta \circ \dots$ in…

Let $p(n)$ be the ordinary partition function. In the 1960s Atkin found a number of examples of congruences of the form $p( Q^3 \ell n+\beta)\equiv0\pmod\ell$ where $\ell$ and $Q$ are prime and $5\leq \ell\leq 31$; these lie in two natural…

We will describe an algorithm to arrange all the positive and negative integer numbers. This array of numbers permits grouping them in six different Classes, $\alpha$, $\beta$, $\gamma$, $\delta$, $\epsilon$, and $\zeta$. Particularly,…

In recent work with Raum the authors considered congruences for the ordinary partition function $p(n)$ of the form $p(\ell Q^r n+\beta)\equiv 0\pmod\ell$ where $\ell, Q\geq 5$ are prime and $r\in \{1,2\}$, and proved a number of results…

Sums of $M$ consecutive squared integers $\left(a+i\right)^{2}$ equaling squared integers (for $a\geq1$, $0\leq i\leq M-1$) yield certain linear groupings of pairs $\left(a_{1},a_{2}\right)$ of $a$ values for successive same values of $M$…

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 investigate Ramanujan congruences for the function which counts the overpartitions of n with restricted odd differences. In particular, we show that only one such congruence exists. Our method involves using the theory of modular forms…

Let $p$ be a prime number with $p>3$, $p\equiv 3\pmod{4}$ and let $n$ be a positive integer. In this paper, we prove that the Diophantine equation $(5pn^{2}-1)^{x}+(p(p-5)n^{2}+1)^{y}=(pn)^{z}$ has only the positive integer solution…

Euler totient function $\phi(n)$ plays a central role in number theory and is applied in areas such as cryptography. In this paper, we study iterations of the totient function. We first prove that for any integer $n>2$, iteratively applying…

Let $\sigma(x)$ be the sum of the divisors of $x$. If $N$ is odd and $\sigma(N) = 2N$, then the odd perfect number $N$ is said to be given in Eulerian form if $N = {q^k}{n^2}$ where $q$ is prime with $q \equiv k \equiv 1 \pmod 4$ and…

A positive integer n is said to be perfect if sigma(n)=2n, where sigma denotes the sum of the divisors of n. In this article, we show that if n is an even perfect number, then any integer m<=n is expressed as a sum of some of divisors of n.

Let $\sigma(n)$ be the sum of the divisors of $n$. Kalita and Saikia defined a number $n$ to be near superperfect if $2n+d=\sigma(\sigma(n))$ for some positive divisor $d$ of $n$. We extend some of their results about near superperfect…

In a recent work, Dancs and He found an Euler-type formula for $\,\zeta{(2\,n+1)}$, $\,n\,$ being a positive integer, which contains a series they could not reduce to a finite closed-form. This open problem reveals a greater complexity in…