Three-factor decompositions of $\mathbb{U}_n$ with the three generators in arithmetic progression

Mathematics – Number Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

26 pages; tables; submitted to Integers

Scientific paper

Irrespective of whether n is prime, prime power with exponent >1, or composite, the group U_n of units of Z_n can sometimes be obtained as the direct product of cyclic groups generated by x, x+k and x+2k, for x, k in Z_n. Indeed, for many values of n, many distinct 3-factor decompositions of this type exist. The circumstances in which such decompositions exist are examined. Many decompositions have additional interesting properties. We also look briefly at decompositions of the multiplicative groups of finite fields.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Three-factor decompositions of $\mathbb{U}_n$ with the three generators in arithmetic progression does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Three-factor decompositions of $\mathbb{U}_n$ with the three generators in arithmetic progression, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Three-factor decompositions of $\mathbb{U}_n$ with the three generators in arithmetic progression will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-709225

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.