Using a Do-loop to find divisors mod 13Computing a sequence by recurrencePerform For-loop and show output...

Why does calling Python's 'magic method' not do type conversion like it would for the corresponding operator?

How bad is a Computer Science course that doesn't teach Design Patterns?

Buying a "Used" Router

Why don't hotels offer (at least) 1 kitchen bookable by any guest?

Is Screenshot Time-tracking Common?

"Cheaper by the dozen" phrase origin?

Workplace intimidation due to child's chronic health condition

Ethernet cable only works in certain positions

Who, if anyone, was the first astronaut to return to earth in a different vessel?

Which was the first story to feature helmets which reads your mind to control a machine?

Why does RAM (any type) access time decrease so slowly?

Does human life have innate value over that of other animals?

Discouraging missile alpha strikes

Does the phrase がんばする makes sense?

Which was the first story to feature space elevators?

Apparently I’m calling random numbers but there's nothing in the call log

Badly designed reimbursement form. What does that say about the company?

I hate taking lectures, can I still survive in academia?

How to play song that contains one guitar when we have two guitarists (or more)?

GPL - Is it required to post source code to the Public - when is a software released?

Negotiating 1-year delay to my Assistant Professor Offer

Can a planet be tidally unlocked?

How to use the viewer node?

Complicated square root problem.



Using a Do-loop to find divisors mod 13


Computing a sequence by recurrencePerform For-loop and show output which meets a certain criterionMaking loop based off what I can say in wordsHow to ValueQ a symbol, constructing the symbol name from strings?Can anyone re-produce this result related to the spectrum of Riemann Zeta using error term generated from MangoldtLambda?Find the number of $n$ such that $n!$ is a sum of three squaresEfficient way to sum all divisors of numbers below N excluding divisors 4/dIterating with different set of random reals at each iterationGCD using Euclidean AlgorithmListing divisors of a number













1












$begingroup$


I want to check sum of divisors of i mod 13 fori = 1 to i = 20. I tried writing a Do-Print loop so it looks like



Do[Print[DivisorSigma[1, i], {i, 20} mod 13] 


Any help will be greatly appreciated,










share|improve this question









New contributor




argamon is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$

















    1












    $begingroup$


    I want to check sum of divisors of i mod 13 fori = 1 to i = 20. I tried writing a Do-Print loop so it looks like



    Do[Print[DivisorSigma[1, i], {i, 20} mod 13] 


    Any help will be greatly appreciated,










    share|improve this question









    New contributor




    argamon is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
    Check out our Code of Conduct.







    $endgroup$















      1












      1








      1





      $begingroup$


      I want to check sum of divisors of i mod 13 fori = 1 to i = 20. I tried writing a Do-Print loop so it looks like



      Do[Print[DivisorSigma[1, i], {i, 20} mod 13] 


      Any help will be greatly appreciated,










      share|improve this question









      New contributor




      argamon is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.







      $endgroup$




      I want to check sum of divisors of i mod 13 fori = 1 to i = 20. I tried writing a Do-Print loop so it looks like



      Do[Print[DivisorSigma[1, i], {i, 20} mod 13] 


      Any help will be greatly appreciated,







      core-language number-theory






      share|improve this question









      New contributor




      argamon is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.











      share|improve this question









      New contributor




      argamon is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      share|improve this question




      share|improve this question








      edited 5 hours ago









      m_goldberg

      86.4k872196




      86.4k872196






      New contributor




      argamon is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.









      asked 7 hours ago









      argamonargamon

      82




      82




      New contributor




      argamon is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.





      New contributor





      argamon is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.






      argamon is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.






















          2 Answers
          2






          active

          oldest

          votes


















          2












          $begingroup$

          Table[DivisorSigma[1, i], {i, 20} ] // Mod[#, 13] &
          (*{1, 3, 4, 7, 6, 12, 8, 2, 0, 5, 12, 2, 1, 11, 11, 5, 5, 0, 7, 3}*)


          or



          Do[Print[Mod[DivisorSigma[1, i], 13]], {i, 20}]


          which gives a column of the same numbers as before that you can look at, but it is more difficult use in further expressions.






          share|improve this answer











          $endgroup$













          • $begingroup$
            thank you so much
            $endgroup$
            – argamon
            6 hours ago










          • $begingroup$
            You're welcome.
            $endgroup$
            – Bill Watts
            6 hours ago



















          2












          $begingroup$

          You can do it without iterators because the functions you need (Mod, DivisorSigma) are Listable:



          Mod[DivisorSigma[1, Range[20]], 13]



          {1, 3, 4, 7, 6, 12, 8, 2, 0, 5, 12, 2, 1, 11, 11, 5, 5, 0, 7, 3}




          Note: Listable functions are applied separately to each element in a list.






          share|improve this answer









          $endgroup$













          • $begingroup$
            that's also very useful and helpful thank you
            $endgroup$
            – argamon
            6 hours ago











          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: "387"
          };
          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: false,
          noModals: true,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: null,
          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
          },
          onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          });


          }
          });






          argamon is a new contributor. Be nice, and check out our Code of Conduct.










          draft saved

          draft discarded


















          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathematica.stackexchange.com%2fquestions%2f191853%2fusing-a-do-loop-to-find-divisors-mod-13%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown

























          2 Answers
          2






          active

          oldest

          votes








          2 Answers
          2






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes









          2












          $begingroup$

          Table[DivisorSigma[1, i], {i, 20} ] // Mod[#, 13] &
          (*{1, 3, 4, 7, 6, 12, 8, 2, 0, 5, 12, 2, 1, 11, 11, 5, 5, 0, 7, 3}*)


          or



          Do[Print[Mod[DivisorSigma[1, i], 13]], {i, 20}]


          which gives a column of the same numbers as before that you can look at, but it is more difficult use in further expressions.






          share|improve this answer











          $endgroup$













          • $begingroup$
            thank you so much
            $endgroup$
            – argamon
            6 hours ago










          • $begingroup$
            You're welcome.
            $endgroup$
            – Bill Watts
            6 hours ago
















          2












          $begingroup$

          Table[DivisorSigma[1, i], {i, 20} ] // Mod[#, 13] &
          (*{1, 3, 4, 7, 6, 12, 8, 2, 0, 5, 12, 2, 1, 11, 11, 5, 5, 0, 7, 3}*)


          or



          Do[Print[Mod[DivisorSigma[1, i], 13]], {i, 20}]


          which gives a column of the same numbers as before that you can look at, but it is more difficult use in further expressions.






          share|improve this answer











          $endgroup$













          • $begingroup$
            thank you so much
            $endgroup$
            – argamon
            6 hours ago










          • $begingroup$
            You're welcome.
            $endgroup$
            – Bill Watts
            6 hours ago














          2












          2








          2





          $begingroup$

          Table[DivisorSigma[1, i], {i, 20} ] // Mod[#, 13] &
          (*{1, 3, 4, 7, 6, 12, 8, 2, 0, 5, 12, 2, 1, 11, 11, 5, 5, 0, 7, 3}*)


          or



          Do[Print[Mod[DivisorSigma[1, i], 13]], {i, 20}]


          which gives a column of the same numbers as before that you can look at, but it is more difficult use in further expressions.






          share|improve this answer











          $endgroup$



          Table[DivisorSigma[1, i], {i, 20} ] // Mod[#, 13] &
          (*{1, 3, 4, 7, 6, 12, 8, 2, 0, 5, 12, 2, 1, 11, 11, 5, 5, 0, 7, 3}*)


          or



          Do[Print[Mod[DivisorSigma[1, i], 13]], {i, 20}]


          which gives a column of the same numbers as before that you can look at, but it is more difficult use in further expressions.







          share|improve this answer














          share|improve this answer



          share|improve this answer








          edited 6 hours ago

























          answered 6 hours ago









          Bill WattsBill Watts

          3,4311620




          3,4311620












          • $begingroup$
            thank you so much
            $endgroup$
            – argamon
            6 hours ago










          • $begingroup$
            You're welcome.
            $endgroup$
            – Bill Watts
            6 hours ago


















          • $begingroup$
            thank you so much
            $endgroup$
            – argamon
            6 hours ago










          • $begingroup$
            You're welcome.
            $endgroup$
            – Bill Watts
            6 hours ago
















          $begingroup$
          thank you so much
          $endgroup$
          – argamon
          6 hours ago




          $begingroup$
          thank you so much
          $endgroup$
          – argamon
          6 hours ago












          $begingroup$
          You're welcome.
          $endgroup$
          – Bill Watts
          6 hours ago




          $begingroup$
          You're welcome.
          $endgroup$
          – Bill Watts
          6 hours ago











          2












          $begingroup$

          You can do it without iterators because the functions you need (Mod, DivisorSigma) are Listable:



          Mod[DivisorSigma[1, Range[20]], 13]



          {1, 3, 4, 7, 6, 12, 8, 2, 0, 5, 12, 2, 1, 11, 11, 5, 5, 0, 7, 3}




          Note: Listable functions are applied separately to each element in a list.






          share|improve this answer









          $endgroup$













          • $begingroup$
            that's also very useful and helpful thank you
            $endgroup$
            – argamon
            6 hours ago
















          2












          $begingroup$

          You can do it without iterators because the functions you need (Mod, DivisorSigma) are Listable:



          Mod[DivisorSigma[1, Range[20]], 13]



          {1, 3, 4, 7, 6, 12, 8, 2, 0, 5, 12, 2, 1, 11, 11, 5, 5, 0, 7, 3}




          Note: Listable functions are applied separately to each element in a list.






          share|improve this answer









          $endgroup$













          • $begingroup$
            that's also very useful and helpful thank you
            $endgroup$
            – argamon
            6 hours ago














          2












          2








          2





          $begingroup$

          You can do it without iterators because the functions you need (Mod, DivisorSigma) are Listable:



          Mod[DivisorSigma[1, Range[20]], 13]



          {1, 3, 4, 7, 6, 12, 8, 2, 0, 5, 12, 2, 1, 11, 11, 5, 5, 0, 7, 3}




          Note: Listable functions are applied separately to each element in a list.






          share|improve this answer









          $endgroup$



          You can do it without iterators because the functions you need (Mod, DivisorSigma) are Listable:



          Mod[DivisorSigma[1, Range[20]], 13]



          {1, 3, 4, 7, 6, 12, 8, 2, 0, 5, 12, 2, 1, 11, 11, 5, 5, 0, 7, 3}




          Note: Listable functions are applied separately to each element in a list.







          share|improve this answer












          share|improve this answer



          share|improve this answer










          answered 6 hours ago









          kglrkglr

          185k10202420




          185k10202420












          • $begingroup$
            that's also very useful and helpful thank you
            $endgroup$
            – argamon
            6 hours ago


















          • $begingroup$
            that's also very useful and helpful thank you
            $endgroup$
            – argamon
            6 hours ago
















          $begingroup$
          that's also very useful and helpful thank you
          $endgroup$
          – argamon
          6 hours ago




          $begingroup$
          that's also very useful and helpful thank you
          $endgroup$
          – argamon
          6 hours ago










          argamon is a new contributor. Be nice, and check out our Code of Conduct.










          draft saved

          draft discarded


















          argamon is a new contributor. Be nice, and check out our Code of Conduct.













          argamon is a new contributor. Be nice, and check out our Code of Conduct.












          argamon is a new contributor. Be nice, and check out our Code of Conduct.
















          Thanks for contributing an answer to Mathematica 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%2fmathematica.stackexchange.com%2fquestions%2f191853%2fusing-a-do-loop-to-find-divisors-mod-13%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

          ORA-01691 (unable to extend lob segment) even though my tablespace has AUTOEXTEND onORA-01692: unable to...

          Always On Availability groups resolving state after failover - Remote harden of transaction...

          Circunscripción electoral de Guipúzcoa Referencias Menú de navegaciónLas claves del sistema electoral en...