Related papers: Infinitary superperfect numbers
We present several sequences of Euler sums involving odd harmonic numbers. The calculational technique is based on proper two-valued integer functions, which allow to compute these sequences explicitly in terms of zeta values only.
We consider Diophantine quintuples $\{a, b, c, d, e\}$. These are sets of distinct positive integers, the product of any two elements of which is one less than a perfect square. It is conjectured that there are no Diophantine quintuples; we…
In this paper, I proved that $$N=p_1+p_2+2p_3, p_1\sim N/2, p_2\sim N/2, p_3=o(N),$$ where $N$ is a large even number, and $p_i\ (i=1,2,3)$ are odd primes.
We prove that, for any prime number $p\geq 5$, the set of natural numbers $n$ such that $p\mid H_n$ is finite.
It is proven that, in any given base, there are infinitely many palindromic numbers having at most six prime divisors, each relatively large. The work involves equidistribution estimates for the palindromes in residue classes to large…
We show that there are infinitely many square numbers , which are constrocted by putting two square numbers together , that non of them are divisible by $10$ . We also investigate the interesting properties of some square numbers.
We present a construction of 1-perfect binary codes, which gives a new lower bound on the number of such codes. We conjecture that this lower bound is asymptotically tight.
Despite the fact that almost all real numbers are absolutely normal---that is, the digits in their expansions to any base occur in all possible configurations with the expected frequency---not one specific example of an absolutely normal…
Given integers $k_1, k_2$ with $0\le k_1<k_2$, the determinations of all positive integers $q$ for which there exists a perfect Splitter $B[-k_1, k_2](q)$ set is a wide open question in general. In this paper, we obtain new necessary and…
We prove that every sufficiently large odd integer is a sum of two positive squares and a prime. Let R(n) be the number of representations n = x^2 + y^2 + p with x, y >= 1 and p prime. We show that R(n) > 0 for all odd n >= n0 and obtain…
We prove a conjecture that classifies exceptional numbers. This conjecture arises in two different ways, from cryptography and from coding theory. An odd integer $t\geq 3$ is said to be exceptional if $f(x)=x^t$ is APN (Almost Perfect…
A perfect number is a positive integer n such that n equals the sum of all positive integer divisors of n that are less than n. That is, although n is a divisor of n, n is excluded from this sum. Thus 6 = 1 + 2 + 3 is perfect, but 12 < 1 +…
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…
It is sufficient to prove that there is an excess of prime factors in the product of repunits with odd prime bases defined by the sum of divisors of the integer $N=(4k+1)^{4m+1}\prod_{i=1}^\ell ~ q_i^{2\alpha_i}$ to establish that there do…
For every prime $p$, we construct an infinite countable group that contains precisely $p-1$ elements which are not $p$th powers.
We investigate the integer solutions of Diophantine equations related to perfect numbers. These solutions generalize the example, found by Descartes in 1638, of an odd, ``spoof'' perfect factorization $3^2\cdot 7^2\cdot 11^2\cdot 13^2\cdot…
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…
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…
We proved that there are infinitely many pairs of twin prime.
We classify all conformal irreducible modules of finite type over the Cheng Kac superalgebra CK(6).