For how many natural numbers are there, such that there exists a multiset of integers such that sum of of them is , and the product of elements of that set is equal to ?
A multiset is a collection of objects where order doesn't matter (unlike a sequence) but multiplicities do matter (unlike a set). For example, .
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.
I claim that all multiples of 4 work, and no others.
First, to see that multiples of 4 work, let n = 4 k . We consider two cases.
Then consider 2 k , 2 , 1 , 1 , … , 1 , − 1 , − 1 , … , − 1 , with k − 2 instances of 1 and 3 k instances of − 1 . The sum is 2 k + 2 + ( k − 2 ) ⋅ 1 + ( 3 k ) ⋅ ( − 1 ) = 0 , and the product is ( 2 k ) ( 2 ) ( 1 ) k − 2 ( − 1 ) 3 k = 4 k because 3 k is even.
Then consider 2 k , − 2 , 1 , 1 , … , 1 , − 1 , − 1 , … , − 1 , with k instances of 1 and 3 k − 2 instances of − 1 . The sum is 2 k − 2 + k ⋅ 1 + ( 3 k − 2 ) ⋅ ( − 1 ) = 0 , and the product is ( 2 k ) ( − 2 ) ( 1 ) k ( − 1 ) 3 k − 2 = 4 k because 3 k − 2 is odd.
Now, to prove that non-multiples of 4 don't work, we consider two cases.
Then all of the integers must be odd (because their product is an odd number n ). But then the sum is also odd (since there are an odd number of odd integers), so it cannot be 0 .
Then exactly one of the integers must be even, and the rest odd (because there is exactly one instance of the factor 2 ). But then the sum is odd (since there is n − 1 odd integers, and n − 1 is odd), so it cannot be 0 .
This shows that all multiples of 4 work and no other. There are 2 4 9 multiples of 4 below 1 0 0 0 .