Vol. 64, No. 1, 1976

Download this article
Download this article. For screen
For printing
Recent Issues
Vol. 323: 1  2
Vol. 322: 1  2
Vol. 321: 1  2
Vol. 320: 1  2
Vol. 319: 1  2
Vol. 318: 1  2
Vol. 317: 1  2
Vol. 316: 1  2
Online Archive
Volume:
Issue:
     
The Journal
Subscriptions
Editorial Board
Officers
Contacts
 
Submission Guidelines
Submission Form
Policies for Authors
 
ISSN: 1945-5844 (e-only)
ISSN: 0030-8730 (print)
Special Issues
Author Index
To Appear
 
Other MSP Journals
Periodic Jacobi-Perron algorithms and fundamental units

Nambury Sitarama Raju

Vol. 64 (1976), No. 1, 241–251
Abstract

In this paper the author states a class of infinitely many real cubic fields for which the Jacobi-Perron algorithm of a properly chosen vector becomes periodic and calculates explicitly a fundamental unit for each field. The main results of this paper are: Let m = a6 + 3a3 + 3, ω = √3m--, m cube free a N; then the Jacobi-Perron algorithm of a(0) = (ω,ω2) is periodic. The length of the primitive preperiod is four and the length of the primitive period is three. A fundamental unit in Q(ω) is given by e = a3 + 1 .

Mathematical Subject Classification
Primary: 12A30, 12A30
Secondary: 12A45
Milestones
Received: 20 November 1975
Revised: 25 March 1976
Published: 1 May 1976
Authors
Nambury Sitarama Raju