On the Solutions of the Congruence n2 1 ( mod fi2(n) ).
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F01%3A05020014" target="_blank" >RIV/67985840:_____/01:05020014 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
On the Solutions of the Congruence n2 1 ( mod fi2(n) ).
Original language description
We show that if n is a positive integer satisfying the congruence n2..1 ( mod fi2(n) ), then n<3.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F98%2F1452" target="_blank" >GA201/98/1452: Computational aspects of the finite element method</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2001
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Proceedings of the American Mathematical Society
ISSN
0002-9939
e-ISSN
—
Volume of the periodical
129
Issue of the periodical within the volume
8
Country of publishing house
US - UNITED STATES
Number of pages
6
Pages from-to
2191-2196
UT code for WoS article
—
EID of the result in the Scopus database
—