Related papers: Odd Multiperfect Numbers
Let $h_{(m,k)}$ be the class number of $\mathbb{Q}(\sqrt{1-2m^k}).$ We prove that for any odd natural number $k,$ there exists $m_0$ such that $k \mid h_{(m,k)}$ for all odd $m > m_0.$ We also prove that for any odd $m \geq 3,$ $k \mid…
We consider some natural sets of real numbers arising in ergodic theory and show that they are, respectively, complete in the classes $\mathcal D_2 (\mathbf\Pi^0_3)$ and $\mathcal D_\omega (\mathbf \Pi^0_3)$, that is, the class of sets…
In this article, based on ideas and results by J. S\'andor (2001, 2004), we define $k$-multiplicatively $e$-perfect numbers and $k$-multiplicatively $e$-superperfect numbers and prove some results on them. We also characterize the…
We study some divisibility properties of quasiperfect numbers. We show that if $N=(p_1 p_2 \cdots p_t)^{2a}=m^2$ is quasiperfect, then $2a+1$ is divisible by $3$ and $N$ has at least one prime factor smaller than $\exp 716.7944$. Moreover,…
Let $\mathrm{pod}(n)$ denote the number of partitions of $n$ with odd parts distinct, and ${{r}_{k}}(n)$ be the number of representations of $n$ as sum of $k$ squares. We find the following two arithmetic relations: for any integer $n\ge…
We call an order $O$ in a quadratic field $K$ odd (resp. even) if its discriminant is an odd (resp. even) integer. We call an elliptic curve $E$ over the field $C$ of complex numbers with CM odd (resp. even) if its endomorphism ring…
In this paper, we introduce the concept of $F$-perfect number, which is a positive integer $n$ such that $\sum_{d|n,d<n}d^2=3n$. We prove that all the $F$-perfect numbers are of the form $n=F_{2k-1}F_{2k+1}$, where both $F_{2k-1}$ and…
An integer of the form $P_m(x)= \frac{(m-2)x^2-(m-4)x}{2}$ for an integer $x$, is called a generalized $m$-gonal number. For positive integers $\alpha_1,\dots,\alpha_u$ and $\beta_1,\dots,\beta_v$, a mixed sum…
In this paper, we calculate an exact formula for the number of partitions of a natural number $n$, where the largest part is even and no odd parts appears more than two times. The generating functions of the number of these partitions is a…
If \(A \) is a set of natural numbers containing \(0 \), then there is a unique nonempty "reciprocal" set \(B \) of natural numbers (containing \(0 \)) such that every positive integer can be written in the form \(a + b \), where \(a \in A…
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…
The famous partition theorem of Euler states that partitions of $n$ into distinct parts are equinumerous with partitions of $n$ into odd parts. Another famous partition theorem due to MacMahon states that the number of partitions of $n$…
We give a natural notion of (non-exact) integral functor in the context of k-linear and graded categories. In this broader sense, we prove that every k-linear and graded functor is integral.
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…
Let $\mathrm{pod}_{-4}(n)$ denote the number of partition quadruples of $n$ where the odd parts in each partition are distinct. We find many arithmetic properties of $\mathrm{pod}_{-4}(n)$ involving the following infinite family of…
We shall give some results for an integer divisible by its unitary totient.
Let $\sigma(n)$ denote the sum of the positive divisors of $n$. We prove that for any positive integer $k$, there is a number $m$ for which the equation $\sigma(x)=m$ has exactly $k$ solutions, settling a conjecture of Sierpi\'nski from…
For an integer n, a set of m distinct nonzero integers {a_1,a_2,...,a_m} such that a_i a_j+n is a perfect square for all 0<i<j<m+1, is called a D(n)-m-tuple. In this paper, we show that there are infinitely many essentially different…
Among three natural numbers there is always one which is larger than or equal to the Nim sum of the remaining two numbers. This amazing fact has many applications.
We present lower bounds on the sum and product of the distinct prime factors of an odd perfect number, which provide a lower bound on the size of the odd perfect number as a function of the number of its distinct prime factors.