Counting perfect matchings in polyominoes with an application to the dimer problem
P. John, H. Sachs, H. Zernitz (1987)
Applicationes Mathematicae
Similarity:
P. John, H. Sachs, H. Zernitz (1987)
Applicationes Mathematicae
Similarity:
Tošić, Ratko, Vojvodić, Dušan (2000)
Novi Sad Journal of Mathematics
Similarity:
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.
G. L. Garg, B. Kumar (1989)
Matematički Vesnik
Similarity:
M. N. Mukherjee, S. Raychaudhuri (1993)
Matematički Vesnik
Similarity:
Ivan Gutman (1991)
Publications de l'Institut Mathématique
Similarity:
De Koninck, Jean-Marie, Ivić, Aleksandar (1998)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Asadulla, Syed (1986)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Gimbel, Steven, Jaroma, John H. (2003)
Integers
Similarity:
Jan Slowak (1999)
Mathematica Slovaca
Similarity:
McDaniel, Wayne L. (1990)
International Journal of Mathematics and Mathematical Sciences
Similarity:
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².