相关论文: Note on the Theory of Perfect Numbers

We prove there exist infinitely many odd integers $n$ for which there exists a pair of positive divisors $d_1, d_2>1$ of $(n^2+1)/2$ such that $$d_1+d_2=\delta n+(\delta+2).$$ We prove the similar result for $\varepsilon=\delta-2$ and…

The perfect cuboid problem is an old famous unsolved problem in mathematics concerning the existence or non-existence of a rectangular parallelepiped whose edges, face diagonals, and space diagonal are of integer lengths. Recently Walter…

A perfect Euler cuboid is a rectangular parallelepiped with integer edges and integer face diagonals whose space diagonal is also integer. The problem of finding such parallelepipeds or proving their non-existence is an old unsolved…

In this short paper we prove that the square of an odd prime number cannot be a very perfect number.

We study odd numbers through a straightforward indexing. We focus in particular on odd prime and composite numbers and their distribution. With a counting argument, we calculate the limit of two sums and compare their convergence rate.

A set A of positive integers is called a perfect difference set if every nonzero integer has an unique representation as the difference of two elements of A. We construct dense perfect difference sets from dense Sidon sets. As a consequence…

We give an elementary proof of a result which is not as well known as it should be: a ring with a specified finite number of zero divisors is finite, with a precise bound on its order.

This short note provides a sharper upper bound of a well known inequality for the sum of divisors function. This is a problem in pure mathematics related to the distribution of prime numbers. Furthermore, the technique is completely…

In his classic text, \emph{Combinatory Analysis}, MacMahon defined a perfect partition of a positive integer $n$ as a partition whose parts contain exactly one partition of every positive integer not exceeding $n$. In this paper we apply…

This document seeks to prove there are infinitely many primes whose difference is 2, referred to as twin prime pairs. This proof's methodology involves constructing a function that approximates the number of positive integers, less than a…

In a paper published by this author in www.academia.edu(see reference[3]), it was established that there exist no three positive integers which are consecutive terms of an arithmetic progression; and whose sum of squares is a perfect or…

We present a new topological proof of the infinitude of prime numbers with a new topology. Furthermore, in this topology, we characterize the infinitude of any non-empty subset of prime numbers.

Natural numbers satisfying an unusual property are mentioned by the author in [5], in which their infinitude is also proved. In this paper, we start with an arbitrary natural number which is not a multiple of 10 and non-palindromic, form…

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…

The Euler's form of odd perfect numbers, if any, is $n=\pi^{\alpha}N^2$, where $\pi$ is prime, $(\pi,N)=1$ and $\pi\equiv \alpha \equiv 1 \pmod{4}$. Dris conjecture states that $N>\pi^{\alpha}$. We find that $N^2>\frac{1}{2}\pi^{\gamma}$,…

A palintiple is a natural number which is an integer multiple of its digit reversal. A previous paper partitions all palintiples into three distinct classes according to patterns in the carries and then determines all palintiples belonging…

We give necessary conditions satisfied by the set of odd prime divisors of binary perfect polynomials. This allows us to get a new characterization of all the known perfect binary polynomials.

A classical theorem of Kempner states that the sum of the reciprocals of positive integers with missing decimal digits converges. This result is extended to much larger families of "missing digits" sets of positive integers with both…

We say that $d$ is an exponential unitary divisor of $n=p_1^{a_1}... p_r^{a_r}>1$ if $d=p_1^{b_1}... p_r^{b_r}$, where $b_i$ is a unitary divisor of $a_i$, i.e., $b_i\mid a_i$ and $(b_i,a_i/b_i)=1$ for every $i\in \{1,2,...,r\}$. We survey…

Generalizing the concept of a perfect number, Sloane's sequences of integers A083207 lists the sequence of integers $n$ with the property: the positive factors of $n$ can be partitioned into two disjoint parts so that the sums of the two…