On the solutions of the congruence n2 1 (mod φ2(n))

被引：3

|

作者：

Luca, F ^{[1
]}

Krizek, M ^{[1
]}

机构：

[1] Acad Sci Czech Republic, Inst Math, CR-11567 Prague 1, Czech Republic

来源：

PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY | 2001年 / 129卷 / 08期

关键词：

D O I：

10.1090/S0002-9939-01-05929-9

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

In this note, we show that if n is a positive integer satisfying the congruence n(2) = 1 (mod phi (2) (n)), then n less than or equal to 3.

引用

收藏

页码：2191 / 2196

页数：6

相关论文

共 50 条

[1] Computing solutions to the congruence 1n+2n + ... + nn p (mod n)
Alekseyev, Max A.
Maria Grau, Jose
Oller-Marcen, Antonio M.
DISCRETE APPLIED MATHEMATICS, 2020, 286 (286) : 3 - 9
[2] Solutions of the congruence 1+2f (n) + . . . + nf (n) ≡ 0 (mod n)
Maria Grau, Jose
Moree, Pieter
Oller-Marcen, Antonio M.
MATHEMATISCHE NACHRICHTEN, 2016, 289 (07) : 820 - 830
[3] ON THE CONGRUENCE 2N-2=1 (MOD-N)
ROTKIEWICZ, A
MATHEMATICS OF COMPUTATION, 1984, 43 (167) : 271 - 272
[4] ON THE CONGRUENCE 2n-k≡1(mod n)
袁平之
Science Bulletin, 1988, (13) : 1139 - 1139
[5] ON THE CONGRUENCE 2N-K=1 (MOD N)
SHEN, MK
MATHEMATICS OF COMPUTATION, 1986, 46 (174) : 715 - 716
[6] ON THE CONGRUENCE 2N-K=1(MOD N)
YUAN, PZ
KEXUE TONGBAO, 1988, 33 (13): : 1139 - 1139
[7] On the Congruence σ(n) ≡ 1 (mod n)
Min TANG
Journal of Mathematical Research with Applications, 2012, (06) : 673 - 676
[8] On the Congruence σ(n) ≡ 1 (mod n)
Min TANG Meng LISchool of Mathematics and Computer Science Anhui Normal University Anhui P R China
数学研究及应用, 2012, 32 (06) : 673 - 676
[9] On the Congruence σ(n) ≡ 1(mod n), II
Meng LI
Min TANG
JournalofMathematicalResearchwithApplications, 2014, 34 (02) : 155 - 160
[10] On the congruence 1m+2m + ••• mm ≡ n (mod m) with n | m
Grau, Jose Maria
Oller-Marcen, Antonio M.
Sondow, Jonathan
MONATSHEFTE FUR MATHEMATIK, 2015, 177 (03): : 421 - 436

← 1 2 3 4 5 →