How many distinct possible ways are there to express 1 0 0 0 as the sum of all positive integers in decreasing order (but not strictly), using only 8 's?
Assumption: The sum can include terms that concatenate more than one 8 . For instance, 8 8 , 8 8 8 and 8 8 8 8 .
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.
List of all possible ways to represent 1 0 0 0 using only 8 's :
1 0 0 0 = 125 8 + ⋯ + 8 = 1 8 8 + 114 8 + ⋯ + 8 = 2 8 8 + 8 8 + 103 8 + ⋯ + 8 = 3 8 8 + ⋯ + 8 8 + 92 8 + ⋯ + 8 = 4 8 8 + ⋯ + 8 8 + 81 8 + ⋯ + 8 = 5 8 8 + ⋯ + 8 8 + 70 8 + ⋯ + 8 = 6 8 8 + ⋯ + 8 8 + 59 8 + ⋯ + 8 = 7 8 8 + ⋯ + 8 8 + 48 8 + ⋯ + 8 = 8 8 8 + ⋯ + 8 8 + 37 8 + ⋯ + 8 = 9 8 8 + ⋯ + 8 8 + 26 8 + ⋯ + 8 = 10 8 8 + ⋯ + 8 8 + 15 8 + ⋯ + 8 = 11 8 8 + ⋯ + 8 8 + 4 8 + ⋯ + 8 = 1 8 8 8 + 14 8 + ⋯ + 8 = 1 8 8 8 + 1 8 8 + 3 8 + ⋯ + 8
Problem Loading...
Note Loading...
Set Loading...
We need to represent 1 0 0 0 as the sum of positive integers that only contain 8 in their decimal expansion. This is equivalent to finding the number of non-negative integer solutions to the equation, 8 8 8 x + 8 8 y + 8 z = 1 0 0 0 ⇔ 1 1 1 x + 1 1 y + z = 1 2 5 Since x , y , z ≥ 0 , x ≤ ⌊ 1 1 1 1 2 5 ⌋ y ≤ ⌊ 1 1 1 2 5 ⌋ z ≤ ⌊ 1 1 2 5 ⌋ ⟹ x ∈ { 0 , 1 } ⟹ y ∈ { 0 , 1 , 2 , ⋯ , 1 0 , 1 1 } ⟹ z ∈ { 0 , 1 , 2 , ⋯ , 1 2 4 , 1 2 5 } Case 1: x = 0 ⟹ 1 1 y + z = 1 2 5
Note, z = 1 2 5 − 1 1 y is a non-negative integer for all y ∈ { 0 , 1 , 2 , ⋯ , 1 0 , 1 1 } . Hence, this case leads to 1 2 possible solutions.
Case 2: x = 1 ⟹ 1 1 y + z = 1 4
Note, z = 1 2 − 1 1 y is a non-negative integer for all y ∈ { 0 , 1 } . Hence, this case leads to 2 possible solutions.
Therefore, there are 1 2 + 2 = 1 4 possible solutions to the given equation.