If a , b > 1 are integers satisfying 1 1 ( a − 1 ) = 1 3 ( b − 1 ) , find the minimum value of a + b .
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.
Great work! I would have phrased it this way:
Let c = 1 1 ( a − 1 ) = 1 3 ( b − 1 ) , then c must be a multiple of 11 and 13. Since we want to minimize a , b > 1 , then this suggests that should minimize c as well. the minimum value of c must be a multiple of 11 and 13. So a possible value of c is 1 1 × 1 3 = 1 4 3 . Hence, 1 4 3 = 1 1 ( a − 1 ) = 1 3 ( b − 1 ) ⇒ a = 1 1 1 4 3 + 1 = 1 4 , b = 1 3 1 4 3 + 1 = 1 2 . The result follows.
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Greatest Common Divisor
g cd ( 1 1 , 1 3 ) = 1 . 1 3 divides L.H.S and 1 1 divides R.H.S
a , b must be of the form 1 3 n + 1 and 1 1 m + 1 respectively where n , m are integers.
As a , b > 1 the minimum value of a and b occurs when n , m = 1 or a = 1 4 and b = 1 2 .
Hence minimum value of a + b = 1 4 + 1 2 = 2 6 .