Displaying similar documents to “Prime numbers such that the sums of the divisors of their powers are perfect squares”

On near-perfect numbers

Min Tang, Xiaoyan Ma, Min Feng (2016)

Colloquium Mathematicae

Similarity:

For a positive integer n, let σ(n) denote the sum of the positive divisors of n. We call n a near-perfect number if σ(n) = 2n + d where d is a proper divisor of n. We show that the only odd near-perfect number with four distinct prime divisors is 3⁴·7²·11²·19².

On near-perfect and deficient-perfect numbers

Min Tang, Xiao-Zhi Ren, Meng Li (2013)

Colloquium Mathematicae

Similarity:

For a positive integer n, let σ(n) denote the sum of the positive divisors of n. Let d be a proper divisor of n. We call n a near-perfect number if σ(n) = 2n + d, and a deficient-perfect number if σ(n) = 2n - d. We show that there is no odd near-perfect number with three distinct prime divisors and determine all deficient-perfect numbers with at most two distinct prime factors.

On the sum of two squares and two powers of k

Roger Clement Crocker (2008)

Colloquium Mathematicae

Similarity:

It can be shown that the positive integers representable as the sum of two squares and one power of k (k any fixed integer ≥ 2) have positive density, from which it follows that those integers representable as the sum of two squares and (at most) two powers of k also have positive density. The purpose of this paper is to show that there is an infinity of positive integers not representable as the sum of two squares and two (or fewer) powers of k, k again any fixed integer ≥ 2. ...

A Maximum Resonant Set of Polyomino Graphs

Heping Zhang, Xiangqian Zhou (2016)

Discussiones Mathematicae Graph Theory

Similarity:

A polyomino graph P is a connected finite subgraph of the infinite plane grid such that each finite face is surrounded by a regular square of side length one and each edge belongs to at least one square. A dimer covering of P corresponds to a perfect matching. Different dimer coverings can interact via an alternating cycle (or square) with respect to them. A set of disjoint squares of P is a resonant set if P has a perfect matching M so that each one of those squares is M-alternating....

Odd perfect numbers of a special form

Tomohiro Yamada (2005)

Colloquium Mathematicae

Similarity:

We show that there is an effectively computable upper bound of odd perfect numbers whose Euler factors are powers of fixed exponent.

On a sum of divisors problem.

De Koninck, Jean-Marie, Ivić, Aleksandar (1998)

Publications de l'Institut Mathématique. Nouvelle Série

Similarity: