On a compositeness test for (2<sup>p</sup>+ 1)/3

Berrizbeitia, P Luca, F Melham, R

Permalink

Open Access

Copyright Clearance Process

This item is open access.

View statistics

Full metadata record

Field	Value	Language
dc.contributor.author	Berrizbeitia, P	en_US
dc.contributor.author	Luca, F	en_US
dc.contributor.author	Melham, R	en_US
dc.date.issued	2010-06-08	en_US
dc.identifier.citation	Journal of Integer Sequences, 2010, 13 (1), pp. 1 - 6	en_US
dc.identifier.uri	http://hdl.handle.net/10453/14529
dc.description.abstract	In this note, we give a necessary condition for the primality of (2p + 1)/3.	en_US
dc.relation.ispartof	Journal of Integer Sequences	en_US
dc.subject.classification	Computation Theory & Mathematics	en_US
dc.title	On a compositeness test for (2<sup>p</sup>+ 1)/3	en_US
dc.type	Journal Article
utslib.citation.volume	1	en_US
utslib.citation.volume	13	en_US
utslib.for	0101 Pure Mathematics	en_US
utslib.for	0102 Applied Mathematics	en_US
utslib.for	0103 Numerical and Computational Mathematics	en_US
dc.location.activity	ISI:000207073100008
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Science
utslib.copyright.status	open_access
pubs.issue	1	en_US
pubs.publication-status	Published	en_US
pubs.volume	13	en_US

Abstract:

In this note, we give a necessary condition for the primality of (2p + 1)/3.

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