Let x , y and z be distinct positive integers satisfying
x 1 + y 1 + z 1 = 1 0 9 .
Find the value of x + y + z .
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.
Consider 3 1 + 4 1 + 5 1 = 6 0 4 7 < 6 0 5 4 = 1 0 9 .
This shows that 2 1 must be one of the terms. without the loss of generality (WLOG), x = 2 .
We know have y 1 + z 1 = 5 2 . It would be nice to simply have y = z = 5 , but they have to be distinct.
So, we need to find the answer to the question 5 2 = 5 c ( a + b ) where ( a + b ) = 2 c , c is a constant, and a ∣ 5 c and b ∣ 5 c . So we need a multiple of 2 who can be written as the sum of the same multiple of 5 . We know c > 2 since 2 × 2 = 4 < 5 . Using trial and error we try c = 3 and find that 2 × 3 = 6 = 5 + 1 and 5 c = 5 × 3 = 1 5 which 5 ∣ 1 5 and 1 ∣ 1 5 .
So are two fractions are 1 5 1 and 1 5 5 = 3 1 implying y = 3 and z = 1 5 .
Then x + y + z = 2 + 3 + 1 5 = 2 0
P.S. Please post a solution that doesn't use trial and error, I kind of just stumbled upon using 3 1 and figured out that 1 5 1 would fill in the void.
We can rewrite y 1 + z 1 = 5 2 as ( 2 y − 5 ) ( 2 z − 5 ) = 2 5 . As we want y = z we can then set 2 y − 5 = 1 , 2 z − 5 = 2 5 ⟹ y = 3 , z = 1 5 .
Log in to reply
Or, we can also use the identity a 1 = a + 1 1 + a ( a + 1 ) 1 . So 5 1 = 6 1 + 3 0 1 → 5 2 = 3 1 + 1 5 1 .
why does 2 1 must be one of the terms?
Log in to reply
If 2 1 is excluded, then, since x , y , z must be distinct, the maximum possible value of x 1 + y 1 + z 1 is 3 1 + 4 1 + 5 1 = 6 0 4 7 . As this is less than 1 0 9 we can conclude that 2 1 must be one of the fractions included in the sum.
Your argument that "need a multiple of 2 such that..."is abit misleading since at the end of the day, you have one of them is 1. We know a+b must be greater than 5. But either a or b need not be greater than 5.
We can write given equation as x 1 + y 1 + z 1 + 1 0 1 = 1 1 Using Fibonacci's identity regarding Egyptian fractions 1 1 = 2 1 + 2 1 , so maybe x = 2 . Which gives y 1 + z 1 + 1 0 1 = 2 1 Again 2 1 = 3 1 + 6 1 , so maybe y = 3 . Which gives z 1 + 1 0 1 = 6 1 Hmm, 6 1 − 1 0 1 = ? BINGO! z = 1 5 I don't know whether this method gives guaranteed solution or if this is just another trial and error method.
Desenvolvendo,
x 1 + y 1 + z 1 = 1 0 9 x y z x y + x z + y z = 1 0 9
Desse modo, temos que: ∃ k ∈ Z tal que x y z x y + x z + y z = 1 0 k 9 k .
Com efeito, obtemos { x y + x z + y z = 9 k ( i ) x ⋅ y ⋅ z = 1 0 k ( i i ) .
De ( i i ) , x ⋅ y ⋅ z = 2 ⋅ 5 ⋅ k . Portanto, sem perda de generalidade, x = 2 , y = 5 e z = k ; substituindo em ( i ) ,
x y + x z + y z = 9 k 2 ⋅ 5 + 2 ⋅ k + 5 ⋅ k = 9 k 1 0 = 9 k − 7 k k = 5
Mas, de acordo com o enunciado, x, y e z são inteiros distintos. Ou seja, z = 5 . Então,
x 1 + y 1 + z 1 = 2 1 + 5 1 + 5 1 = 2 1 + 5 × 3 2 × 3 = 2 1 + 1 5 6 =
2 1 + ( 1 5 5 + 1 5 1 ) = 2 1 + 3 1 + 1 5 1
Logo,
x + y + z = 2 + 3 + 1 5 x + y + z = 2 0
Best solution.
1/x+1/y+1/z=9/10
Therefore, gcd(x,y,z) is a multiple of 10, like 10,20 or 30.
hence 9/10=18/20=27/30=d/n.
and x,y,z must divide the denominator,like 10 or 20 or 30.
d/x+d/y+d/z=n
Now only 2 and 5 divide 10. Thus it has no solution.
2,4,5,10 divide 20. it also does not have any solution.
2,3,4,5,6,10,15 divide 30.
30/2+30/3+30/15=15+10+2=27
This gives 1/2+1/3+1/15=27/30=9/10
Well, you need to just check the first few cases.
Problem Loading...
Note Loading...
Set Loading...
Positive rational numbers can always be written as Egyptian fractions using the so-called Greedy Algorithm. Simply stated, this says that, at each stage, pick the largest possible reciprocal. Proving that the algorithm works is a simple matter of induction (and using the divergence of the harmonic series to handle rationals greater than 1 ).
In this case,
The answer is 2 + 3 + 1 5 = 2 0 .