2001β€’Proceedings of the American Mathematical SocietyOpen access

On the solutions of the congruence 𝑛²≑1(π‘šπ‘œπ‘‘πœ™Β²(𝑛))

Florian Luca, Michal Křı́žek

Open full text 4 citations

Abstract

In this note, we show that if n n is a positive integer satisfying the congruence n 2 ≑ 1 ( m o d Ο• 2 ( n ) ) n^{2}\equiv 1~ (mod~\phi ^{2}(n)) , then n ≀ 3 n\le 3 .

Open-access reader

About this research paper

What this paper is about

In this note, we show that if n n is a positive integer satisfying the congruence n 2 ≑ 1 ( m o d Ο• 2 ( n ) ) n^{2}\equiv 1~ (mod~\phi ^{2}(n)) , then n ≀ 3 n\le 3 .

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this note, we show that if n n is a positive integer satisfying the congruence n 2 ≑ 1 ( m o d Ο• 2 ( n ) ) n^{2}\equiv 1~ (mod~\phi ^{2}(n)) , then n ≀ 3 n\le 3 .

Key concepts: Congruence (geometry), Mathematics, Geometry

Related papers

Back to paper searchBrowse research topicsOriginal source
On the solutions of the congruence 𝑛²≑1(π‘šπ‘œπ‘‘πœ™Β²(𝑛)) β€” Research Paper | ScholarLens