Number of the records: 1  

On the Solutions of the Congruence n2=1 ( mod fi2(n) )

  1. 1.
    0175135 - MU-W 20020014 RIV US eng J - Journal Article
    Luca, F. - Křížek, Michal
    On the Solutions of the Congruence n2=1 ( mod fi2(n) ).
    Proceedings of the American Mathematical Society. Roč. 129, č. 8 (2001), s. 2191-2196. ISSN 0002-9939. E-ISSN 1088-6826
    R&D Projects: GA ČR GA201/98/1452
    Keywords : Euler totient function * congruence
    Subject RIV: BA - General Mathematics
    Impact factor: 0.369, year: 2001

    We show that if n is a positive integer satisfying the congruence n2..1 ( mod fi2(n) ), then n<3.
    Permanent Link: http://hdl.handle.net/11104/0072122

     
    FileDownloadSizeCommentaryVersionAccess
    Krizek6.pdf1128.2 KBPublisher’s postprintopen-access
     

Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.