We can express 9 positive single-digit numbers of the product 9 ! = 3 6 2 8 8 0 and the sum 4 5 in at least two distinct ways. Following the factorial, 1 + 2 + 3 + 4 + 5 + 6 + 7 + 8 + 9 1 × 2 × 3 × 4 × 5 × 6 × 7 × 8 × 9 = 4 5 = 9 ! Another way to express the sum and the product with some distinct numbers is 1 + 2 + 4 + 4 + 4 + 5 + 7 + 9 + 9 1 × 2 × 4 × 4 × 4 × 5 × 7 × 9 × 9 = 4 5 = 9 ! Can we also express 8 positive single-digit numbers of the product 8 ! and the sum 3 6 in the similar manner?
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.
Without loss of generality, we can keep 5 and 7 since they are both guaranteed to be single-digit primes that can't be multiplied to be distinct single-digit integers.
Problem Loading...
Note Loading...
Set Loading...
By prime factorisation we find :
8! = 1 × 2^7 × 3^2 × 5 × 7
So let's start our calcul with :
1 + 5 + 7
Because if any of these integers is multiplied by any other, the result is at least a 2 digit number (except for "1" but if i'm correct, it has to stay as "1" and can't be removed)
Then, 36 is even, thus we know that 3^2 has to be as 9 in our calcul (not 6 and 6), else the sum can't be even. So we get :
1 + 5 + 7 + 9
Then there only stay 2^7 which has to be decompsed into four 1 digit numbers. So we can first try :
1 + 5 + 7 + 9 + 2 + 2 + 4 + 8 = 38
Then we just have to adjust a little bit to finally get :
1 + 5 + 7 + 9 + 2 + 4 + 4 + 4 = 36
1 × 5 × 7 × 9 × 2 × 4 × 4 × 4 = 8!