Finding discrete rth roots [closed]












0












$begingroup$


Is finding the integer $r^{th}$ root of an integer (if it exists) polynomial time? What is the algorithm?






discrete-mathematics







share|cite|improve this question









$endgroup$



closed as off-topic by Jyrki Lahtonen, Adrian Keister, drhab, Gibbs, Lee David Chung Lin Jan 31 at 4:13


This question appears to be off-topic. The users who voted to close gave this specific reason:


  • "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – Jyrki Lahtonen, Adrian Keister, drhab, Gibbs, Lee David Chung Lin

If this question can be reworded to fit the rules in the help center, please edit the question.





















    0












    $begingroup$


    Is finding the integer $r^{th}$ root of an integer (if it exists) polynomial time? What is the algorithm?






    discrete-mathematics







    share|cite|improve this question









    $endgroup$



    closed as off-topic by Jyrki Lahtonen, Adrian Keister, drhab, Gibbs, Lee David Chung Lin Jan 31 at 4:13


    This question appears to be off-topic. The users who voted to close gave this specific reason:


    • "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – Jyrki Lahtonen, Adrian Keister, drhab, Gibbs, Lee David Chung Lin

    If this question can be reworded to fit the rules in the help center, please edit the question.



















      0












      0








      0





      $begingroup$


      Is finding the integer $r^{th}$ root of an integer (if it exists) polynomial time? What is the algorithm?






      discrete-mathematics







      share|cite|improve this question









      $endgroup$




      Is finding the integer $r^{th}$ root of an integer (if it exists) polynomial time? What is the algorithm?






      discrete-mathematics




      discrete-mathematics






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Jan 30 at 5:46









      ZoeyZoey

      30629




      30629




      closed as off-topic by Jyrki Lahtonen, Adrian Keister, drhab, Gibbs, Lee David Chung Lin Jan 31 at 4:13


      This question appears to be off-topic. The users who voted to close gave this specific reason:


      • "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – Jyrki Lahtonen, Adrian Keister, drhab, Gibbs, Lee David Chung Lin

      If this question can be reworded to fit the rules in the help center, please edit the question.







      closed as off-topic by Jyrki Lahtonen, Adrian Keister, drhab, Gibbs, Lee David Chung Lin Jan 31 at 4:13


      This question appears to be off-topic. The users who voted to close gave this specific reason:


      • "This question is missing context or other details: Please provide additional context, which ideally explains why the question is relevant to you and our community. Some forms of context include: background and motivation, relevant definitions, source, possible strategies, your current progress, why the question is interesting or important, etc." – Jyrki Lahtonen, Adrian Keister, drhab, Gibbs, Lee David Chung Lin

      If this question can be reworded to fit the rules in the help center, please edit the question.






















          1 Answer
          1






          active

          oldest

          votes


















          1












          $begingroup$

          Yes. The algorithm is: take logarithms to sufficient accuracy, divide by $r$, exponentiate to sufficient accuracy, round off to the nearest integer, and check whether the $r$th power of that integer is the original number.






          share|cite|improve this answer









          $endgroup$




















            1 Answer
            1






            active

            oldest

            votes








            1 Answer
            1






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes









            1












            $begingroup$

            Yes. The algorithm is: take logarithms to sufficient accuracy, divide by $r$, exponentiate to sufficient accuracy, round off to the nearest integer, and check whether the $r$th power of that integer is the original number.






            share|cite|improve this answer









            $endgroup$


















              1












              $begingroup$

              Yes. The algorithm is: take logarithms to sufficient accuracy, divide by $r$, exponentiate to sufficient accuracy, round off to the nearest integer, and check whether the $r$th power of that integer is the original number.






              share|cite|improve this answer









              $endgroup$
















                1












                1








                1





                $begingroup$

                Yes. The algorithm is: take logarithms to sufficient accuracy, divide by $r$, exponentiate to sufficient accuracy, round off to the nearest integer, and check whether the $r$th power of that integer is the original number.






                share|cite|improve this answer









                $endgroup$



                Yes. The algorithm is: take logarithms to sufficient accuracy, divide by $r$, exponentiate to sufficient accuracy, round off to the nearest integer, and check whether the $r$th power of that integer is the original number.







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Jan 30 at 6:27









                Greg MartinGreg Martin

                36.5k23565




                36.5k23565















                    Popular posts from this blog

                    MongoDB - Not Authorized To Execute Command

                    Image
                    .everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty{ height:90px;width:728px;box-sizing:border-box; } 0 I have successfully enabled authorization on MongoDB and I have created an account on the admin database and then I created an account for my database called test. The following connection string to connect to my test database works successfully: mongo --host 192.168.17.52 --port 27017 -u user1 -p password --authenticationDatabase test Only problem I have now is, I cannot execute commands such as: show dbs. I get the following error when I try to do so: "errmsg" : "not authorized on admin to execute command { listDatabases: 1.0, lsid: { id: UUID("a1d5bc0d-bc58-485e-b232-270758a89455") }, $db: "admin...
                    Read more

                    in spring boot 2.1 many test slices are not allowed anymore due to multiple @BootstrapWith

                    Image
                    1 I tried to upgrade a yummy sandwich made of two test slices (@JsonTest and @JdbcTest in my case, crunchy test code in between) adding spring boot 2.1 flavour to it. But it seems it was not much of a success. I cannot annotate my tests with many @...Test since they are now each bringing their own XxxTestContextBootstrapper. It used to work when they all used same SpringBootTestContextBootstrapper. @RunWith(SpringRunner.class) @JdbcTest @JsonTest public class Test { @Test public void test() { System.out.printn("Hello, World !"); } } The error I get from BootstrapUtils is illegalStateException : Configuration error: found multiple declarations of @BootstrapWith for test class I understand I might be doing something wrong here but is there an easy way I could load both Json and Jdbc contex...
                    Read more

                    Npm cannot find a required file even through it is in the searched directory

                    Image
                    up vote 0 down vote favorite I got that error: users-Air:pdfuploader user$ npm run start client@0.1.0 start /Users/user/Documents/pdfuploader react-scripts start Could not find a required file. Name: index.html Searched in: /Users/user/Documents/pdfuploader/public npm ERR! code ELIFECYCLE npm ERR! errno 1 npm ERR! client@0.1.0 start: `react-scripts start` npm ERR! Exit status 1 npm ERR! npm ERR! Failed at the client@0.1.0 start script. npm ERR! This is probably not a problem with npm. There is likely additional logging output above. npm ERR! A complete log of this run can be found in: npm ERR! /Users/user/.npm/_logs/2018-11-19T10_19_14_555Z-debug.log users-Air:pdfuploader user$ And the file is in /Users/user/Documents/pdfuploader/public as you can see in my github repository: https://github.c...
                    Read more