On the characterization of _(n)-atoms

Abstract: In 2011, Anderson and Frazier define the concept of

a u_{(n)}

-factorization, where

a u_{(n)}

is a restriction of the modulo

n

equivalence relation. These relations have been worked mostly for small values of

n

. However, it is sometimes difficult to extend findings to larger values of

n

. One of these problems is finding

a u_{(n)}

-irreducible elements or

a u_{(n)}

-atoms in order to characterize elements that have a

a u_{(n)}

-factorization in

a u_{(n)}

-atoms. The

a u_{(n)}

-irreducible elements are well known for

n = 0, 1, 2, 3, 4, 5, 6, 8, 10, 12

. However, the problem of determining the

a u_{(n)}

-atoms becomes much more difficult the larger

n

is. In this work, we present an algorithm to construct families of

a u_{(n)}

-atoms. It is shown that the algorithm terminates in finitely many steps when

n

is the safe prime associated to a Sophie Germain prime.

Recommendations

Cites work

Cited in

(3)

This page was built for publication: On the characterization of \(\tau_{(n)}\)-atoms