Find the largest of the three prime divisors of the number $13^4 + 16^5 - 172^2$
Clash Royale CLAN TAG#URR8PPP
up vote
3
down vote
favorite
I was able to factor out only the prime 13,thus $13^4 + 16^5 - 172^2=13cdot 80581$
What should be done to solve it? (Maybe some clever factorization, modulo, or anything else?)
prime-numbers factoring prime-factorization
 |Â
show 1 more comment
up vote
3
down vote
favorite
I was able to factor out only the prime 13,thus $13^4 + 16^5 - 172^2=13cdot 80581$
What should be done to solve it? (Maybe some clever factorization, modulo, or anything else?)
prime-numbers factoring prime-factorization
3
The number is small enough that you can just throw it at a computer, or as the second factor is also below $sqrt80581approx 284$ it wouldn't be too much work to just try the primes below that by hand. That leads to: Why do you need to factor this number, what factorisation algorithms do you know, how do you know there are three prime divisors?
â Henrik
Aug 18 at 8:18
1
$80581=284^2-3cdot 5^2$ allows to further accelerate the search. You can concentrate on the primes having $3$ as a quadratic residue.
â Peter
Aug 18 at 8:28
1
To solve $x^2+y^2=80581$ , you can try to check the numbers ending with $09,41,59,91$ and in fact we have $$80581=241^2+150^2$$ showing that every prime factor of $80581$ must be of the form $12k+1$. Now, you soon should find $61mid 80581$
â Peter
Aug 18 at 8:36
1
Since $13,37,61$ do not divide the cofactor $1321$ and $61^2>1321$, $1321$ must be prime giving the final answer.
â Peter
Aug 18 at 8:42
@Henrik It's a sum from a PRMO paper, which is the first step to get to IMO from India. So I don't think it requires very advanced concepts unknown to highschool students.
â redx
Aug 18 at 13:09
 |Â
show 1 more comment
up vote
3
down vote
favorite
up vote
3
down vote
favorite
I was able to factor out only the prime 13,thus $13^4 + 16^5 - 172^2=13cdot 80581$
What should be done to solve it? (Maybe some clever factorization, modulo, or anything else?)
prime-numbers factoring prime-factorization
I was able to factor out only the prime 13,thus $13^4 + 16^5 - 172^2=13cdot 80581$
What should be done to solve it? (Maybe some clever factorization, modulo, or anything else?)
prime-numbers factoring prime-factorization
edited Aug 18 at 8:38
Peter
45.3k1039119
45.3k1039119
asked Aug 18 at 6:55
redx
314
314
3
The number is small enough that you can just throw it at a computer, or as the second factor is also below $sqrt80581approx 284$ it wouldn't be too much work to just try the primes below that by hand. That leads to: Why do you need to factor this number, what factorisation algorithms do you know, how do you know there are three prime divisors?
â Henrik
Aug 18 at 8:18
1
$80581=284^2-3cdot 5^2$ allows to further accelerate the search. You can concentrate on the primes having $3$ as a quadratic residue.
â Peter
Aug 18 at 8:28
1
To solve $x^2+y^2=80581$ , you can try to check the numbers ending with $09,41,59,91$ and in fact we have $$80581=241^2+150^2$$ showing that every prime factor of $80581$ must be of the form $12k+1$. Now, you soon should find $61mid 80581$
â Peter
Aug 18 at 8:36
1
Since $13,37,61$ do not divide the cofactor $1321$ and $61^2>1321$, $1321$ must be prime giving the final answer.
â Peter
Aug 18 at 8:42
@Henrik It's a sum from a PRMO paper, which is the first step to get to IMO from India. So I don't think it requires very advanced concepts unknown to highschool students.
â redx
Aug 18 at 13:09
 |Â
show 1 more comment
3
The number is small enough that you can just throw it at a computer, or as the second factor is also below $sqrt80581approx 284$ it wouldn't be too much work to just try the primes below that by hand. That leads to: Why do you need to factor this number, what factorisation algorithms do you know, how do you know there are three prime divisors?
â Henrik
Aug 18 at 8:18
1
$80581=284^2-3cdot 5^2$ allows to further accelerate the search. You can concentrate on the primes having $3$ as a quadratic residue.
â Peter
Aug 18 at 8:28
1
To solve $x^2+y^2=80581$ , you can try to check the numbers ending with $09,41,59,91$ and in fact we have $$80581=241^2+150^2$$ showing that every prime factor of $80581$ must be of the form $12k+1$. Now, you soon should find $61mid 80581$
â Peter
Aug 18 at 8:36
1
Since $13,37,61$ do not divide the cofactor $1321$ and $61^2>1321$, $1321$ must be prime giving the final answer.
â Peter
Aug 18 at 8:42
@Henrik It's a sum from a PRMO paper, which is the first step to get to IMO from India. So I don't think it requires very advanced concepts unknown to highschool students.
â redx
Aug 18 at 13:09
3
3
The number is small enough that you can just throw it at a computer, or as the second factor is also below $sqrt80581approx 284$ it wouldn't be too much work to just try the primes below that by hand. That leads to: Why do you need to factor this number, what factorisation algorithms do you know, how do you know there are three prime divisors?
â Henrik
Aug 18 at 8:18
The number is small enough that you can just throw it at a computer, or as the second factor is also below $sqrt80581approx 284$ it wouldn't be too much work to just try the primes below that by hand. That leads to: Why do you need to factor this number, what factorisation algorithms do you know, how do you know there are three prime divisors?
â Henrik
Aug 18 at 8:18
1
1
$80581=284^2-3cdot 5^2$ allows to further accelerate the search. You can concentrate on the primes having $3$ as a quadratic residue.
â Peter
Aug 18 at 8:28
$80581=284^2-3cdot 5^2$ allows to further accelerate the search. You can concentrate on the primes having $3$ as a quadratic residue.
â Peter
Aug 18 at 8:28
1
1
To solve $x^2+y^2=80581$ , you can try to check the numbers ending with $09,41,59,91$ and in fact we have $$80581=241^2+150^2$$ showing that every prime factor of $80581$ must be of the form $12k+1$. Now, you soon should find $61mid 80581$
â Peter
Aug 18 at 8:36
To solve $x^2+y^2=80581$ , you can try to check the numbers ending with $09,41,59,91$ and in fact we have $$80581=241^2+150^2$$ showing that every prime factor of $80581$ must be of the form $12k+1$. Now, you soon should find $61mid 80581$
â Peter
Aug 18 at 8:36
1
1
Since $13,37,61$ do not divide the cofactor $1321$ and $61^2>1321$, $1321$ must be prime giving the final answer.
â Peter
Aug 18 at 8:42
Since $13,37,61$ do not divide the cofactor $1321$ and $61^2>1321$, $1321$ must be prime giving the final answer.
â Peter
Aug 18 at 8:42
@Henrik It's a sum from a PRMO paper, which is the first step to get to IMO from India. So I don't think it requires very advanced concepts unknown to highschool students.
â redx
Aug 18 at 13:09
@Henrik It's a sum from a PRMO paper, which is the first step to get to IMO from India. So I don't think it requires very advanced concepts unknown to highschool students.
â redx
Aug 18 at 13:09
 |Â
show 1 more comment
1 Answer
1
active
oldest
votes
up vote
5
down vote
accepted
Note that since $172 = 4 cdot 43$, we have
$$
beginalign 13^4 + 16^5 - 172^2 &= 13^4 + 16(16^4 - 43^2) \
&= 13^4 + 16 (16^2 - 43)(16^2 + 43) \ &= 13^4 + 16(213)underbrace(299)_13 cdot 23 \ &= 13(13^3 + 16 cdot 23 cdot 213)endalign
$$
From here, there are several methods already stated in the comments, but one that worked particularly well for me (read: I got lucky with) is to look for primes $p$ such that for some $k$, $13^3 equiv k pmodp$ and $16 cdot 23 cdot 213 equiv -k pmodp$, so that $13^3 + 16 cdot 23 cdot 213 equiv 0 pmodp$. If we could find some such $p$, it would mean that $p mid 13^3 + 16 cdot 23 cdot 213 mid 13^4 + 16^5 - 172^2$.
Trying for small values of $k$, we first see that $k = 0$ is not helpful since $13 nmid 16 cdot 23 cdot 213$, so next we try $k = 1$. To see what primes satisfy $13^3 equiv 1 pmodp$, we look at the factorization $$13^3 - 1 = (13 - 1)(13^2 + 13 + 1) = (2^2 cdot 3)(3 cdot 61) = 2^2 cdot 3^2 cdot 61$$ which yields $2, 3, 61$ as candidate solutions for $p$. However, it's clear that $p=2$ is not a solution since $13^3 + 16 cdot 23 cdot 213$ is odd, and $p = 3$ is not a solution since $13^3 + 16 cdot 23 cdot 213 equiv 1 + 1 cdot 2 cdot 0 equiv 1 pmod3$.
Testing $p = 61$, the other congruence yields $$(16 cdot 23) cdot 213 equiv 368 cdot 30 equiv 2 cdot 30 equiv -1 pmod61$$
which is exactly the kind of result we were looking for. This proves $61 mid 13^4 + 16^5 - 172^2$, and then it only remains to see what factors $80581/61 = 1321$ has. It is easy enough to check by hand that this is prime (using Peter's analysis for example, or just brute force all $18 = lfloor sqrt1321 rfloor / 2$ odd candidate factors), which gives you all three prime factors.
add a comment |Â
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
up vote
5
down vote
accepted
Note that since $172 = 4 cdot 43$, we have
$$
beginalign 13^4 + 16^5 - 172^2 &= 13^4 + 16(16^4 - 43^2) \
&= 13^4 + 16 (16^2 - 43)(16^2 + 43) \ &= 13^4 + 16(213)underbrace(299)_13 cdot 23 \ &= 13(13^3 + 16 cdot 23 cdot 213)endalign
$$
From here, there are several methods already stated in the comments, but one that worked particularly well for me (read: I got lucky with) is to look for primes $p$ such that for some $k$, $13^3 equiv k pmodp$ and $16 cdot 23 cdot 213 equiv -k pmodp$, so that $13^3 + 16 cdot 23 cdot 213 equiv 0 pmodp$. If we could find some such $p$, it would mean that $p mid 13^3 + 16 cdot 23 cdot 213 mid 13^4 + 16^5 - 172^2$.
Trying for small values of $k$, we first see that $k = 0$ is not helpful since $13 nmid 16 cdot 23 cdot 213$, so next we try $k = 1$. To see what primes satisfy $13^3 equiv 1 pmodp$, we look at the factorization $$13^3 - 1 = (13 - 1)(13^2 + 13 + 1) = (2^2 cdot 3)(3 cdot 61) = 2^2 cdot 3^2 cdot 61$$ which yields $2, 3, 61$ as candidate solutions for $p$. However, it's clear that $p=2$ is not a solution since $13^3 + 16 cdot 23 cdot 213$ is odd, and $p = 3$ is not a solution since $13^3 + 16 cdot 23 cdot 213 equiv 1 + 1 cdot 2 cdot 0 equiv 1 pmod3$.
Testing $p = 61$, the other congruence yields $$(16 cdot 23) cdot 213 equiv 368 cdot 30 equiv 2 cdot 30 equiv -1 pmod61$$
which is exactly the kind of result we were looking for. This proves $61 mid 13^4 + 16^5 - 172^2$, and then it only remains to see what factors $80581/61 = 1321$ has. It is easy enough to check by hand that this is prime (using Peter's analysis for example, or just brute force all $18 = lfloor sqrt1321 rfloor / 2$ odd candidate factors), which gives you all three prime factors.
add a comment |Â
up vote
5
down vote
accepted
Note that since $172 = 4 cdot 43$, we have
$$
beginalign 13^4 + 16^5 - 172^2 &= 13^4 + 16(16^4 - 43^2) \
&= 13^4 + 16 (16^2 - 43)(16^2 + 43) \ &= 13^4 + 16(213)underbrace(299)_13 cdot 23 \ &= 13(13^3 + 16 cdot 23 cdot 213)endalign
$$
From here, there are several methods already stated in the comments, but one that worked particularly well for me (read: I got lucky with) is to look for primes $p$ such that for some $k$, $13^3 equiv k pmodp$ and $16 cdot 23 cdot 213 equiv -k pmodp$, so that $13^3 + 16 cdot 23 cdot 213 equiv 0 pmodp$. If we could find some such $p$, it would mean that $p mid 13^3 + 16 cdot 23 cdot 213 mid 13^4 + 16^5 - 172^2$.
Trying for small values of $k$, we first see that $k = 0$ is not helpful since $13 nmid 16 cdot 23 cdot 213$, so next we try $k = 1$. To see what primes satisfy $13^3 equiv 1 pmodp$, we look at the factorization $$13^3 - 1 = (13 - 1)(13^2 + 13 + 1) = (2^2 cdot 3)(3 cdot 61) = 2^2 cdot 3^2 cdot 61$$ which yields $2, 3, 61$ as candidate solutions for $p$. However, it's clear that $p=2$ is not a solution since $13^3 + 16 cdot 23 cdot 213$ is odd, and $p = 3$ is not a solution since $13^3 + 16 cdot 23 cdot 213 equiv 1 + 1 cdot 2 cdot 0 equiv 1 pmod3$.
Testing $p = 61$, the other congruence yields $$(16 cdot 23) cdot 213 equiv 368 cdot 30 equiv 2 cdot 30 equiv -1 pmod61$$
which is exactly the kind of result we were looking for. This proves $61 mid 13^4 + 16^5 - 172^2$, and then it only remains to see what factors $80581/61 = 1321$ has. It is easy enough to check by hand that this is prime (using Peter's analysis for example, or just brute force all $18 = lfloor sqrt1321 rfloor / 2$ odd candidate factors), which gives you all three prime factors.
add a comment |Â
up vote
5
down vote
accepted
up vote
5
down vote
accepted
Note that since $172 = 4 cdot 43$, we have
$$
beginalign 13^4 + 16^5 - 172^2 &= 13^4 + 16(16^4 - 43^2) \
&= 13^4 + 16 (16^2 - 43)(16^2 + 43) \ &= 13^4 + 16(213)underbrace(299)_13 cdot 23 \ &= 13(13^3 + 16 cdot 23 cdot 213)endalign
$$
From here, there are several methods already stated in the comments, but one that worked particularly well for me (read: I got lucky with) is to look for primes $p$ such that for some $k$, $13^3 equiv k pmodp$ and $16 cdot 23 cdot 213 equiv -k pmodp$, so that $13^3 + 16 cdot 23 cdot 213 equiv 0 pmodp$. If we could find some such $p$, it would mean that $p mid 13^3 + 16 cdot 23 cdot 213 mid 13^4 + 16^5 - 172^2$.
Trying for small values of $k$, we first see that $k = 0$ is not helpful since $13 nmid 16 cdot 23 cdot 213$, so next we try $k = 1$. To see what primes satisfy $13^3 equiv 1 pmodp$, we look at the factorization $$13^3 - 1 = (13 - 1)(13^2 + 13 + 1) = (2^2 cdot 3)(3 cdot 61) = 2^2 cdot 3^2 cdot 61$$ which yields $2, 3, 61$ as candidate solutions for $p$. However, it's clear that $p=2$ is not a solution since $13^3 + 16 cdot 23 cdot 213$ is odd, and $p = 3$ is not a solution since $13^3 + 16 cdot 23 cdot 213 equiv 1 + 1 cdot 2 cdot 0 equiv 1 pmod3$.
Testing $p = 61$, the other congruence yields $$(16 cdot 23) cdot 213 equiv 368 cdot 30 equiv 2 cdot 30 equiv -1 pmod61$$
which is exactly the kind of result we were looking for. This proves $61 mid 13^4 + 16^5 - 172^2$, and then it only remains to see what factors $80581/61 = 1321$ has. It is easy enough to check by hand that this is prime (using Peter's analysis for example, or just brute force all $18 = lfloor sqrt1321 rfloor / 2$ odd candidate factors), which gives you all three prime factors.
Note that since $172 = 4 cdot 43$, we have
$$
beginalign 13^4 + 16^5 - 172^2 &= 13^4 + 16(16^4 - 43^2) \
&= 13^4 + 16 (16^2 - 43)(16^2 + 43) \ &= 13^4 + 16(213)underbrace(299)_13 cdot 23 \ &= 13(13^3 + 16 cdot 23 cdot 213)endalign
$$
From here, there are several methods already stated in the comments, but one that worked particularly well for me (read: I got lucky with) is to look for primes $p$ such that for some $k$, $13^3 equiv k pmodp$ and $16 cdot 23 cdot 213 equiv -k pmodp$, so that $13^3 + 16 cdot 23 cdot 213 equiv 0 pmodp$. If we could find some such $p$, it would mean that $p mid 13^3 + 16 cdot 23 cdot 213 mid 13^4 + 16^5 - 172^2$.
Trying for small values of $k$, we first see that $k = 0$ is not helpful since $13 nmid 16 cdot 23 cdot 213$, so next we try $k = 1$. To see what primes satisfy $13^3 equiv 1 pmodp$, we look at the factorization $$13^3 - 1 = (13 - 1)(13^2 + 13 + 1) = (2^2 cdot 3)(3 cdot 61) = 2^2 cdot 3^2 cdot 61$$ which yields $2, 3, 61$ as candidate solutions for $p$. However, it's clear that $p=2$ is not a solution since $13^3 + 16 cdot 23 cdot 213$ is odd, and $p = 3$ is not a solution since $13^3 + 16 cdot 23 cdot 213 equiv 1 + 1 cdot 2 cdot 0 equiv 1 pmod3$.
Testing $p = 61$, the other congruence yields $$(16 cdot 23) cdot 213 equiv 368 cdot 30 equiv 2 cdot 30 equiv -1 pmod61$$
which is exactly the kind of result we were looking for. This proves $61 mid 13^4 + 16^5 - 172^2$, and then it only remains to see what factors $80581/61 = 1321$ has. It is easy enough to check by hand that this is prime (using Peter's analysis for example, or just brute force all $18 = lfloor sqrt1321 rfloor / 2$ odd candidate factors), which gives you all three prime factors.
edited Aug 19 at 1:22
answered Aug 19 at 0:20
theyaoster
1,210313
1,210313
add a comment |Â
add a comment |Â
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%2f2886489%2ffind-the-largest-of-the-three-prime-divisors-of-the-number-134-165-1722%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
3
The number is small enough that you can just throw it at a computer, or as the second factor is also below $sqrt80581approx 284$ it wouldn't be too much work to just try the primes below that by hand. That leads to: Why do you need to factor this number, what factorisation algorithms do you know, how do you know there are three prime divisors?
â Henrik
Aug 18 at 8:18
1
$80581=284^2-3cdot 5^2$ allows to further accelerate the search. You can concentrate on the primes having $3$ as a quadratic residue.
â Peter
Aug 18 at 8:28
1
To solve $x^2+y^2=80581$ , you can try to check the numbers ending with $09,41,59,91$ and in fact we have $$80581=241^2+150^2$$ showing that every prime factor of $80581$ must be of the form $12k+1$. Now, you soon should find $61mid 80581$
â Peter
Aug 18 at 8:36
1
Since $13,37,61$ do not divide the cofactor $1321$ and $61^2>1321$, $1321$ must be prime giving the final answer.
â Peter
Aug 18 at 8:42
@Henrik It's a sum from a PRMO paper, which is the first step to get to IMO from India. So I don't think it requires very advanced concepts unknown to highschool students.
â redx
Aug 18 at 13:09