International Journal of Innovative Research in Computer Science and Technology
Year: 2022, Volume: 10, Issue: 2
First page : ( 7) Last page : ( 9)
Online ISSN : 2350-0557.
DOI: 10.55524/ijircst.2022.10.2.2 | DOI URL: https://doi.org/10.55524/ijircst.2022.10.2.2
Crossref
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (CC BY 4.0) (http://creativecommons.org/licenses/by/4.0)
Article Tools: Print the Abstract | Indexing metadata | How to cite item | Email this article | Post a Comment
According to Fermat's little theorem, for any p is a prime integer and gcdx,p=1
, then the congruence xp-1≡1mod n 
is true, if we remove the restriction that gcdx,p=1, we may declarexp-1≡xmod p
. For every integer x. Euler extended Fermat's Theorem as follows: if gcdx,p=1,then,where xÏ•n≡1mod n
.Ï• 
is Euler's phi-function.
Euler's theorem cannot be implemented for any every integers x in the same manners as Fermat’s theorem works; that is, the congruence xÏ•n+1≡xmod n 
is not always true. In this paper, we discussed the validation of congruence xÏ•n+1≡xmod n
.
No. of Downloads: 1302 | No. of Views: 3576
