Kevin G. Hare

most citedNew techniques for bounds on the total number of Prime Factors of an Odd Perfect Number

1 citations · 1 across the 2 of their papers we have counts for

collaborators

Showing math.NTShow all

2 papers · 1 filter

math.NT2005★ 1 cited

New techniques for bounds on the total number of Prime Factors of an Odd Perfect Number

Kevin G. Hare

Let $σ (n)$ denote the sum of the positive divisors of $n$ . We say that $n$ is perfect if $σ (n) = 2 n$ . Currently there are no known odd perfect numbers. It is known that if an odd…

math.NT2003

On the height of the Sylvester Resultant

Carlos D'Andrea, Kevin G. Hare

Let n be a positive integer. We consider the Sylvester Resultant of f and g, where f is a generic polynomial of degree 2 or 3 and g is a generic polynomial of degree n. If f is a q…