Problems

Problem 1. Let 𝑛 be a positive integer and 𝑎, 𝑏, 𝑐, 𝑑 are integers such that (𝑛 − 𝑎)* (𝑛 − 𝑏)(𝑛 −
𝑐)(𝑛 − 𝑑) = 420 and 𝑎 + 𝑏 + 𝑐 + 𝑑 = 800. Find the sum of possible values for 𝑛.

Problem 2. How many triples of positive integers (𝑎, 𝑏, 𝑐) satisfy the following equation?

𝑎* + 𝑏* − 𝑐 * 𝑏* + 𝑐 * − 𝑎* 𝑐 * + 𝑎* − 𝑏* 15
+ + =2+ .
𝑎𝑏 𝑏𝑐 𝑎𝑐 𝑎𝑏𝑐
Problem 3. Let 𝑝 be a prime number and 𝑛 be a positive integer such that

𝑝5 + 5𝑛 − 1 = 𝑛(𝑝* + 2𝑝 + 6𝑛).

Problem 4. Let 𝑝 be an odd prime number and 𝑛 be a positive integer such that gcd(𝑝, 𝑛* −
𝑛) = 1. Lets define the sequence 𝑎: as follows:

𝑎; = 1 + 𝑝𝑛, 𝑎<=; = 1 + 𝑛𝑎< , 𝑘 = 1, 2, …

Find the remainder of 𝑎@A; when divided by 𝑝.

Problem 5. Let 𝑛 be a positive integer such that (𝑛* − 5𝑛 + 7)(𝑛* − 21𝑛 + 49) = 𝑝D , for
some prime number 𝑝 and positive integer 𝑚. Find the sum of the all possible values for 𝑝.

Problem 6. For positive integers 𝑚, 𝑛, 𝑘 with 𝑛 is being odd the following equation holds:

1 𝑛 2<
𝑚 + = 6 F < + G.
𝑚 2 𝑛

Find the value of 𝑚𝑛.

Problem 7. Let 𝑥, 𝑦 be positive integers such that:

𝑥(𝑥 + 5) = 𝑦(𝑦 − 1)(𝑦 + 1)(𝑦 + 2).

Find the sum of all possible values for 𝑥𝑦.

Problem 8. Let (𝑚; , 𝑛; ), … , (𝑚< , 𝑛< ) are all the positive integer solutions of 𝑚5 = 𝑛5 + 2𝑛* +
𝑚* + 7. Find 𝑚; + ⋯ + 𝑚< .

Problem 9. Let 𝑚, 𝑛 be positive integers such that 2𝑚* + 2𝑛* = 137(𝑚 − 𝑛), find the
maximum possible value of 𝑚 + 𝑛.
 DL =*MD:=:L
Problem 10. Find the sum of all possible integer values of DN =:N
, when (𝑚, 𝑛) are
relatively prime positive integers.

Problem 11. Let (𝑚; , 𝑛; ), … , (𝑚< , 𝑛< ) are all the integer solutions of 𝑛* = 𝑚O + 2𝑚5 +
2𝑚* + 2𝑚 + 2. Find ∑<QR; 𝑚Q* + 𝑛Q* .
T U V
Problem 12. Let 𝑥, 𝑦, 𝑧 be positive integers such that U + V + T = 6 and gcd(𝑧, 𝑥) = 1. Find the
maximal value of 𝑥 + 𝑦 + 𝑧.

Problems and Solutions

Problem 1. Let 𝑛 be a positive integer and 𝑎, 𝑏, 𝑐, 𝑑 are integers such that (𝑛 − 𝑎)* (𝑛 − 𝑏)(𝑛 −
𝑐)(𝑛 − 𝑑) = 420 and 𝑎 + 𝑏 + 𝑐 + 𝑑 = 800. Find the sum of possible values for 𝑛.

Solution. Let 𝑛 − 𝑎 = 𝑥, 𝑛 − 𝑏 = 𝑦, 𝑛 − 𝑐 = 𝑧, 𝑛 − 𝑑 = 𝑡. We find that

𝑥+𝑦+𝑧+𝑡
𝑛 = 200 + .
4
Hence, 𝑥 + 𝑦 + 𝑧 + 𝑡 is divisible by 4. Further, 𝑥 * 𝑦𝑧𝑡 = 420. Since 420 is square-free, we find
that 𝑥 = ±1. If 𝑥 = 1, then {𝑦, 𝑧. 𝑡} = {1,2,210} in this case 𝑛 = 253. If 𝑥 = −1 then
{𝑦, 𝑧. 𝑡} = {1, −2, −210} in this case 𝑛 = 147. Hence the desired sum is 400.

Problem 2. How many triples of positive integers (𝑎, 𝑏, 𝑐) satisfy the following equation?

𝑎* + 𝑏* − 𝑐 * 𝑏* + 𝑐 * − 𝑎* 𝑐 * + 𝑎* − 𝑏* 15
+ + =2+ .
𝑎𝑏 𝑏𝑐 𝑎𝑐 𝑎𝑏𝑐

Solution. Note that 𝑐(𝑎* + 𝑏 * − 𝑐 * ) + 𝑎(𝑏 * + 𝑐 * − 𝑎* ) + 𝑏(𝑐 * + 𝑎* − 𝑏 * ) − 2𝑎𝑏𝑐 = 15. The

left side could be factored as (𝑎 + 𝑏 − 𝑐)(𝑏 + 𝑐 − 𝑎)(𝑐 + 𝑎 − 𝑏). Thus,

(𝑎 + 𝑏 − 𝑐)(𝑏 + 𝑐 − 𝑎)(𝑐 + 𝑎 − 𝑏) = 15.

Writing 𝑥 = 𝑎 + 𝑏 − 𝑐, 𝑦 = 𝑐 + 𝑎 − 𝑏, 𝑧 = 𝑏 + 𝑐 − 𝑎. Then 𝑥𝑦𝑧 = 15 = 1. 3. 5. Moreover,

assume that 𝑎 ≥ 𝑏 ≥ 𝑐 then 𝑥 ≥ 𝑦 ≥ 𝑧. Further, 2𝑎 = 𝑥 + 𝑦, 2𝑏 = 𝑥 + 𝑧, 2𝑐 = 𝑦 + 𝑧. Hence,
we conclude that 𝑥, 𝑦, 𝑧 > 0. Therefore:
 (𝑥, 𝑦, 𝑧) = (15, 1, 1), (5, 3, 1).

Thus

(𝑎, 𝑏, 𝑐) = (8, 8, 1), (4,3,2).

Hence, we have 3 + 3! = 9 different pairs.

Problem 3. Let 𝑝 be a prime number and 𝑛 be a positive integer such that

𝑝5 + 5𝑛 − 1 = 𝑛(𝑝* + 2𝑝 + 6𝑛).

Compute the value of 𝑝𝑛.

Solution. Rewrite the original equation as 𝑝(𝑝* − 𝑝𝑛 − 2𝑛) = (2𝑛 − 1)(3𝑛 − 1). Then 𝑝
divides either 2𝑛 − 1 or 3𝑛 − 1. If 2𝑛 − 1 ≥ 2𝑝 or 3𝑛 − 1 ≥ 3𝑝, we find that 𝑛 ≥ 𝑝 + 1
therefore,

𝑝* − 𝑝𝑛 − 2𝑛 = 𝑝* − 𝑛(𝑝 + 2) ≤ 𝑝* − (𝑝 + 1)(𝑝 + 2) = −3𝑝 − 3 < 0.

Thus, we only have three possibilities: 𝑝 = 2𝑛 − 1, 𝑝 = 3𝑛 − 1, and 2𝑝 = 3𝑛 − 1. In the first to

cases, we find that𝑝* − 𝑝𝑛 − 2𝑛 must either be equal to 3𝑛 − 1 or 2𝑛 − 1. This implies that
1 + 𝑝* = 𝑝(𝑛 + 4) or 1 + 𝑝* = 𝑝(𝑛 + 5). Taking into account 𝑝 = 2𝑛 − 1, 𝑝 = 3𝑛 − 1, we find
that in these cases, we have no solution.

Assume now, 2𝑝 = 3𝑛 − 1. Then,

𝑝* − 𝑝𝑛 − 2𝑛 = 4𝑛 − 2.

Thus, 𝑝* + 2 = 𝑛(𝑝 + 6). Therefore, 𝑝 + 6 divides 𝑝* + 2 = 𝑝* − 36 + 38 = (𝑝 − 6)(𝑝 +

6) + 38. Thus, 𝑝 + 6 divides 38. Hence, 𝑝 + 6 ∈ {19, 38}. Since 𝑝 is a prime number, we find
that 𝑝 + 6 = 19 and 𝑝 = 13, 𝑛 = 9. That is, 𝑛𝑝 = 117.

Problem 4. Let 𝑝 be an odd prime number and 𝑛 be a positive integer such that gcd(𝑝, 𝑛* −
𝑛) = 1. Lets define the sequence 𝑎: as follows:

𝑎; = 1 + 𝑝𝑛, 𝑎<=; = 1 + 𝑛𝑎< , 𝑘 = 1, 2, …

Find the remainder of 𝑎@A; when divided by 𝑝.

Solution. Note That 𝑎<=; = 1 + 𝑛𝑎< = 1 + 𝑛(1 + 𝑛𝑎<A; ) = 1 + 𝑛 + 𝑛* 𝑎<A; = 1 + 𝑛 + 𝑛* +

𝑛5 𝑎<A* . That is,

𝑎<=; = 1 + 𝑛 + 𝑛* + ⋯ + 𝑛< 𝑎; .

Hence,
 𝑎<=; ≡ 1 + 𝑛 + 𝑛* + ⋯ + 𝑛< (mod 𝑝).

Therefore,

𝑛@A; − 1
𝑎@A; ≡ 1 + 𝑛 + 𝑛* + ⋯ + 𝑛@A* ≡ (mod 𝑝).
𝑛−1
Since gcd(𝑝, 𝑛* − 𝑛) = 1, by use of Fermat’s little theorem, we find that 𝑎@A; ≡ 0(mod 𝑝).

Problem 5. Let 𝑛 be a positive integer such that (𝑛* − 5𝑛 + 7)(𝑛* − 21𝑛 + 49) = 𝑝D , for
some prime number 𝑝 and positive integer 𝑚. Find the sum of the all possible values for 𝑝.

Solution. If 𝑛 = 1, then 3.29 ≠ 𝑝D . If 𝑛 − 2 then, 11 = 11; = 𝑝D . Thus, 𝑝 = 11, 𝑚 = 1 is

indeed a solution.

Note that 𝑛* − 5𝑛 + 7 − (𝑛* − 21𝑛 + 49) = 16𝑛 − 42. Thus, for each 𝑛 ≥ 2, 𝑛* − 5𝑛 + 7 >
𝑛* − 21𝑛 + 49. Moreover, for 4 ≤ 𝑛 ≤ 18, 𝑛* − 21𝑛 + 49 < 0 but, 𝑛* − 5𝑛 + 7 > 0, thus,
the product couldn’t be a prime power. Assume now that 𝑛 ≥ 19, since both of them are prime
powers, we find that:

𝑛* − 21𝑛 + 49|𝑛* − 5𝑛 + 7.

Thus,

𝑛* − 21𝑛 + 49|𝑛* − 5𝑛 + 7 − (𝑛* − 21𝑛 + 49) = 16𝑛 − 42 = 2(8𝑛 − 21).

Further, 𝑛* − 21𝑛 + 49 is odd, therefore, 𝑛* − 21𝑛 + 49|8𝑛 − 21. Thus,

8𝑛 − 21 ≥ 𝑛* − 21𝑛 + 49.

That is, 𝑛* − 29𝑛 + 70 ≤ 0. Thus, 𝑛 ≤ 26. Then, we have to check 𝑛 = 19, … ,26. The only
possible 𝑛 that satisfies 𝑛* − 21𝑛 + 49|8𝑛 − 21 is 𝑛 = 21. Hence, (𝑛* − 5𝑛 + 7)(𝑛* − 21𝑛 +
49) = 7g = 𝑝D . Hence, 𝑝 = 7, 𝑚 = 5.

The desired sum is 18.

Second approach. After 𝑛* − 21𝑛 + 49|8𝑛 − 21, we can find that 𝑛* − 21𝑛 + 49|8𝑛* − 21𝑛
yielding to the fact that

𝑛* − 21𝑛 + 49|8𝑛* − 21𝑛 − 8(𝑛* − 21𝑛 + 49) = 49(3𝑛 − 8).

Since 𝑛* − 21𝑛 + 49|8𝑛 − 21 we find that 𝑛* − 21𝑛 + 49|3.49(8𝑛 − 21) − 8h49(3𝑛 − 8)i =
49. Thus,
 𝑛* − 21𝑛 + 49 ∈ {1, 7, 49}.

Hence, the only possible solution is 𝑛 = 21. Thus, (𝑛* − 5𝑛 + 7)(𝑛* − 21𝑛 + 49) = 7g = 𝑝D .
Hence, 𝑝 = 7, 𝑚 = 5.

The desired sum is 18.

Problem 6. For positive integers 𝑚, 𝑛, 𝑘 with 𝑛 is being odd the following equation holds:

1 𝑛 2<
𝑚 + = 6 F < + G.
𝑚 2 𝑛

Find the value of 𝑚𝑛.

Solution. Rewrite the original equation as 2< 𝑛(𝑚* + 1) = 6𝑚(𝑛* + 2*< ). since 𝑛* + 2*< is odd
2< divides 6𝑚 hence 𝑚 = 2<A; 𝑎 for some positive integer 𝑎. That is,

𝑛(2*<A* 𝑎* + 1) = 3𝑎(𝑛* + 2*< ).

Assume now that 𝑘 > 1, then gcd(𝑎, 2*<A* 𝑎* + 1) = 1 thus, 𝑎 divides 𝑛. Write 𝑛 = 𝑎𝑏 then

𝑏(2*<A* 𝑎* + 1) = 3(𝑎* 𝑏 * + 2*< ).

The fact that 𝑎, 𝑏 are odd implies that 𝑏 divides 3 hence, either 𝑏 = 1 or 𝑏 = 3. Assume the
former, then

2*<A* 𝑎* + 1 = 3(𝑎* + 2*< ).

Taking modulo 3 we find that 2*<A* 𝑎* = (2<A; 𝑎)* ≡ −1(mod 3) impossible. Assume the
later, then

2*<A* 𝑎* + 1 = 9𝑎* + 2*< .

*Lj A; *Lj A;
Hence, 𝑎* = *LjkL Al. But *LjkL Al < 9 for all 𝑘 > 3. Since 𝑎 is odd we get to the contradiction. If
𝑘 = 2, then 𝑎* = −3 absurd! If 𝑘 = 3, then 𝑎* = 9 that is, 𝑎 = 3, 𝑏 = 3 then 𝑛 = 𝑎𝑏 = 9, 𝑚 =
𝑚 = 2<A; 𝑎 = 12.

Finally, assume 𝑘 = 1 then 𝑛(𝑎* + 1) = 3𝑎(𝑛* + 4). Since 3 doesn’t divide 𝑎* + 1 we find that
3 divides 𝑛. That is 𝑛 = 3𝑐. Therefore, 𝑐(𝑎* + 1) = 𝑎(9𝑐 * + 4). Since 𝑐 is odd, we find that
gcd(𝑐, 9𝑐 * + 4) = 1. Hence, 𝑐 divides 𝑎. On the other hand, since gcd(𝑎, 𝑎* + 1) = 1 we find
that 𝑎 divides 𝑐. Conclude that 𝑎 = 𝑐. But then

𝑎* + 1 = 𝑐 * + 1 = 9𝑐 * + 4
Absurd.

Thus (𝑚, 𝑛) = (12,9) is the only solution, yielding to 𝑚𝑛 = 108.

Problem 7. Let 𝑥, 𝑦 be positive integers such that:

𝑥(𝑥 + 5) = 𝑦(𝑦 − 1)(𝑦 + 1)(𝑦 + 2).

Find the sum of all possible values for 𝑥𝑦.

Solution. Rewrite the equation as 𝑥(𝑥 + 5) = (𝑦 * + 𝑦)(𝑦 * + 𝑦 − 2). Setting 𝑧 = 𝑦 * + 𝑦 − 2,

we get to the following equation:

𝑥(𝑥 + 5) = 𝑧(𝑧 + 2).

Now we solve the equation by use of two different approaches:

Approach i. Rewrite the equation in the form 𝑥 * − 𝑧 * + 5𝑥 − 2𝑧 = 0. Setting 𝑥 − 𝑧 = 𝑎, 𝑥 +

m=n nAm
𝑧 = 𝑏 then 𝑥 = *
,𝑧 = *
. Thus,

𝑎+𝑏 𝑏−𝑎
𝑥 * − 𝑧 * + 5𝑥 − 2𝑧 = (𝑥 − 𝑧)(𝑥 + 𝑧) + 5𝑥 − 2𝑧 = 𝑎𝑏 + 5 o p − 2o p = 0.
2 2
That is, 2𝑎𝑏 = −3𝑏 − 7𝑎. Thus (2𝑏 + 7)(2𝑎 + 3) = 21. But, 𝑏 > 0, and 2𝑏 + 7 > 7. Thus the
only possible solution is 2𝑏 + 7 = 21, 2𝑎 + 3 = 1. That is, (𝑎, 𝑏) = (= 1, 7). Thus, (𝑥, 𝑧) =
(3, 4). Now consider the equation 𝑧 = 𝑦 * + 𝑦 − 2 = 4. That is, (𝑦 + 3)(𝑦 − 2) = 0. Therefore,
𝑦 = 2, 𝑥 = 3 is the only positive solution. The answer is 6.

Approach ii. Rewrite the equation in the form

(𝑧 + 1)* = 𝑥 * + 5𝑥 + 1.

Implies that 𝑥 * + 5𝑥 + 1 should be square. That is, 4(𝑥 * + 5𝑥 + 1) is also a perfect square.
But for all 𝑥 > 3

4𝑥 * + 16𝑥 + 16 = (2𝑥 + 4)* < 4(𝑥 * + 5𝑥 + 1) = (2𝑥 + 5)* − 21 < (2𝑥 + 5)* .

It remains to check 𝑥 = 1, 2, 3. The only possibility is 𝑥 = 3 for which, 𝑧 = 4,. Hence, 𝑦 = 2.

Problem 8. Let (𝑚; , 𝑛; ), … , (𝑚< , 𝑛< ) are all the positive integer solutions of 𝑚5 = 𝑛5 + 2𝑛* +
𝑚* + 7. Find 𝑚; + ⋯ + 𝑚< .

Solution. It is easy to deduce that 𝑚5 > 𝑛5 therefore 𝑛 ≤ 𝑚 − 1. Rewrite the original equation
as
 𝑚5 = 𝑛* (𝑛 + 2) + 𝑚* + 7 ≤ (𝑚 − 1)* (𝑚 + 1) + 𝑚* + 7 = 𝑚5 − 𝑚 + 8.

This implies that 𝑚 ≤ 8 thus 𝑛 ≤ 𝑚 − 1 ≤ 7. Moreover, from 𝑚5 − 𝑚* − 7 = 𝑛* (𝑛 + 2), we

find that the left side is odd hence the right side. This ensures that 𝑛 is an odd integer. It
remains to check the cases 𝑛 ∈ {1, 3 5, 7}. That is,

𝑛* (𝑛 + 2) + 7 ∈ {10, 52, 182, 448} = {2.5, 2* × 13, 2 × 7 × 13, 2r × 7 }.

After checking these cases, we find that (𝑚, 𝑛) = (8,7) is the only solution. Thus the answer id
8.

Problem 9. Let 𝑚, 𝑛 be positive integers such that 2𝑚* + 2𝑛* = 137(𝑚 − 𝑛), find the
maximum possible value of 𝑚 + 𝑛.

Solution. Rewrite the original equation as

8𝑚* + 8𝑛* = 2.137.2(𝑚 − 𝑛) = −(137 − 2(𝑚 − 𝑛))* + 137* + 4(𝑚 − 𝑛)* .

Hence,

(137 − 2(𝑚 − 𝑛))* + (2𝑚 + 2𝑛)* = 137* .

Write 𝑥 = 137 − 2(𝑚 − 𝑛), 𝑦 = 2𝑚 + 2𝑛. Since 2𝑚* < 137𝑚 we find that 2𝑚 < 137.
Therefore 𝑥, 𝑦 > 0. Since 𝑥 * + 𝑦 * = 137* and 137 = 11* + 4* . We find that 137* =
(11* + 4* )(11* + 4* ) = 88* + 105* . Hence 𝑥 = 105, 𝑦 = 88. Therefore,

2𝑚 + 2𝑛 = 88, 137 − 2(𝑚 − 𝑛) = 105.

Thus, 𝑚 = 30, 𝑛 = 14. The answer is 44.

DL =*MD:=:L
Problem 10. Find the sum of all possible integer values of DN =:N
, when (𝑚, 𝑛) are
relatively prime positive integers.

Solution. Without loss of generality, assume 𝑚 ≤ 𝑛. Further, 𝑚5 + 𝑛5 = (𝑚 + 𝑛)(𝑚* − 𝑚𝑛 +

𝑛* ) and 𝑚* + 20𝑚𝑛 + 𝑛* = (𝑚 + 𝑛)* + 18𝑚𝑛. Thus, 𝑚 + 𝑛 divides 18𝑚𝑛. Since gcd(𝑚, 𝑛) =
1, we find that gcd(𝑚 + 𝑛, 𝑚𝑛) = 1. Therefore, 𝑚 + 𝑛 divides 18. The inequality 𝑚 + 𝑛 ≥ 2
yields to the fact that 𝑚 + 𝑛 ∈ {2, 3, 6, 9, 18}. Furthermore, the identity 𝑚* + 20𝑚𝑛 + 𝑛* =
𝑚* − 𝑚𝑛 + 𝑛* + 21𝑚𝑛 implies that 𝑚* − 𝑚𝑛 + 𝑛* divides 𝑚𝑛. But, gcd(𝑚* − 𝑚𝑛 +
𝑛* , 𝑚𝑛) = 1. That is, 𝑚* − 𝑚𝑛 + 𝑛* divides 21. Since

𝑛 3
𝑚* − 𝑚𝑛 + 𝑛* = (𝑚 − )* + 𝑛* ≤ 21.
2 4
We find that 𝑛* ≤ 28, whence 𝑛 ≤ 5. Analogously, 𝑚 ≤ 5. Thus, 𝑚 + 𝑛 ≤ 10. Thus, 𝑚 + 𝑛 ∈
{2, 3, 6, 9}. Now, we find that (𝑚, 𝑛) = (1,1), (1,2), (5,1), (4,5). Checking the divisibility
DL =*MD:=:L
condition 𝑚* − 𝑚𝑛 + 𝑛* |21 we find that all satisfies the second condition. The DN =:N
assumes following values: 11, 5, 1. The desired value is 17.

Problem 11. Let (𝑚; , 𝑛; ), … , (𝑚< , 𝑛< ) are all the integer solutions of 𝑛* = 𝑚O + 2𝑚5 +
2𝑚* + 2𝑚 + 2. Find ∑<QR; 𝑚Q* + 𝑛Q* .

Solution. If 𝑃(𝑚) = 𝑚O + 2𝑚5 + 2𝑚* + 2𝑚 + 2 then 𝑃(𝑚) = (𝑚* + 𝑚)* + 𝑚* + 2𝑚 + 2.

Thus,

𝑃(𝑚) > (𝑚* + 𝑚)* .

On the other hand,

𝑃(𝑚) = (𝑚* + 𝑚+1)* − 𝑚* + 1.

Thus, for all |𝑚| > 1, 𝑃(𝑚) < (𝑚* + 𝑚+1)* . This implies that for all 𝑚 ≠ ±1, 0, the following
inequality holds:

(𝑚* + 𝑚)* < 𝑃(𝑚) < (𝑚* + 𝑚+1)* .

Therefore, 𝑃(𝑚) is not a perfect square for all |𝑚| > 1. It only remains to check 𝑚 = ±1, 0.
That is, 𝑃(0) = 2, 𝑃(−1) = 1, 𝑃(1) = 9. Hence, our solutions are:

(𝑚, 𝑛) = (1, −3), (1, 3), (−1, 1), (−1, −1).

Therefore,
<
t 𝑚Q* + 𝑛Q* = 24.
QR;

T U V
Problem 12. Let 𝑥, 𝑦, 𝑧 be positive integers such that U + V + T = 6 and gcd(𝑧, 𝑥) = 1. Find the
maximal value of 𝑥 + 𝑦 + 𝑧.

Solution. Since gcd(𝑧, 𝑥) = 1, we deduce that gcd(𝑥, 𝑦, 𝑧) = 1. Thus, for each prime number 𝑝
there is at leat of one 𝑥, 𝑦, 𝑧 that 𝑝 doesn’t divide it. Assume that 𝑝 is an arbitrary prime that
divides 𝑥𝑦𝑧, let 𝑥 = 𝑝uv (T) 𝑎, 𝑦 = 𝑝uv (U) 𝑏 where gcd(𝑝, 𝑎𝑏) = 1. Further, assume that
gcd(𝑝, 𝑧) = 1. Now, rewrite the left side of our equation as follows

𝑥*𝑧 + 𝑧*𝑦 + 𝑦*𝑥

.
𝑥𝑦𝑧
Note that 𝑣@ (𝑥𝑦𝑧) = 𝑣@ (𝑥) + 𝑣@ (𝑦). Thus, we should have

𝑣@ (𝑥 * 𝑧 + 𝑧 * 𝑦 + 𝑦 * 𝑥) ≥ 𝑣@ (𝑥) + 𝑣@ (𝑦).

Note that 𝑣@ (𝑥 * 𝑧) = 2𝑣@ (𝑥), 𝑣@ (𝑧 * 𝑦) = 𝑣@ (𝑦), 𝑣@ (𝑦 * 𝑥) = 2𝑣@ (𝑦) + 𝑣@ (𝑥). It is easy to deduce
that if 2𝑣@ (𝑥) ≠ 𝑣@ (𝑦) then, 𝑣@ (𝑥 * 𝑧 + 𝑧 * 𝑦 + 𝑦 * 𝑥) = 𝑣@ (𝑦) or2𝑣@ (𝑥). In the former case, the
above inequality clearly fails, in the later case, we should have 𝑣@ (𝑦) > 2𝑣@ (𝑥), therefore,

𝑣@ (𝑥 * 𝑧 + 𝑧 * 𝑦 + 𝑦 * 𝑥) = 2𝑣@ (𝑥) < 𝑣@ (𝑦) < 𝑣@ (𝑥) + 𝑣@ (𝑦),

The inequality fails again. Hence, 𝑣@ (𝑦) = 2𝑣@ (𝑥). By the same argument, for each prime 𝑝 that
divides 𝑦, 𝑧 we have 2𝑣@ (𝑦) = 𝑣@ (𝑧), and 2𝑣@ (𝑧) = 𝑣@ (𝑥) for each prime 𝑝 that divides 𝑥, 𝑧.
Hence, there are positive integers 𝐴, 𝐵, 𝐶 such that 𝑥 = 𝐴* 𝐵, 𝑦 = 𝐵* 𝐶, 𝑧 = 𝐶 * 𝐴. This implies
that

𝑥 * 𝑧 + 𝑧 * 𝑦 + 𝑦 * 𝑥 𝐴5 + 𝐵5 + 𝐶 5
= = 6.
𝑥𝑦𝑧 𝐴𝐵𝐶

Since gcd(𝑥, 𝑧) = 1, we find that 𝐴 = 1, that is, 𝑥 = 𝐵, 𝑦 = 𝐵* 𝐶, 𝑧 = 𝐶 * . That is,

𝐵5 + 𝐶 5 + 1 = 6𝐵𝐶.

Thus, 𝐵5 + 𝐶 5 + 8 − 6𝐵𝐶 = 7. Hence,

(𝐵 + 𝐶 + 2)((𝐵 − 𝐶)* + (𝐵 − 2)* + (𝐶 − 2)* ) = 14.

That is, 𝐵 + 𝐶 + 2 = 7, (𝐵 − 𝐶)* + (𝐵 − 2)* + (𝐶 − 2)* = 2 = 1 + 1 + 0. Yielding to the fact

that

(𝐵, 𝐶) = (2,3), (3,2).

Hence, (𝑥, 𝑦, 𝑧) = (2, 12, 9), (3, 18,4). That is, 𝑥 + 𝑦 + 𝑧 = 23, 25.

The answer is 25.