Given three positive integers a , b , and c ,
Fill in the blank.
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.
Since a + c b is a positive integer, then c b is an positive integer, meaning b must be a multiple of c . Similarly, since c a + b is a positive integer, then a must also be a multiple of c ; we can rewrite a and b as A c and B c respectively, for some positive integers A and B .
Ergo, a + c b = 1 0 1 becomes A c + B = 1 0 1 and c a + b = 6 8 becomes A + B c = 6 8 . Adding these new equations gives us A c + B + A + B c = 1 6 9 or A ( c + 1 ) + B ( c + 1 ) = 1 6 9 , and so ( A + B ) ( c + 1 ) = 1 6 9 , meaning c + 1 must be a factor of 1 6 9 .
1 6 9 = 1 3 2 , and therefore has positive divisors 1 , 1 3 , and 1 6 9 . Since A , B , and c are positive integers, A + B ≥ 2 and c + 1 ≥ 2 . Neither A + B nor c + 1 can equal 1 , meaning A + B = c + 1 = 1 3 .
Finally, c a + b = c A c + B c = A + B = 1 3 , and so, k = 1 3 .
Proving integers a , b , c exist
We have
⎩ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎧ a + c b = 1 0 1 c a + b = 6 8 c a + b = 1 3 ⋯ ( 1 ) ⋯ ( 2 ) ⋯ ( 3 )
( 1 ) + ( 2 ) : a + b + c a + b = 1 6 9
a + b + 1 3 = 1 6 9 ⇒ a + b = 1 5 6 ⋯ ( 4 )
Substituting ( 4 ) into ( 3 ) : c 1 5 6 = 1 3
⇒ c = 1 2
( 4 ) : a + b = 1 5 6 ⇒ a = 1 5 6 − b
Substituting the above into ( 1 ) : 1 5 6 − b + 1 2 b = 1 0 1
⇒ b = 6 0
Substituting b = 6 0 into ( 2 ) we get: 1 2 a + 6 0 = 6 8
⇒ a = 9 6
Thus a = 9 6 , b = 6 0 , and c = 1 2 .
For completeness, do such integers exist? Otherwise, the question would be meaningless.
Log in to reply
Yes, such integers do exist. They are: c = 1 2 , b = 6 0 , a = 9 6
Log in to reply
Great. Interestingly, if we relax the constraint to just "integers", we get another solution set (with a different value of c a + b .
Log in to reply
@Calvin Lin – That's interesting. Can you share with me some of those values?
Log in to reply
@Majed Kalaoun – Look at Chew's solution to determine possible values of c which are negative. Do you see how new solutions arise?
Thanks for this interesting problem.
I wouldn't say that this problem is "More Logic than Algebra". This problem is actually Number Theory
Log in to reply
Thanks. I think it involves a mixture of Number Theory, Algebra, and some Logic. I would say it's algebra though.
Log in to reply
Logic is the formal study of arguments.
I think what you mean is that this problems requires some non-mechanical problem solving, which is true.
Let a = cx and b = cy.
cx + y = 101
cy + x = 68
(c + 1)(y + x) = 13^2
(x + y) can't equal 1, which means c = 12 and x + y = 13.
(a + b)/c = x + y = 13
a = 96, b = 60
Add the first two expressions to get c a c + b + c a c + b = 1 6 9
Combine and factor to get c ( a + b ) ( 1 + c ) = 1 6 9
Since both factors are integers and 169= 1 3 2 it follows that
c ( a + b ) = 1 3 and 1 + c = 1 3 is the only possible solution in integers.
The equations are satisfied by a = 96, b = 60, c = 12.
Problem Loading...
Note Loading...
Set Loading...
⎩ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎧ a + c b = 1 0 1 c a + b = 6 8 c a + b = k . . . ( 1 ) . . . ( 2 ) . . . ( 3 )
( 1 ) + ( 2 ) : a + b + c a + b ( a + b ) ( 1 + c 1 ) a + b = 1 0 1 + 6 8 = 1 6 9 = c + 1 1 3 2 c
Since the LHS is a positive integer, the RHS must also be an positive integer. This means that for c ≥ 1 , c + 1 can only be either 13 or 1 3 2 . But if c + 1 = 1 3 2 , then c = 1 6 8 and a + b = 1 6 8 , ⟹ a , b < c , then for ( 1 ) : a + c b = 1 0 1 , a and b are not integers. Therefore, c + 1 = 1 3 , then a + b = 1 3 c , ⟹ k = c a + b = 1 3 .