Related papers: About Very Perfect Numbers

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.

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 show that if {1, b, c, d} is a D(-1) diophantine quadruple with b<c<d and c=1+s^2, then the cases s=p^k, s=2p^k, c=p and c=2p^k do not occur, where p is an odd prime and k is a positive integer. For the integer d=1+x^2, we show that it…

We explore some of the properties of consecutive, equally-summed arithmetic progressions of odd numbers, particularly their offsets and sums, before using them to prove that no $3\times3$ magic squares of distinct square integers exist.

It is shown that there exist infinitely many triangular numbers (congruent to 3 mod 12) which cannot be the distance between two perfect numbers.

We show that every sufficiently large integer is a sum of a prime and two almost prime squares, and also a sum of a smooth number and two almost prime squares. The number of such representations is of the expected order of magnitude. We…

Let n be a positive odd integer and let p>n+1 be a prime. We mainly derive the following congruence: $$\sum_{0<i_1<...<i_n<p}(i_1/3)(-1)^{i_1}/(i_1...i_n)=0 (mod p).$$

The aim of this note is to show that any even perfect number, other than $6$, can be written as the sum of 5 cubes of natural numbers. We also conjecture that any even perfect number, other than $6$, can be written as the sum of only 3…

We shall show that 9, 165 are all of the odd unitary super perfect numbers.

A perfect number is a positive integer $N$ such that the sum of all the positive divisors of $N$ equals $2N$, denoted by $\sigma(N) = 2N$. The question of the existence of odd perfect numbers (OPNs) is one of the longest unsolved problems…

Let $\F$ be the finite field of odd prime power order $q$, We find explicit expressions for the number of triples $\{\al-1,\al,\al+1 \}$ of consecutive non-zero squares in $\F$ and similarly for the number of triples of consecutive…

In this paper, we consider the simultaneous representation of pairs of sufficiently large integers. We prove that every pair of large positive odd integers can be represented in the form of a pair of one prime, four cubes of primes and 231…

We prove a modification as well as an improvement of a result of K. Ford, D. R. Heath-Brown and S. Konyagin concerning prime avoidance of square-free numbers and perfect powers of prime numbers.

Let $q$ be an odd prime power and write \[ \theta_q := \frac{\phi(q-1)}{q-1}. \] If $\theta_q < \tfrac{1}{3}$, or if $\theta_q = \tfrac{1}{3}$ and $q \notin \{7,13,19,25,37\}$, then the finite field $\F$ contains a pair of consecutive…

We shall give an explicit upper bound for the smallest prime factor of multiperfect numbers of the form $N=p_1^{\alpha_1}\cdots p_s^{\alpha_s} q_1^{\beta_1}\cdots q_t^{\beta_t}$ with $\beta_1, \ldots, \beta_t$ bounded by a given constant.…

In this paper, we proved a theorem that every large enough odd number can be represented as the sum of three almost equal Piatetski-Shapiro primes.

This paper proposes an elementary solution to a special case of finding all perfect squares that can be written as sum of consecutive integer cubes. It is shown that there are no non-trivial solutions if the perfect square is a prime power,…

Using an extension of the abundancy index to imaginary quadratic rings with unique factorization, we define what we call $n$-powerfully perfect numbers in these rings. This definition serves to extend the concept of perfect numbers that…

We demonstrate that there are infinitely many integers that cannot be expressed as the sum of two squares of integers and up to two non-negative integer powers of 2.

An odd perfect number $N$ is said to be given in Eulerian form if $N = {q^k}{n^2}$ where $q$ is prime with $q \equiv k \equiv 1 \pmod 4$ and $\gcd(q,n) = 1$. Similarly, an even perfect number $M$ is said to be given in Euclidean form if $M…