Hostname: page-component-76fb5796d-vfjqv Total loading time: 0 Render date: 2024-04-29T19:36:23.288Z Has data issue: false hasContentIssue false
  • English
  • Français

The number of Cayley integers of given norm

Published online by Cambridge University Press:  20 January 2009

P. J. C. Lamont
P. J. C. Lamont
Affiliation:
Department of Quantitative and Information ScienceCollege of BusinessWestern Illinois UniversityMacombIllinois 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.

Using results obtained by J. W. L. Glaisher [1, 2] for the number of representations Rr,s(n) of n as a sum of r odd and s even squares, formulae are derived for the number of Cayley integers of given norm n in certain orders ℴ. When computer generating order elements of given norm, the formulae can be used to verify that all the required elements have been obtained.

Type
Research Article
Information
Proceedings of the Edinburgh Mathematical Society , Volume 25 , Issue 1 , February 1982 , pp. 101 - 103
Copyright
Copyright © Edinburgh Mathematical Society 1982

References

REFERENCES

1.Glaisher, J. W. L., On the numbers of representations of a number as a sum of 2r squares, where 2r does not exceed eighteen, Proc. London Math. Soc. (2) 5 (1907), 479–490.CrossRefGoogle Scholar
2.Glaisher, J. W. L., On the representations of a number as the sum of two, four, six, eight, ten, and twelve squares, Quarterly J. 38 (1907), 1–62.Google Scholar
3.Hardy, G. H. and Wright, E. M., An Introduction to the Theory of Numbers (Fourth Edition, Oxford, 1960).Google Scholar
4.Lamont, P. J. C., Arithmetics in Cayley's Algebra, Proc. Glasgow Math. Assoc. 6 (1963), 99–106.CrossRefGoogle Scholar
5.Rankin, R. A., A certain class of multiplicative functions, Duke Math. J. 13 (1946), 281–306.CrossRefGoogle Scholar
6.Serre, J. P., Cours d'Arithmétique (Paris, 1970).Google Scholar