ON PRIME-PERFECT NUMBERS
2011 ◽
Vol 07
(07)
◽
pp. 1705-1716
Keyword(s):
We prove that the Diophantine equation [Formula: see text] has only finitely many positive integer solutions k, p1, …, pk, r1, …, rk, where p1, …, pk are distinct primes. If a positive integer n has prime factorization [Formula: see text], then [Formula: see text] represents the number of ordered factorizations of n into prime parts. Hence, solutions to the above Diophantine equation are designated as prime-perfect numbers.
2015 ◽
Vol 713-715
◽
pp. 1483-1486
Keyword(s):
2010 ◽
Vol 81
(2)
◽
pp. 177-185
◽
Keyword(s):
2018 ◽
2012 ◽
Vol 08
(03)
◽
pp. 813-821
◽
2009 ◽
Vol 51
(3)
◽
pp. 659-667
◽
Keyword(s):
2018 ◽
Keyword(s):
2021 ◽
Vol 27
(3)
◽
pp. 113-118
2006 ◽
Vol 02
(02)
◽
pp. 195-206
◽
Keyword(s):