Consider the following sum of finitely many fractions,
S = + + + + + + . . . . . . . . .
Here, a , b , c , d , e , f ,......, k are some positive integers with no prime divisor greater than 7.
If is the smallest real number which is always greater than S, then find M + N.
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.
When you think long enough, you realize that N M is nothing but ( multiply directly to convince yourself.)
( 1 1 + 2 1 + 2 2 1 + 2 3 1 + .........)( 1 1 + 3 1 + 3 2 1 + 3 3 1 + .........)( 1 1 + 5 1 + 5 2 1 + 5 3 1 + .........)( 1 1 + 7 1 + 7 2 1 + 7 3 1 + .........) = 1 2 X 2 3 X 4 5 X 6 7
= 8 3 5 .
35 + 8 = 43
By the way, the above problem is inspired by a problem from AOPS.