about modular congruencecongruence proofCongruence Classes and the Chinese Remainder TheoremModulo and CongruenceQuestion about galois imaginary and modular arithmeticSimple congruence relation (modular arithmetic)Inverse modular arithmetic methodQuestion about repeated modular exponentiationsWhen can we take square root of one side in modular arithmetic?Smallest positive integer modular congruence problemConjecture about the system of powerful equations

Employee lack of ownership

What options are left, if Britain cannot decide?

How difficult is it to simply disable/disengage the MCAS on Boeing 737 Max 8 & 9 Aircraft?

Have the tides ever turned twice on any open problem?

Knife as defense against stray dogs

How to write cleanly even if my character uses expletive language?

How could an airship be repaired midflight?

Relationship between sampajanna definitions in SN 47.2 and SN 47.35

PTIJ: Who should I vote for? (21st Knesset Edition)

How to prove the triangle inequality for this metric space

Could this Scherzo by Beethoven be considered to be a fugue?

Why is there is so much iron?

Is it true that good novels will automatically sell themselves on Amazon (and so on) and there is no need for one to waste time promoting?

As a new Ubuntu desktop 18.04 LTS user, do I need to use ufw for a firewall or is iptables sufficient?

Why do tuner card drivers fail to build after kernel update to 4.4.0-143-generic?

Why do newer 737s use two different styles of split winglets?

Python if-else code style for reduced code for rounding floats

What is the significance behind "40 days" that often appears in the Bible?

Is honey really a supersaturated solution? Does heating to un-crystalize redissolve it or melt it?

Is Manda another name for Saturn (Shani)?

Bacteria contamination inside a thermos bottle

What is the purpose or proof behind chain rule?

Did Ender ever learn that he killed Stilson and/or Bonzo?

Different outputs for `w`, `who`, `whoami` and `id`



about modular congruence


congruence proofCongruence Classes and the Chinese Remainder TheoremModulo and CongruenceQuestion about galois imaginary and modular arithmeticSimple congruence relation (modular arithmetic)Inverse modular arithmetic methodQuestion about repeated modular exponentiationsWhen can we take square root of one side in modular arithmetic?Smallest positive integer modular congruence problemConjecture about the system of powerful equations













0












$begingroup$


Consider $p$ a prime and $(1+palpha)$ then clearly taking congruences mod $p^m$
$$
prod_i=0^p^m-1(1+palpha)=(1+palpha)^p^m equiv 1+(palpha)^p^m(equiv 1 ???)
$$

What we can say if we take more generally:



$$
prod_i=0^p^m-1(1+palpha_i)
$$
is $equiv 1$ mod $p^m$ ? ( $alpha_i$ in general for different $i$ are different integers)
thanks for clarifications!










share|cite|improve this question











$endgroup$
















    0












    $begingroup$


    Consider $p$ a prime and $(1+palpha)$ then clearly taking congruences mod $p^m$
    $$
    prod_i=0^p^m-1(1+palpha)=(1+palpha)^p^m equiv 1+(palpha)^p^m(equiv 1 ???)
    $$

    What we can say if we take more generally:



    $$
    prod_i=0^p^m-1(1+palpha_i)
    $$
    is $equiv 1$ mod $p^m$ ? ( $alpha_i$ in general for different $i$ are different integers)
    thanks for clarifications!










    share|cite|improve this question











    $endgroup$














      0












      0








      0





      $begingroup$


      Consider $p$ a prime and $(1+palpha)$ then clearly taking congruences mod $p^m$
      $$
      prod_i=0^p^m-1(1+palpha)=(1+palpha)^p^m equiv 1+(palpha)^p^m(equiv 1 ???)
      $$

      What we can say if we take more generally:



      $$
      prod_i=0^p^m-1(1+palpha_i)
      $$
      is $equiv 1$ mod $p^m$ ? ( $alpha_i$ in general for different $i$ are different integers)
      thanks for clarifications!










      share|cite|improve this question











      $endgroup$




      Consider $p$ a prime and $(1+palpha)$ then clearly taking congruences mod $p^m$
      $$
      prod_i=0^p^m-1(1+palpha)=(1+palpha)^p^m equiv 1+(palpha)^p^m(equiv 1 ???)
      $$

      What we can say if we take more generally:



      $$
      prod_i=0^p^m-1(1+palpha_i)
      $$
      is $equiv 1$ mod $p^m$ ? ( $alpha_i$ in general for different $i$ are different integers)
      thanks for clarifications!







      modular-arithmetic arithmetic






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Mar 13 at 5:28









      Jyrki Lahtonen

      110k13171385




      110k13171385










      asked Mar 12 at 11:29









      andresandres

      2439




      2439




















          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%2f3144978%2fabout-modular-congruence%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%2f3144978%2fabout-modular-congruence%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

          How should I support this large drywall patch? Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?How do I cover large gaps in drywall?How do I keep drywall around a patch from crumbling?Can I glue a second layer of drywall?How to patch long strip on drywall?Large drywall patch: how to avoid bulging seams?Drywall Mesh Patch vs. Bulge? To remove or not to remove?How to fix this drywall job?Prep drywall before backsplashWhat's the best way to fix this horrible drywall patch job?Drywall patching using 3M Patch Plus Primer

          random experiment with two different functions on unit interval Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 00:00UTC (8:00pm US/Eastern)Random variable and probability space notionsRandom Walk with EdgesFinding functions where the increase over a random interval is Poisson distributedNumber of days until dayCan an observed event in fact be of zero probability?Unit random processmodels of coins and uniform distributionHow to get the number of successes given $n$ trials , probability $P$ and a random variable $X$Absorbing Markov chain in a computer. Is “almost every” turned into always convergence in computer executions?Stopped random walk is not uniformly integrable

          Lowndes Grove History Architecture References Navigation menu32°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661132°48′6″N 79°57′58″W / 32.80167°N 79.96611°W / 32.80167; -79.9661178002500"National Register Information System"Historic houses of South Carolina"Lowndes Grove""+32° 48' 6.00", −79° 57' 58.00""Lowndes Grove, Charleston County (260 St. Margaret St., Charleston)""Lowndes Grove"The Charleston ExpositionIt Happened in South Carolina"Lowndes Grove (House), Saint Margaret Street & Sixth Avenue, Charleston, Charleston County, SC(Photographs)"Plantations of the Carolina Low Countrye