Hostname: page-component-7b7567c8c-lpg2g Total loading time: 0 Render date: 2026-11-15T20:07:09.379Z Has data issue: false hasContentIssue false

Factorization and congruence in the arithmetics of Cayley's algebra

Published online by Cambridge University Press:  18 May 2009

P. J. C. Lamont
Affiliation:
Department of Computer Science, College of Applied Sciences, Western Illinois University, Macomb, Illinois 61455
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

This paper treats factorization and congruence in the arithmetics of Cayley's algebra C. Results, proved by Rankin [10], on the number of factorizations of a given element in the nonmaximal arithmetics Ho and Jo are reviewed. Further, new results on congruence are established and are used to find the number of factorizations of a prescribed element in the remaining arithmetics, including the maximal arithmetics Jw When computer factorizing a given element, the congruence results can be used as a heuristic device to prune the search tree.

Information

Type
Research Article
Copyright
Copyright © Glasgow Mathematical Journal Trust 1991