gcd-Pairs in ℤ_n and their graph representations

06/03/2022

∙

by   Wanchai Tapanyo, et al.

∙

0

∙

share

This research introduces a gcd-pair in ℤ_n which is an unordered pair {[a]_n, [b]_n} of elements in ℤ_n such that 0≤ a,b < n and the greatest common divisor (a,b) divides n. The properties of gcd-pairs in ℤ_n and their graph representations are investigated. We also provide the counting formula of gcd-pairs in ℤ_n and its subsets. The algorithms to find, count and check gcd-pairs in ℤ_n are included.