Proofs, generalizations and analogs of Menon’s identity: a survey

Menon’s identity states that for every positive integer n one has ∑ (a − 1, n) = φ (n)τ(n), where a runs through a reduced residue system (mod n), (a − 1, n) stands for the greatest common divisor of a − 1 and n, φ(n) is Euler’s totient function, and τ(n) is the number of divisors of n. Menon’s iden...

Full description

Bibliographic Details
Main Author: Tóth László
Format: Article
Language:English
Published: Sciendo 2023-11-01
Series:Acta Universitatis Sapientiae: Mathematica
Subjects:
Online Access:https://doi.org/10.2478/ausm-2023-0009