If and are positive integers that satisfy the equation , find the sum of all distinct values of .
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.
It's easy to see that 1 ≤ a ≤ 1 2 since for a = 1 3 the left side of the equation 2 9 a + 3 0 b + 3 1 c = 3 6 6 is greater than 3 6 6 . Using that reasoning we get that 1 ≤ b ≤ 1 2 and 1 ≤ c ≤ 1 1 . Then:
a ∈ [ 1 , 1 2 ] ⊂ Z ⇒ a = { 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , 1 0 , 1 1 , 1 2 } b ∈ [ 1 , 1 2 ] ⊂ Z ⇒ b = { 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , 1 0 , 1 1 , 1 2 } c ∈ [ 1 , 1 2 ] ⊂ Z ⇒ c = { 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , 1 0 , 1 1 }
2 9 a + 3 0 b + 3 1 c = 3 6 6 ⇒ 3 0 a − a + 3 0 b + 3 0 c + c = 3 6 6 ⇒ 3 0 ( a + b + c ) = 3 6 6 + a − c ⇒ a + b + c = 1 2 + 3 0 6 + a − c ⟹ let a − c = 3 0 k − 6 a + b + c = 1 2 + k
Now we observe that k = 0 since for either k ≥ 1 or k ≤ − 1 there are none of the given values of a , c that satisfy the equation a − c = 3 0 k − 6