2005
DOI: 10.4064/cm103-2-13
|View full text |Cite
|
Sign up to set email alerts
|

Odd perfect numbers of a special form

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

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

1
12
0

Year Published

2010
2010
2024
2024

Publication Types

Select...
5
2

Relationship

5
2

Authors

Journals

citations
Cited by 9 publications
(13 citation statements)
references
References 7 publications
1
12
0
Order By: Relevance
“…Hence N < ( i p i ) (p k −1)/2 (for other finiteness results, see, for example, [6,7,11]). We can improve this upper bound using Theorem 4.…”
Section: Theorem 4 If Q Is An Odd Prime Then We Havementioning
confidence: 97%
“…Hence N < ( i p i ) (p k −1)/2 (for other finiteness results, see, for example, [6,7,11]). We can improve this upper bound using Theorem 4.…”
Section: Theorem 4 If Q Is An Odd Prime Then We Havementioning
confidence: 97%
“…We have shown that, if N = p α (q 1 q 2 • • • q k ) 2β is an odd perfect number, then k ≤ 4β 2 + 2β + 2 in [19]. Recently, we have improved this upper bound by 2β 2 + 8β + 3 in [21], where the coefficient 8 of β can be replaced by 7 if 2β + 1 is not a prime or β ≥ 29.…”
Section: Introductionmentioning
confidence: 99%
“…In their paper [22], Hagis and McDaniel conjecture that β 1 = • • • = β t = β does not occur. The author [26] proved that there are only finitely many odd perfect numbers for any given β. McDaniel [20] proved that we cannot have β 1 ≡ • • • ≡ β t ≡ 2 (mod 6), i.e., 3 cannot divide all of β 1 + 1, β 2 + 1, . .…”
Section: Introductionmentioning
confidence: 99%
“…Using the author's method, but with the aid of the large sieve instead of Selberg's sieve used by the author [26], Fletcher, Nielsen and Ochem [7] proved that if N = p α1 1 • • • p αs s q β1 1 • • • q βt t satisfies h(N ) = n/d and for each i, β i + 1 has a prime factor belonging to a finite set P of primes, then N has a prime divisor small than a effective constant C, depending only on n, s and P. Moreover, they proved that the smallest prime factor of an odd perfect number N satisfying the above condition with P = {3, 5} lies between 10 8 and 10 1000 , improving results in [3] and [27].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation