skip to content
Improved techniques for lower bounds for odd perfect numbers Preview this item
ClosePreview this item
Checking...

Improved techniques for lower bounds for odd perfect numbers

Author: R P Brent; Graeme Laurence Cohen; H J J Te Riele
Publisher: Amsterdam, the Netherlands : Stichting Mathematisch Centrum, 1989.
Series: Centrum voor Wiskunde en Informatica (Amsterdam, Netherlands).; Report
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Summary:
Abstract: "If N is an odd perfect number, and q[superscript k] [symbol] N, q prime, k even, then it is almost immediate that N> q[superscript 2k]. We prove here that, subject to certain conditions verifiable in polynomial time, in fact N> q[superscript 5k/2]. Using this and related results, we are able to extend the computations in an earlier paper to show that N> 10[superscript 300]."
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: R P Brent; Graeme Laurence Cohen; H J J Te Riele
OCLC Number: 22291138
Description: 13 pages ; 29 cm.
Series Title: Centrum voor Wiskunde en Informatica (Amsterdam, Netherlands).; Report
Responsibility: R.P. Brent, G.L. Cohen, H.J.J. te Riele.

Abstract:

Abstract: "If N is an odd perfect number, and q[superscript k] [symbol] N, q prime, k even, then it is almost immediate that N> q[superscript 2k]. We prove here that, subject to certain conditions verifiable in polynomial time, in fact N> q[superscript 5k/2]. Using this and related results, we are able to extend the computations in an earlier paper to show that N> 10[superscript 300]."

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.

Similar Items

Related Subjects:(1)

Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/22291138>
library:oclcnum"22291138"
library:placeOfPublication
library:placeOfPublication
owl:sameAs<info:oclcnum/22291138>
rdf:typeschema:Book
schema:about
schema:about
schema:contributor
schema:contributor
schema:creator
schema:datePublished"1989"
schema:description"Abstract: "If N is an odd perfect number, and q[superscript k] [symbol] N, q prime, k even, then it is almost immediate that N> q[superscript 2k]. We prove here that, subject to certain conditions verifiable in polynomial time, in fact N> q[superscript 5k/2]. Using this and related results, we are able to extend the computations in an earlier paper to show that N> 10[superscript 300].""@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/24544983>
schema:inLanguage"en"
schema:name"Improved techniques for lower bounds for odd perfect numbers"@en
schema:publisher
schema:url

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.