Online Solver for Prime Power Modulus problems











up vote
1
down vote

favorite












I am trying to solve some problems nominated as a HW by our instructor. Problems are of the form:



$$f(x) equiv 0 pmod{p^k}$$



where $f(x)$ is a polynomial. My concern is to check the correctness of my solutions. Is there a website solving such problems online??



I am asking this question after a little unsuccessful research on the web.










share|cite|improve this question


























    up vote
    1
    down vote

    favorite












    I am trying to solve some problems nominated as a HW by our instructor. Problems are of the form:



    $$f(x) equiv 0 pmod{p^k}$$



    where $f(x)$ is a polynomial. My concern is to check the correctness of my solutions. Is there a website solving such problems online??



    I am asking this question after a little unsuccessful research on the web.










    share|cite|improve this question
























      up vote
      1
      down vote

      favorite









      up vote
      1
      down vote

      favorite











      I am trying to solve some problems nominated as a HW by our instructor. Problems are of the form:



      $$f(x) equiv 0 pmod{p^k}$$



      where $f(x)$ is a polynomial. My concern is to check the correctness of my solutions. Is there a website solving such problems online??



      I am asking this question after a little unsuccessful research on the web.










      share|cite|improve this question













      I am trying to solve some problems nominated as a HW by our instructor. Problems are of the form:



      $$f(x) equiv 0 pmod{p^k}$$



      where $f(x)$ is a polynomial. My concern is to check the correctness of my solutions. Is there a website solving such problems online??



      I am asking this question after a little unsuccessful research on the web.







      number-theory elementary-number-theory modular-arithmetic






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Nov 21 at 13:31









      Maged Saeed

      636316




      636316






















          1 Answer
          1






          active

          oldest

          votes

















          up vote
          4
          down vote



          accepted










          Wolfram Alpha does it. The syntax is like this:



          x^3+2x-7 = 0 (mod 5^3)





          share|cite|improve this answer





















            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',
            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%2f3007731%2fonline-solver-for-prime-power-modulus-problems%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown

























            1 Answer
            1






            active

            oldest

            votes








            1 Answer
            1






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes








            up vote
            4
            down vote



            accepted










            Wolfram Alpha does it. The syntax is like this:



            x^3+2x-7 = 0 (mod 5^3)





            share|cite|improve this answer

























              up vote
              4
              down vote



              accepted










              Wolfram Alpha does it. The syntax is like this:



              x^3+2x-7 = 0 (mod 5^3)





              share|cite|improve this answer























                up vote
                4
                down vote



                accepted







                up vote
                4
                down vote



                accepted






                Wolfram Alpha does it. The syntax is like this:



                x^3+2x-7 = 0 (mod 5^3)





                share|cite|improve this answer












                Wolfram Alpha does it. The syntax is like this:



                x^3+2x-7 = 0 (mod 5^3)






                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Nov 21 at 13:39









                lhf

                162k9166385




                162k9166385






























                    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.





                    Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


                    Please pay close attention to the following guidance:


                    • 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.


                    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%2f3007731%2fonline-solver-for-prime-power-modulus-problems%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

                    Quarter-circle Tiles

                    build a pushdown automaton that recognizes the reverse language of a given pushdown automaton?

                    Mont Emei