On the number of distinct prime factors of an odd perfect number

Cohen, GL; Sorli, RM

On the number of distinct prime factors of an odd perfect number

Cohen, GL Sorli, RM

Permalink

Publication Type:: Journal Article
Citation:: Journal of Discrete Algorithms, 2003, 1 (1), pp. 21 - 35
Issue Date:: 2003-01-01

Closed Access

	Filename	Description	Size
	2003001145.pdf		959.02 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Cohen, GL	en_US
dc.contributor.author	Sorli, RM	en_US
dc.date.issued	2003-01-01	en_US
dc.identifier.citation	Journal of Discrete Algorithms, 2003, 1 (1), pp. 21 - 35	en_US
dc.identifier.issn	1570-8667	en_US
dc.identifier.uri	http://hdl.handle.net/10453/3443
dc.description.abstract	It is not known whether or not there exists an odd perfect number. We describe an algorithmic approach for showing that if there is an odd perfect number then it has t distinct prime factors, and we discuss its application towards showing that t ≥ 9. © 2003 Elsevier B.V. All rights reserved.	en_US
dc.relation.ispartof	Journal of Discrete Algorithms	en_US
dc.relation.isbasedon	10.1016/S1570-8667(03)00004-2	en_US
dc.subject.classification	Computation Theory & Mathematics	en_US
dc.title	On the number of distinct prime factors of an odd perfect number	en_US
dc.type	Journal Article
utslib.citation.volume	1	en_US
utslib.for	010303 Optimisation	en_US
utslib.for	0102 Applied Mathematics	en_US
utslib.for	0802 Computation Theory and Mathematics	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Science
pubs.organisational-group	/University of Technology Sydney/Faculty of Science/School of Mathematical Sciences
utslib.copyright.status	closed_access
pubs.issue	1	en_US
pubs.publication-status	Published	en_US
pubs.volume	1	en_US

Abstract:

It is not known whether or not there exists an odd perfect number. We describe an algorithmic approach for showing that if there is an odd perfect number then it has t distinct prime factors, and we discuss its application towards showing that t ≥ 9. © 2003 Elsevier B.V. All rights reserved.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/3443