Positive integers a , b , and c , where 0 < a < 1 0 0 and 0 < b < 1 0 0 , are such that
a a + b = c 3
What is the largest value of a + b + c ?
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, systematic deduction! Upvoted!
The fraction a a + b can be rewritten as 1 + a b . Meaning, a b is equal to c 3 − 1 . The highest possible value for a b if both variables are positive integers less than 1 0 0 is 1 9 9 . Thus we must find cubes less than 1 0 0 and subtract them by 1 .
1 3 2 3 3 3 4 3 = = = = 1 8 2 7 6 4 ⟹ ⟹ ⟹ ⟹ 0 7 2 6 6 3
If c 3 − 1 is 0 , the solutions will be n 0 = 0 (with n being any number satisfying the mentioned conditions). But b > 0 , thus the cube cannot be 1 .
We then need to list the divisors and dividends of the quotient c 3 − 1 .
7 2 7 6 3 ⟹ ⟹ ⟹ 1 7 , 2 1 4 , 3 2 1 , … , 1 3 9 1 , 1 4 9 8 1 2 7 , 2 5 4 , 3 8 1 1 6 3
We see that the largest pair of divisor and dividend is 1 4 9 8 .
a a + b = 1 4 1 4 + 9 8 = c 3 2 3 ⟹ a + b + c = 1 4 + 9 8 + 2 = 1 1 4
It's a Nice Problem @Kaizen Cyrus
Given a, b, c are positive integers 0 < a , b < 1 0 0 ,
a a + b = c 3 ⇒ 1 + a b = c 3 ⇒ b = n a for some postive integer min ( a b ) = 1 ≤ n ≤ max ( a b ) = 9 9 a ( 1 + n ) a = c 3 ⇒ c 3 ≤ 1 0 0 ⇒ c = 2 , 3 , 4
As b = n a < 1 0 0 , c ∈ [ 2 , 4 ] , c ↓ ⇒ n ↓ ⇒ a ↑ ⇒ b ↑ = n a ,
To maximize a + b + c we choose smallest c
c = 2 , n = 7 , b = n a = 7 a < 1 0 0 ⇒ max ( a ) max ( b ) max ( a + b + c ) = 1 4 = 9 8 = 1 4 + 9 8 + 2 = 1 1 4
Problem Loading...
Note Loading...
Set Loading...
Given that a a + b = c 3 , ⟹ 1 + a b = c 3 . Since the smallest a b = 1 1 = 1 and the largest a b = 1 9 9 = 9 9 , then 2 < c 3 < 1 0 0 ⟹ 2 ≤ c ≤ 4 .
From 1 + a b = c 3 ⟹ b = a ( c 3 − 1 ) . Then a + b + c = a + a ( c 3 − 1 ) + c = a c 3 + c . This means that for a particular value of c , the largest a + b + c is the one with the largest a . In formula, we have max ( a + b + c ) = a max c 3 + c . And a max = ⌊ c 3 − 1 9 9 ⌋ , where ⌊ ⋅ ⌋ denotes the floor function .
Then we have:
c = 2 0 c = 3 0 c = 4 ⟹ a max = ⌊ 2 3 − 1 9 9 ⌋ = 1 4 ⟹ a max = ⌊ 3 3 − 1 9 9 ⌋ = 3 ⟹ a max = ⌊ 4 3 − 1 9 9 ⌋ = 1 ⟹ max ( a + b + c ) = 1 4 ( 8 ) + 2 = 1 1 4 ⟹ max ( a + b + c ) = 3 ( 2 7 ) + 3 = 8 4 ⟹ max ( a + b + c ) = 1 ( 6 4 ) + 4 = 6 8
Therefore the largest value of a + b + c = 1 1 4 .