Hostname: page-component-cd9895bd7-gbm5v Total loading time: 0 Render date: 2024-12-26T00:39:45.177Z Has data issue: false hasContentIssue false

On the solution of the equation xp–1=0 (p being a prime number)

Published online by Cambridge University Press:  20 January 2009

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.

[At the first meeting of this Session a paper was read on the value of cos 2π/17, which evidently may be made to depend on the solution of x17 – 1 = 0.* The present paper is the outcome of a suggestion then made, that a sketch of Gauss's treatment of the general equation might prove interesting. To give completeness to the subject the necessary theorems on congruences have been prefixed. The convenient notation introduced by Gauss is here adopted; thus, when the difference between a and b is divisible by p, instead of writing a = Mp + b, we may write ab (mod p), the value of M seldom being of importance. It is evident that if ab, then nanb, and anbn, n being any positive integer, and the same modulus p being understood throughout. Also a/nb/n provided n be prime to p. Other properties (similar to those of equations) are easily seen, but only the above are needed here.

Type
Research Article
Copyright
Copyright © Edinburgh Mathematical Society 1888

References

* An elementary algebraic solution of this equation is given in Knowledge, vol. iii., p. 316 (1888).Google Scholar

* Unity is considered as being prime to every number, itself inclnded.