相关论文: On Sinha's note on perfect numbers
We give an elementary proof that the sum of the digits of $2^n$ in base 10 is greater than $\log_4 n$. In particular, the limit of the sum of digits of $2^n$ is infinite.
We provide a way to modify and to extend a previously established inequality by P. Erd\H{o}s, R. Graham and others and to answer a conjecture posed in the nineties by R. Graham, which bears on the lack of divisibility of the central…
An orthomorphism is a permutation $\sigma$ of $\{1, \dots, n-1\}$ for which $x + \sigma(x) \mod n$ is also a permutation on $\{1, \dots, n-1\}$. Eberhard, Manners, Mrazovi\'c, showed that the number of such orthomorphisms is $(\sqrt{e} +…
The starting point of this work is an equality between two quantities $A$ and $B$ found in the literature, which involve the {\em doubling-modulo-an-odd-integer} map, i.e., $x\in {\mathbb N} \mapsto 2x \bmod{(2n+1)}$ for some positive…
A positive integer $n$ is said to be a practical number if every integer in $[1,n]$ can be represented as the sum of distinct divisors of $n$. In this article, we consider practical numbers of a given polynomial form. We give a necessary…
Let $pod_2(n)$ denote the number of $2$-regular partitions of $n$ with distinct odd parts (even parts are unrestricted). In this article, we obtain congruences for $pod_2(n)$ mod $2$ and mod $8$ using some generating function manipulations…
The problem of finding the sum of a polynomial's values is considered. In particular, for any $n\geq 3$, the explicit formula for the sum of the $n$th powers of natural numbers $S_n=\sum_{x=1}^{m}x^{n}$ is proved:…
We generalize the definition of spoof perfect numbers to multiperfect numbers and study their characteristics. As a result, we find several new odd spoof multiperfect numbers, akin to Descartes' number. An example is $8999757$, which would…
Dris conjectured in his masters thesis that the inequality $q^k < n$ always holds, if $N = {q^k}{n^2}$ is an odd perfect number with special prime $q$. In this note, we initially show that either of the two conditions $n < q^k$ or…
This note presents a new proof of the well-known Strichartz estimates for the Schr\"odinger equation in $2+1$ dimensions, building on ideas from our recent work \cite{MO}.
In this paper, it is proved that every sufficiently large even integer can be represented as the sum of two squares of primes, two cubes of primes, two biquadrates of primes and 16 powers of 2. Furthermore, there are at least 5.313% odd…
Given odd, coprime integers $a$, $b$ ($a>0$), we consider the Diophantine equation $ax^2+b^{2l}=4y^n$, $x, y\in\Bbb Z$, $l \in \Bbb N$, $n$ odd prime, $\gcd(x,y)=1$. We completely solve the above Diophantine equation for…
In this paper, the compositional inverses of a class of linearized permutation polynomials of the form $P(x)=x+x^2+\tr(\frac{x}{a})$ over the finite field $\mathbb{F}_{2^n}$ for an odd positive integer $n$ are explicitly determined.
For all finite fields of order up to $2^{30}$, we computationally prove that there are no planar monomials besides the ones already known.
The `odd cover number' of a complete graph is the smallest size of a family of complete bipartite graphs that covers each edge an odd number of times. For $n$ odd, Buchanan, Clifton, Culver, Nie, O'Neill, Rombach and Yin showed that the odd…
Euler showed that if an odd perfect number $N$ exists, it must consist of two parts $N=q^k n^2$, with $q$ prime, $q \equiv k \equiv 1 \pmod{4}$, and gcd$(q,n)=1$. Dris conjectured that $q^k < n$. We first show that $q<n$ for all odd perfect…
We find bounds for the maximal length of a sequence of distinct $\bf{\Gamma_{2n+1,m}}$-sets under $AD$ and show there is no sequence of distinct $\bf{\Gamma_{2n+1}}$-sets of length $\bf{\delta^1_{2n+3}}$. As a special case, there is no…
Complex orthogonal designs (CODs) are used to construct space-time block codes. COD $\mathcal{O}_z$ with parameter $[p, n, k]$ is a $p\times n$ matrix, where nonzero entries are filled by $\pm z_i$ or $\pm z^*_i$, $i = 1, 2,..., k$, such…
This paper investigates the impossibility of certain $({n^2+n+k}_{n+1})$ configurations. Firstly, for $k=2$, the result of \cite{gropp1992non} that $\frac{n^2+n}{2}$ is even and $n+1$ is a perfect square or $\frac{n^2+n}{2}$ is odd and…
We shall show that 2 and 9 are the only biunitary superperfect numbers.