Related papers: A variation of a congruence of Subbarao for n=2^(a…
Let $\sigma(n)$ be the sum of the positive divisors of $n$. A number $n$ is said to be 2-near perfect if $\sigma(n) = 2n +d_1 +d_2 $, where $d_1$ and $d_2$ are distinct positive divisors of $n$. We give a complete description of those $n$…
Let ${\mathcal{P}_{n}}$ denote the set of positive integers which are prime to $n$. Let $B_{n}$ be the $n$-th Bernoulli number. For any prime $p\ge 5$ and $r\ge 2$, we prove that \begin{equation} \sum\limits_{\begin{smallmatrix}…
In this paper, basing on the linear algebra methods and elementary techniques, for any positive integers $ e $ and $ n $, we obtain a recursion formula for the generalized Euler function $ \varphi_e(n) $, which is determined by some…
In 2014, Wang and Cai established the following harmonic congruence for any odd prime $p$ and positive integer $r$, \begin{equation*} \sum\limits_{i+j+k=p^{r}\atop{i,j,k\in \mathcal{P}_{p}}}\frac{1}{ijk}\equiv-2p^{r-1}B_{p-3} ~(\bmod ~…
Suppose that $\ell \geq 5$ is prime. For a positive integer $N$ with $4 \mid N$, previous works studied properties of half-integral weight modular forms on $\Gamma_0(N)$ which are supported on finitely many square classes modulo $\ell$, in…
We prove that for each odd prime p, positive integer alpha, and non-negative integers beta and gamma, the Diophantine equation X^{2N} + 2^{2 alpha} 5^{2 beta} p^{2 gamma} = Z^5 has no solution with X, Z, N in Z^+, N > 1, and gcd(X,Z) = 1.
Inspired by Cohen and te Riele~\cite{Cohen1996}, who computationally verified that for every $n \leq 400$ there exists $k$ such that $\sigma^k(n) \equiv 0 \pmod{n}$ (where $\sigma^k$ denotes the $k$-fold iteration of the sum-of-divisors…
For various positive integers $k$, the sums of $k$th powers of the first $n$ positive integers, $S_k(n+1)=1^k+2^k+...+n^k$, have got to be some of the most popular sums in all of mathematics. In this note we prove that for each $k\ge 2 $$…
For any relatively prime integers $r$ and $s$, let $a_{r,s}(n)$ denote the number of $(r,s)$-regular partitions of a positive integer of $n$ into distinct parts. Prasad and Prasad (2018) proved many infinite families of congruences modulo 2…
Recently there has been quite a bit of study carried out related to arithmetic properties of overpartitions into non-multiples of two co-prime integers. The paper [19] by Nadji et al. looked into congruences modulo $3$ and powers of $2$ for…
The arithmetic properties of the ordinary partition function $p(n)$ have been the topic of intensive study for the past century. Ramanujan proved that there are linear congruences of the form $p(\ell n+\beta)\equiv 0\pmod\ell$ for the…
We will study the solution of a congruence, $x \equiv g^{(1/2)\omega_g(2^n)} \bmod 2^n$, depending on the integers $g$ and $n$, where $\omega_g(2^n)$ denotes the order of $g$ modulo $2^n$. Moreover, we introduce an application of the above…
Let $f(n)$ denote the number of 1-shell totally symmetric plane partitions of weight $n$. Recently, Hirschhorn and Sellers, Yao, and Xia established a number of congruences modulo 2 and 5, 4 and 8, and 25 for $f(n)$, respectively. In this…
A solitary number is a positive integer that shares its abundancy index only with itself. $10$ is the smallest positive integer suspected to be solitary, but no proof has been established so far. In this paper, we prove that not all half of…
Let $c_N(n)$ denotes the number of bipartitions $(\lambda, \mu)$ of a positive integer $n$ subject to the restriction that each part of $\mu$ is divisible by $N$. In this paper, we prove some congruence properties of the function $c_N(n)$…
Lehmer's totient problem asks whether there exists any composite number $n$ such that $\varphi(n) \, \mid \, (n-1)$, where $\varphi$ is Euler totient function. It is known that if any such $n$ exists, it must be Carmichael and $n >…
Let $\overline{p}_{j,k}(n)$ denotes the number of $(j,k)$-regular overpartitions of a positive integer $n$ such that none of the parts is congruent to $j$ modulo $k$. Naika et. al. (2021) proved infinite families of congruences modulo…
We give a closed-form expression for $\varphi(1+\varphi(2+\varphi(3+...+\varphi(n)$, where $\varphi$ is Euler's totient function. More generally, for an integer sequence $A=\{a_j\}$ we study the value of…
Let $p(n)$ denote the partition function. In this article, we will show that congruences of the form $$ p(m^j\ell^kn+B)\equiv 0\mod m \text{for all} n\ge 0 $$ exist for all primes $m$ and $\ell$ satisfying $m\ge 13$ and $\ell\neq 2,3,m$.…
Let $\overline{p}(n)$ be the number of overpartitions of $n$, we establish and give a short elementary proof of the following congruence \[\overline{p}({{4}^{\alpha }}(40n+35))\equiv 0 \, (\bmod \, 40),\] where $\alpha ,n $ are nonnegative…