9 distinct positive integers are given, such that the sum of their reciprocals is equal to 1 . If 5 of these integers are 3 , 7 , 9 , 1 1 and 3 3 , and the other 4 integers all have a units digit of 5 , what is the sum of these 9 integers?
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.
After removing the first five fractions, you are left with 202/693. If you skip 5 and use 15,25,35, and 45 (and their corresponding fractions) you don't get high enough. So 5 (and its fraction 1/5) must be included. Similarly, by taking out 1/5, you find that 15 (and its fraction 1/15) must be included as well. You are left with 86/3465. From there you see that 1/45 is the next highest fraction that is possible. Solving the equation gives 385 for the final number. My solution is admittedly inelegant...I would love to see an elegant one!
There are five (5) given and four (4) unknown integers. It is said that the sum of their reciprocals is 1. This means that if you have to add these fractions, the least common multiple of the denominators should be equal to its resulting numerator.
The LCM of the 5 given integers is 693. Since the 4 unknown integers all have 5 as its units digit, then these integers are sure to be multiples of 5. This follows that the working LCM to be used is 693*5 which is equal to 3465.
3 1 + 7 1 + 9 1 + 1 1 1 + 3 3 1 + 5 a 1 + 5 b 1 + 5 c 1 + 5 d 1 = 3 4 6 5 3 4 6 5 where a, b, c, d are distinct integers.
By solving, 1 1 5 5 + 4 9 5 + 3 8 5 + 3 1 5 + 1 0 5 + a 6 9 3 + b 6 9 3 + c 6 9 3 + d 6 9 3 = 3 4 6 5
a 6 9 3 + b 6 9 3 + c 6 9 3 + d 6 9 3 = 1 0 1 0
Given that 6 9 3 = 3 2 ∗ 7 ∗ 1 1 , the possible values of a, b, c, d are 1 , 3 , 7 , 9 , 1 1 , 2 1 , 3 3 , 6 3 , 7 7 , 9 9 , 2 3 1 , … a n d a l l p o s s i b l e m u l t i p l i c a t i o n p a i r i n g s o f t h e f a c t o r s to make each of the remaining fractions integer. Since the expected sum of these four fractions (see the simplified equation above) is 1010 then the values of a, b, c, d to be considered are 1 , 3 , 9 , 7 7 in any assignments. Note: Since 1010 is the aimed sum, then most of the four needed values (a, b, c, d) must be minimal to reach this sum.
Therefore, 3 + 7 + 9 + 1 1 + 3 3 + 5 a + 5 b + 5 c + 5 d = 6 3 + 5 ( 1 ) + 5 ( 3 ) + 5 ( 9 ) + 5 ( 7 7 ) = ∗ ∗ 5 1 3 ∗ ∗ .
Since we have the number ending with 5 Sum of 1/3 + 1/7 + 1/9 + 1/11+ 1/33 = 491/693 Which is approx .7 We are left with .3 Without 1/5 and 1/15 we cannot reach .3 as 1/25 is just .04 and then the values keep diminishing Therefore 1/5 + 1/15 + 491/693 = 3379/3465 so we are left with 86/3465 The only way we can split 3465/5 = 693 to get 86 is 77 and 9 Thus the last 2 numbers are 77*5 = 385 and 9 * 5 = 45
Therefore overall total = 3 + 7 + 9 + 11 + 33 + 5 + 15 + 45 + 385 = 513
Firstly, 3 1 + 7 1 + 9 1 + 1 1 1 + 3 3 1 = 6 9 3 4 9 1 . Therefore, the reciprocals of the other 4 integers add up to 6 9 3 2 0 3 . Because we know that the units digit of all 4 of these numbers is 5, we can express the sum of their reciprocals as \frac{1}{10a+5} + \frac{1}{10b+5} + \frac{1}{10c+5} + \frac{1]{10d+5} = \frac{202}{693} . Multiplying by a 5 on both sides gives us \frac{1}{2a+1}+\frac{1}{2b+1}+\frac{1}{2c+1}+\frac{1]{2d+1} = \frac{1010}{693} . Next, factor 6 9 3 into 3 2 × 7 × 1 1 . We want to find 4 numbers n 1 , n 2 , n 3 , n 4 that multiply to 6 9 3 k and that satisfy the identity n 1 × n 2 × n 3 + n 2 × n 3 × n 4 + n 1 × n 2 × n 4 + n 1 × n 3 × n 4 = 1 0 1 0 k ( e x p r e s s i o n 1 ) , where k is an even integer. While k = 1 , The possible choices for the four numbers are ( 3 , 3 , 7 , 1 1 ) , ( 1 , 3 , 3 , 7 7 ) , ( 1 , 3 , 1 1 , 2 1 ) , ( 1 , 3 , 7 , 3 3 ) etc... The more stratified the four numbers are, the larger expression will be because the larger numbers will be contained in 3 / 4 of the terms. 1 , 3 , 1 1 , 2 1 yields a value of 1020, while 1 , 3 , 7 , 3 3 and 1 , 9 , 7 , 1 1 , the closest to 1 , 3 , 1 1 , 2 1 in terms of "stratification," give us values of 1 0 4 4 and 9 3 2 respectively. This means that for k = 1 , there are no sets of n 1 , n 2 , n 3 , n 4 that give a value of 1010 for expression1. Now lets examine k = 3 . Then the four numbers have to multiply to 2 0 7 9 and expression1= 3 0 3 0 . Some experimenting gives us the four numbers 1 , 3 , 9 , 7 7 , which satisfy expression1. Therefore, the four remaining numbers are 5 , 1 5 , 4 5 , and 3 8 5 . This gives us a total sum of 5 1 3 .
Motivation : Because all the numerators of the fractions are 1 , Egyptian fraction is a valid approach.
Let the other 4 integers be 5 a , 5 b , 5 c , 5 d for positive integers a < b < c < d , then
1 − ( 3 1 + 7 1 + 9 1 + 1 1 1 + 3 3 1 ) 6 9 3 2 0 2 6 9 3 1 0 1 0 1 + 6 9 3 3 1 7 6 9 3 3 1 7 ⌈ 3 1 7 6 9 3 ⌉ 1 + 6 9 3 ⌈ 3 1 7 6 9 3 ⌉ − 6 9 3 m o d 3 1 7 3 1 + 2 0 7 9 2 5 8 2 0 7 9 2 5 8 9 1 + 7 7 1 = = = = = = = = = 5 a 1 − 5 b 1 − 5 c 1 − 5 d 1 5 a 1 + 5 b 1 + 5 c 1 + 5 d 1 a 1 + b 1 + c 1 + d 1 a 1 + b 1 + c 1 + d 1 ⇒ a = 1 b 1 + c 1 + d 1 b 1 + c 1 + d 1 b 1 + c 1 + d 1 ⇒ b = 3 c 1 + d 1 c 1 + d 1 ⇒ c = 9 , d = 7 7
Hence, the answer is 3 + 7 + 9 + 1 1 + 3 3 + 5 ( 1 ) + 5 ( 3 ) + 5 ( 9 ) + 5 ( 7 7 ) = 5 1 3
What's the motivation for the line that contains ⌈ 3 1 7 6 9 3 ⌉ 1
Log in to reply
y x = ⌈ x y ⌉ 1 + y ⌈ x y ⌉ − y m o d x
what is the meaning of mod ?? Cause Im in grade 7 and i dont know whats that ,,, thank you ..
Log in to reply
Remainder. If we want to find y m o d x , it means we want to find the remainder of y when divided by x . For example, 1 0 m o d 3 = 1 , 2 0 m o d 1 1 = 9 , 1 0 0 m o d 1 2 = 4 , 7 m o d 1 3 = 7 , 1 0 0 0 0 m o d 2 0 0 = 0
Let's start with summing the reciprocals of 3, 7, 9, 11 and 33, and subtract it from 1.
1 − ( 3 1 + 7 1 + 9 1 + 1 1 1 + 3 3 1 ) = 6 9 3 2 0 2
The remaining 4 numbers are multiples of 5, let's call them 5a, 5b, 5c and 5d (with a, b, c and d odd numbers).
5 a 1 + 5 b 1 + 5 c 1 + 5 d 1 = 6 9 3 2 0 2 → a 1 + b 1 + c 1 + d 1 = 6 9 3 1 0 1 0
If we factorize 693, we get 693 = 1 ∗ 3 ∗ 3 ∗ 7 ∗ 11.
Using a < b < c < d, the first trials are a=1and b=3:
c 1 + d 1 = 6 9 3 1 0 1 0 − 1 1 − 3 1 = 6 9 3 1 0 1 0 − 6 9 3 6 9 3 − 6 9 3 2 3 1 = 6 9 3 1 0 1 0 − 9 2 4 = 6 9 3 8 6 < 7 1
So the next value in line is c=3 ∗ 3=9, which makes the remaining equation:
d 1 = 6 9 3 8 6 − 9 1 = 6 9 3 8 6 − 6 9 3 7 7 = 6 9 3 9 = 7 7 1
We now have the last four numbers: 5a, 5b, 5c and 5d → 5, 15, 45 and 385.
If we sum all 9 numbers, the result is:
3 + 7 + 9 + 1 1 + 3 3 + 5 + 1 5 + 4 5 + 3 8 5 = 5 1 3
Very nice logical better than our approach.
I don't know how to solve this problem algebraically, but I did solve it using some logic and trial-and-error. First, it is given that \begin{align} \frac{1}{3} + \frac{1}{7} + \frac{1}{9} + \frac{1}{11} + \frac{1}{33} + \frac{1}{a} + \frac{1}{b} + \frac{1}{c} + \frac{1}{d} = 1 \end{align} where a, b, c, and d are integers with 5 in the units place.
We first note that \begin{align} a = 5 \end{align} because if it did not equal 5, it would be impossible for the terms to sum to 1. The greatest sum without a = 5 is \begin{align} \frac{1}{3} + \frac{1}{7} + \frac{1}{9} + \frac{1}{11} + \frac{1}{33} + \frac{1}{15} + \frac{1}{25} + \frac{1}{35} + \frac{1}{45} = \frac{1667}{1925} < 1 \end{align}
We can continue by using the "greedy" algorithm, where we add the largest possible unit fraction that we can which keeps the sum below 1.
Note that \begin{align} \frac{1}{3} + \frac{1}{7} + \frac{1}{9} + \frac{1}{11} + \frac{1}{33} + \frac{1}{5} + \frac{1}{15} = \frac{3379}{3465} < 1 \end{align}
so we can set \begin{align} b = 15 \end{align}
Continuing, the next largest unit fraction that we can add is \begin{align} \frac{1}{45} \end{align}
so \begin{align} c = 45 \end{align}
Finally, we see that \begin{align} \frac{1}{3} + \frac{1}{7} + \frac{1}{9} + \frac{1}{11} + \frac{1}{33} + \frac{1}{5} + \frac{1}{15} + \frac{1}{45} = \frac{384}{385} \end{align}
so \begin{align} d = 385 \end{align}
Thus, \begin{align} 3 + 7 + 9 + 11 + 33 + a + b + c + d =\\ 3 + 7 + 9 + 11 + 33 + 5 + 15 + 45 + 385 = \boxed{513} \end{align}
That was also my approach.
1/3 +1/7 +1/9 +1/11 +1/33 =491/693 So,sum of other reciprocals will be 202/693 Now,all other 4 integers have 5 as unit digit. So, I multiplied both numerator and denominator by 5. So, I got 10140/3465 which is more than largest possible reciprocal 1/5. I took 5 as one of the 9 numbers. In this way I took 15 and 45 into my account. Atlast I got 9/3465 which is equal to 1/385. So, I got 385 the last number. Added all 9 numbers and got the result.
Let the numbers be x 1 , x 2 , x 3 , x 4 , 3 , 7 , 9 , 1 1 , 3 3 . Then we have
x 1 1 + x 2 1 + x 3 1 + x 4 1 = 6 9 3 2 0 2
We are given that x 1 ≡ x 2 ≡ x 3 ≡ x 4 ( m o d 5 ) , so let x i = 5 y i for i = 1 , 2 , 3 , 4 . Then we get
y 1 1 + y 2 1 + y 3 1 + y 4 1 = 6 9 3 1 0 1 0
and y 1 , y 2 , y 3 , y 4 are odd. WLOG y 1 < y 2 < y 3 < y 4 . Note that
3 1 + 5 1 + 7 1 + 9 1 < 6 9 3 1 0 1 0
and so y 1 = 1 . By a similar bounding argument, y 2 = 3 . Thus
6 9 3 8 6 = y 3 1 + y 4 1
⟹ 8 6 y 3 y 4 = 6 9 3 ( y 3 + y 4 )
Note that 6 9 3 = 3 2 ⋅ 7 ⋅ 1 1 . Since 6 9 3 ∣ y 3 y 4 and 8 6 ∣ y 3 + y 4 , it is easy to find y 3 = 9 and y 4 = 7 7 . Adding the numbers gives 5 1 3 .
Problem Loading...
Note Loading...
Set Loading...
First of all, the sum of the reciprocals of the 4 unknown integers is 1 − 3 1 − 7 1 − 9 1 − 1 1 1 − 3 3 1 = 6 9 3 2 0 2 . We let 5 a 1 + 5 b 1 + 5 c 1 + 5 d 1 = 6 9 3 2 0 2 , where a > b > c > d are odd integers. Then a 1 + b 1 + c 1 + d 1 = 6 9 3 1 0 1 0
If d = 1 , the left hand side would be not greater than 3 1 + 5 1 + 7 1 + 9 1 = 3 1 5 2 4 8 . But 3 1 5 2 4 8 < 1 < 6 9 3 1 0 1 0 , which is a contradiction. Hence, d = 1 and a 1 + b 1 + c 1 = 6 9 3 3 1 7 .
Similarly, if c = 3 , the left hand side would be not greater than 5 1 + 7 1 + 9 1 = 3 1 5 7 1 . But 3 1 5 7 1 < 6 9 3 3 1 7 , which is a contradiction. Hence, c = 3 and a 1 + b 1 = 6 9 3 8 6 .
This gives 6 9 3 ( a + b ) = 8 6 a b ⇒ 6 9 3 ⋅ 8 6 ( a + b ) = 8 6 2 a b ⇒ ( 8 6 a − 6 9 3 ) ( 8 6 b − 6 9 3 ) = 6 9 3 2 = 3 4 ⋅ 7 2 ⋅ 1 1 2 . Since 8 6 a − 6 9 3 > 8 6 b − 6 9 3 ⇒ 8 6 b − 6 9 3 ≤ 6 9 3 .Thus 0 < b < 1 7 . A quick test shows that only when b = 9 gives that 8 6 b − 6 9 3 = 8 1 is a factor of 6 9 3 2 . Thus b = 9 , a = 7 7 . As a result, we have a = 7 7 , b = 9 , c = 3 , d = 1 . Thus the nine integers are 3 , 5 , 7 , 9 , 1 1 , 1 5 , 3 3 , 4 5 , 3 8 5 , and 3 + 5 + 7 + 9 + 1 1 + 1 5 + 3 3 + 4 5 + 3 8 5 = 5 1 3 .