a a 5 = b b
There exist n ≥ 1 pair(s) of positive integers ( a i , b i ) with a i , b i > 1 such that the above equation is satisfied.
Find i = 1 ∑ n ( a i + b i ) .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Good solution showing how to iteratively simplify this problem.
Let
b
=
a
x
×
k
where
x
is such that
a
does not divide
k
. After plugging this the equation becomes
k
k
=
a
a
5
−
x
−
x
. Since
a
does not divide
k
there must exist a prime divisor
p
of
a
and
k
such that
v
p
(
a
)
>
v
p
(
k
)
. The power of
p
must be same in
R
H
S
and
L
H
S
thus giving
k
=
v
p
(
k
)
(
a
5
−
x
−
x
)
×
v
p
(
a
)
>
a
5
−
x
−
x
---
(
i
)
. As
b
<
a
5
we have
0
≤
x
≤
4
. Now we have to just check all cases from
x
=
0
to
x
=
4
.
Cases
x
=
0
,
1
,
2
are easy to prove so I will show only
x
=
3
,
4
.
Case
x
=
3
. From
b
<
a
5
and
(
i
)
we get
a
2
−
2
≤
k
<
a
2
.
k
cannot be
a
2
−
1
as it
g
c
d
(
a
+
1
,
a
)
=
1
. So
k
is
a
2
−
2
but this is not correct either as
L
H
S
becomes greater than
R
H
S
. No solutions in this case.
Case x = 4 From b < a 5 and ( i ) we get a − 3 ≤ k < a . Again we have to check k = ( a − 3 ) , ( a − 2 ) , ( a − 1 ) which is not very dufficult. After checking all cases in this case we get only one solution a = 4 , k = 1 i.e. a = 4 , b = 2 5 6 .
Problem Loading...
Note Loading...
Set Loading...
All variables introduced in this solution are positive integers.
It is obvious that b > a .
Write a = k c , b = k d where k = g cd ( a , b ) ≥ 1 . Substituting into the equation yields:
( k c ) k 5 c 5 = ( k d ) k d
k k 5 c 5 − k d = c k 5 c 5 d k d
Since g cd ( c , d ) = 1 and the L.H.S. is an positive integer, this is only possible if c = 1 .
Therefore, we can write b = a d , d ∈ N + . Substituting this into the original equation, we have
a a 5 = d d a a d a
a a 5 − d a = d d a
a a 4 − d = d d
Note that if a > d , then L.H.S. > R.H.S. as long as a > 2 3 1 since a 4 > 2 a > 2 d .
Therefore, a ≤ d and we can write d = e a , e ∈ N + by the same argument above. Repeating the procedure above, we get
a a 3 − 2 e = e e .
Note that if a > e , then L.H.S. > R.H.S. as long as a > 3 since a 3 > 3 a > 3 e .
Therefore, a ≤ e and we can write e = f a , f ∈ N + . Repeating the procedure above, we get
a a 2 − 3 f = f f
Note that if a > f , then L.H.S. > R.H.S. as long as a > 4 since a 2 > 4 a > 4 f .
We will manually check the cases for a = 2 , 3 , 4 before proceeding to assume that a ≤ f
If a = 2 , note that 2 4 − 3 f = f f . Since a > f , this forces f = 1 , but 2 4 − 3 = 1 1 .
If a = 3 , note that 3 9 − 3 f = f f . Since a > f , this forces f = 1 or 2 , but the equation does not hold in either cases.
If a = 4 , note that 4 1 6 − 3 f = f f . Since a > f , this forces f = 1 , 2 or 3 , but equation does not hold in all 3 cases.
Therefore, with a ≤ f , we can write f = g a , g ∈ N + . Repeating the procedure above, we get
a a − 4 g = g g .
If we assume a ≤ g and write g = h a , h ∈ N + , we get
a 1 − 5 h = h h which is impossible since we require 1 − 5 h > 0 if h is to be a positive integer. Therefore, we can conclude that a > g .
Now, write a = j g with j > 1 , j ∈ N + . We get
( j g ) j g − 4 g = g g
( j g ) j − 4 = g
j j − 4 = g 5 − j
The only possible value j can take is 4 . (You may prove this as an exercise.)
Solving the equation, we find that g = 1 . Therefore, a = 4
Write 4 4 5 = 4 1 0 2 4 = 4 ( 4 ) ( 2 5 6 ) = 2 5 6 2 5 6 and we are done.
The answer is therefore 4 + 2 5 6 = 2 6 0