$gcd cdot lcm$ for cyclic ringsProve that $gcd(M, N)times mbox{lcm}(M, N) = M times N$.Transfer Between LCM,...

What is Tony Stark injecting into himself in Iron Man 3?

Can a Mexican citizen living in US under DACA drive to Canada?

Affine transformation of circular arc in 3D

Why can't we use freedom of speech and expression to incite people to rebel against government in India?

Is there a way to find out the age of climbing ropes?

PTiJ: How should animals pray?

Does the US political system, in principle, allow for a no-party system?

Is divide-by-zero a security vulnerability?

Is it a Cyclops number? "Nobody" knows!

Can a Mimic (container form) actually hold loot?

Was it really inappropriate to write a pull request for the company I interviewed with?

ESPP--any reason not to go all in?

PTIJ: Aliyot for the deceased

The need of reserving one's ability in job interviews

Is every open circuit a capacitor?

Named nets not connected in Eagle board design

Linear Combination of Atomic Orbitals

Dukha vs legitimate need

Where is the fallacy here?

Replacing tantalum capacitor with ceramic capacitor for Op Amps

Plagiarism of code by other PhD student

When to use the term transposed instead of modulation?

Rationale to prefer local variables over instance variables?

How spaceships determine each other's mass in space?



$gcd cdot lcm$ for cyclic rings


Prove that $gcd(M, N)times mbox{lcm}(M, N) = M times N$.Transfer Between LCM, GCD for Rings?Are these about determinant true for commutative rings?Rings isomorphic to $mathbb{Z}_6timesmathbb{Z}_{10}$Prove if If $m in Z^+$, $a|m$, and $b|m$, then $mbox{lcm}(a,b) leq m$.Prove that $G times H$ is cyclic $iff$ $gcd(m,n) =1$$Goplus H$ is cyclic iff finite groups $G$ and $H$ are cyclic and $gcd(|G|,|H|)=1$$gcd(|H_{1}|,|H_{2}|,cdots,|H_{n}|) > 1$ implies $H_{1} times H_{2} times cdots times H_{n} = G$ not cyclicStrict cyclic orderUniqueness of least common multiple up to associatesRing theory: well-definedness of associates without commutativityConnection between GCD and LCM of two numbers













0












$begingroup$


A cyclic ring is a ring (or rng) which additive group is cyclic.

Two elements of a commutative ring are $associates (sim)$ iff they divide each other.



It looks like the formula $gcd(a,b) cdot lcm(a,b) sim a cdot b$ works for any cyclic ring, even if there is no unity in it, as long as $gcd(a,b)$ exists:



In $2mathbb Z$:



$gcd(4,8) sim 2$
$lcm(4,8) sim 16$
$gcd(4,8) cdot lcm(4,8) sim 4 cdot 8 sim 32$



In $2mathbb Z_{12}$:



$gcd(4,8) sim 4$
$lcm(4,8) sim 4$
$gcd(4,8) cdot lcm(4,8) sim 4 cdot 8 sim 4$



There are proofs of the $gcd(a,b) cdot lcm(a,b)$ formula for an integral domain:
Prove that $gcd(M, N)times mbox{lcm}(M, N) = M times N$.
https://math.stackexchange.com/a/717775/427611



How do we show it for an arbitrary cyclic ring?



For an infinite cyclic ring $kmathbb Z$ the proof looks simple:



if there is a $gcd(a,b)$ in $kmathbb Z$, then



$gcd'(a,b) sim k cdot gcd(a,b)$
$lcm(a,b) sim k cdot lcm'(a,b)$



where $gcd'(a,b)$ and $lcm'(a,b)$ are the corresponding values in $mathbb Z$.



I need help with a finite cyclic ring $kmathbb Z_{kn}$.










share|cite|improve this question









$endgroup$

















    0












    $begingroup$


    A cyclic ring is a ring (or rng) which additive group is cyclic.

    Two elements of a commutative ring are $associates (sim)$ iff they divide each other.



    It looks like the formula $gcd(a,b) cdot lcm(a,b) sim a cdot b$ works for any cyclic ring, even if there is no unity in it, as long as $gcd(a,b)$ exists:



    In $2mathbb Z$:



    $gcd(4,8) sim 2$
    $lcm(4,8) sim 16$
    $gcd(4,8) cdot lcm(4,8) sim 4 cdot 8 sim 32$



    In $2mathbb Z_{12}$:



    $gcd(4,8) sim 4$
    $lcm(4,8) sim 4$
    $gcd(4,8) cdot lcm(4,8) sim 4 cdot 8 sim 4$



    There are proofs of the $gcd(a,b) cdot lcm(a,b)$ formula for an integral domain:
    Prove that $gcd(M, N)times mbox{lcm}(M, N) = M times N$.
    https://math.stackexchange.com/a/717775/427611



    How do we show it for an arbitrary cyclic ring?



    For an infinite cyclic ring $kmathbb Z$ the proof looks simple:



    if there is a $gcd(a,b)$ in $kmathbb Z$, then



    $gcd'(a,b) sim k cdot gcd(a,b)$
    $lcm(a,b) sim k cdot lcm'(a,b)$



    where $gcd'(a,b)$ and $lcm'(a,b)$ are the corresponding values in $mathbb Z$.



    I need help with a finite cyclic ring $kmathbb Z_{kn}$.










    share|cite|improve this question









    $endgroup$















      0












      0








      0





      $begingroup$


      A cyclic ring is a ring (or rng) which additive group is cyclic.

      Two elements of a commutative ring are $associates (sim)$ iff they divide each other.



      It looks like the formula $gcd(a,b) cdot lcm(a,b) sim a cdot b$ works for any cyclic ring, even if there is no unity in it, as long as $gcd(a,b)$ exists:



      In $2mathbb Z$:



      $gcd(4,8) sim 2$
      $lcm(4,8) sim 16$
      $gcd(4,8) cdot lcm(4,8) sim 4 cdot 8 sim 32$



      In $2mathbb Z_{12}$:



      $gcd(4,8) sim 4$
      $lcm(4,8) sim 4$
      $gcd(4,8) cdot lcm(4,8) sim 4 cdot 8 sim 4$



      There are proofs of the $gcd(a,b) cdot lcm(a,b)$ formula for an integral domain:
      Prove that $gcd(M, N)times mbox{lcm}(M, N) = M times N$.
      https://math.stackexchange.com/a/717775/427611



      How do we show it for an arbitrary cyclic ring?



      For an infinite cyclic ring $kmathbb Z$ the proof looks simple:



      if there is a $gcd(a,b)$ in $kmathbb Z$, then



      $gcd'(a,b) sim k cdot gcd(a,b)$
      $lcm(a,b) sim k cdot lcm'(a,b)$



      where $gcd'(a,b)$ and $lcm'(a,b)$ are the corresponding values in $mathbb Z$.



      I need help with a finite cyclic ring $kmathbb Z_{kn}$.










      share|cite|improve this question









      $endgroup$




      A cyclic ring is a ring (or rng) which additive group is cyclic.

      Two elements of a commutative ring are $associates (sim)$ iff they divide each other.



      It looks like the formula $gcd(a,b) cdot lcm(a,b) sim a cdot b$ works for any cyclic ring, even if there is no unity in it, as long as $gcd(a,b)$ exists:



      In $2mathbb Z$:



      $gcd(4,8) sim 2$
      $lcm(4,8) sim 16$
      $gcd(4,8) cdot lcm(4,8) sim 4 cdot 8 sim 32$



      In $2mathbb Z_{12}$:



      $gcd(4,8) sim 4$
      $lcm(4,8) sim 4$
      $gcd(4,8) cdot lcm(4,8) sim 4 cdot 8 sim 4$



      There are proofs of the $gcd(a,b) cdot lcm(a,b)$ formula for an integral domain:
      Prove that $gcd(M, N)times mbox{lcm}(M, N) = M times N$.
      https://math.stackexchange.com/a/717775/427611



      How do we show it for an arbitrary cyclic ring?



      For an infinite cyclic ring $kmathbb Z$ the proof looks simple:



      if there is a $gcd(a,b)$ in $kmathbb Z$, then



      $gcd'(a,b) sim k cdot gcd(a,b)$
      $lcm(a,b) sim k cdot lcm'(a,b)$



      where $gcd'(a,b)$ and $lcm'(a,b)$ are the corresponding values in $mathbb Z$.



      I need help with a finite cyclic ring $kmathbb Z_{kn}$.







      abstract-algebra ring-theory modular-arithmetic greatest-common-divisor least-common-multiple






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked 16 hours ago









      Alex CAlex C

      7518




      7518






















          0






          active

          oldest

          votes











          Your Answer





          StackExchange.ifUsing("editor", function () {
          return StackExchange.using("mathjaxEditing", function () {
          StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
          StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
          });
          });
          }, "mathjax-editing");

          StackExchange.ready(function() {
          var channelOptions = {
          tags: "".split(" "),
          id: "69"
          };
          initTagRenderer("".split(" "), "".split(" "), channelOptions);

          StackExchange.using("externalEditor", function() {
          // Have to fire editor after snippets, if snippets enabled
          if (StackExchange.settings.snippets.snippetsEnabled) {
          StackExchange.using("snippets", function() {
          createEditor();
          });
          }
          else {
          createEditor();
          }
          });

          function createEditor() {
          StackExchange.prepareEditor({
          heartbeatType: 'answer',
          autoActivateHeartbeat: false,
          convertImagesToLinks: true,
          noModals: true,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: 10,
          bindNavPrevention: true,
          postfix: "",
          imageUploader: {
          brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
          contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
          allowUrls: true
          },
          noCode: true, onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          });


          }
          });














          draft saved

          draft discarded


















          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3138823%2fgcd-cdot-lcm-for-cyclic-rings%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown

























          0






          active

          oldest

          votes








          0






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes
















          draft saved

          draft discarded




















































          Thanks for contributing an answer to Mathematics Stack Exchange!


          • Please be sure to answer the question. Provide details and share your research!

          But avoid



          • Asking for help, clarification, or responding to other answers.

          • Making statements based on opinion; back them up with references or personal experience.


          Use MathJax to format equations. MathJax reference.


          To learn more, see our tips on writing great answers.




          draft saved


          draft discarded














          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3138823%2fgcd-cdot-lcm-for-cyclic-rings%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown





















































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown

































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown







          Popular posts from this blog

          Nidaros erkebispedøme

          Birsay

          Was Woodrow Wilson really a Liberal?Was World War I a war of liberals against authoritarians?Founding Fathers...