finding perfect power factors of an integer
Clash Royale CLAN TAG#URR8PPP
up vote
1
down vote
favorite
I'm writing a program that does symbolic algebraic computation. The desired behavior for taking the $n$th root of an integer $r$ is to return $psqrt[n]fracrp^n$, where $p$ is the largest integer such that $p^n$ divides $r$. In other words, the program moves any factors $r$ might have that are perfect $n$th powers outside the surd.
I have been using a naive method of trial division to find these factors, but this approach is now too inefficient for my purposes. Is the problem of finding perfect $n$th power factors any easier in the computational complexity sense than factoring an integer completely? - are there any additional tricks that can be brought to bear on this less general problem?
number-theory factoring perfect-powers
add a comment |Â
up vote
1
down vote
favorite
I'm writing a program that does symbolic algebraic computation. The desired behavior for taking the $n$th root of an integer $r$ is to return $psqrt[n]fracrp^n$, where $p$ is the largest integer such that $p^n$ divides $r$. In other words, the program moves any factors $r$ might have that are perfect $n$th powers outside the surd.
I have been using a naive method of trial division to find these factors, but this approach is now too inefficient for my purposes. Is the problem of finding perfect $n$th power factors any easier in the computational complexity sense than factoring an integer completely? - are there any additional tricks that can be brought to bear on this less general problem?
number-theory factoring perfect-powers
2
In general, detecting the largest $n$ th power dividing a number is not significantically easier than factoring.
â Peter
Aug 15 at 10:19
add a comment |Â
up vote
1
down vote
favorite
up vote
1
down vote
favorite
I'm writing a program that does symbolic algebraic computation. The desired behavior for taking the $n$th root of an integer $r$ is to return $psqrt[n]fracrp^n$, where $p$ is the largest integer such that $p^n$ divides $r$. In other words, the program moves any factors $r$ might have that are perfect $n$th powers outside the surd.
I have been using a naive method of trial division to find these factors, but this approach is now too inefficient for my purposes. Is the problem of finding perfect $n$th power factors any easier in the computational complexity sense than factoring an integer completely? - are there any additional tricks that can be brought to bear on this less general problem?
number-theory factoring perfect-powers
I'm writing a program that does symbolic algebraic computation. The desired behavior for taking the $n$th root of an integer $r$ is to return $psqrt[n]fracrp^n$, where $p$ is the largest integer such that $p^n$ divides $r$. In other words, the program moves any factors $r$ might have that are perfect $n$th powers outside the surd.
I have been using a naive method of trial division to find these factors, but this approach is now too inefficient for my purposes. Is the problem of finding perfect $n$th power factors any easier in the computational complexity sense than factoring an integer completely? - are there any additional tricks that can be brought to bear on this less general problem?
number-theory factoring perfect-powers
asked Aug 15 at 8:03
Alex Kindel
13610
13610
2
In general, detecting the largest $n$ th power dividing a number is not significantically easier than factoring.
â Peter
Aug 15 at 10:19
add a comment |Â
2
In general, detecting the largest $n$ th power dividing a number is not significantically easier than factoring.
â Peter
Aug 15 at 10:19
2
2
In general, detecting the largest $n$ th power dividing a number is not significantically easier than factoring.
â Peter
Aug 15 at 10:19
In general, detecting the largest $n$ th power dividing a number is not significantically easier than factoring.
â Peter
Aug 15 at 10:19
add a comment |Â
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
active
oldest
votes
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f2883325%2ffinding-perfect-power-factors-of-an-integer%23new-answer', 'question_page');
);
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
2
In general, detecting the largest $n$ th power dividing a number is not significantically easier than factoring.
â Peter
Aug 15 at 10:19