Is This Even Possible?

For how many natural numbers n < 1000 n < 1000 are there, such that there exists a multiset of n n integers such that sum of n n of them is 0 0 , and the product of elements of that set is equal to n n ?

A multiset is a collection of objects where order doesn't matter (unlike a sequence) but multiplicities do matter (unlike a set). For example, { 1 , 1 , 2 , 3 } = { 2 , 1 , 3 , 1 } { 1 , 2 , 3 } \{1,1,2,3\} = \{2,1,3,1\} \neq \{1,2,3\} .


The answer is 249.

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.

1 solution

Ivan Koswara
Mar 11, 2015

I claim that all multiples of 4 4 work, and no others.

First, to see that multiples of 4 4 work, let n = 4 k n=4k . We consider two cases.

  • Case 1.1: n n is a multiple of 8 8 .

Then consider 2 k , 2 , 1 , 1 , , 1 , 1 , 1 , , 1 2k, 2, 1, 1, \ldots, 1, -1, -1, \ldots, -1 , with k 2 k-2 instances of 1 1 and 3 k 3k instances of 1 -1 . The sum is 2 k + 2 + ( k 2 ) 1 + ( 3 k ) ( 1 ) = 0 2k + 2 + (k-2) \cdot 1 + (3k) \cdot (-1) = 0 , and the product is ( 2 k ) ( 2 ) ( 1 ) k 2 ( 1 ) 3 k = 4 k (2k)(2)(1)^{k-2}(-1)^{3k} = 4k because 3 k 3k is even.

  • Case 1.2: n n is not a multiple of 8 8 .

Then consider 2 k , 2 , 1 , 1 , , 1 , 1 , 1 , , 1 2k, -2, 1, 1, \ldots, 1, -1, -1, \ldots, -1 , with k k instances of 1 1 and 3 k 2 3k-2 instances of 1 -1 . The sum is 2 k 2 + k 1 + ( 3 k 2 ) ( 1 ) = 0 2k - 2 + k \cdot 1 + (3k-2) \cdot (-1) = 0 , and the product is ( 2 k ) ( 2 ) ( 1 ) k ( 1 ) 3 k 2 = 4 k (2k)(-2)(1)^k(-1)^{3k-2} = 4k because 3 k 2 3k-2 is odd.

Now, to prove that non-multiples of 4 4 don't work, we consider two cases.

  • Case 2.1: n n is odd.

Then all of the integers must be odd (because their product is an odd number n n ). But then the sum is also odd (since there are an odd number of odd integers), so it cannot be 0 0 .

  • Case 2.2: n n is even but not a multiple of 4 4 .

Then exactly one of the integers must be even, and the rest odd (because there is exactly one instance of the factor 2 2 ). But then the sum is odd (since there is n 1 n-1 odd integers, and n 1 n-1 is odd), so it cannot be 0 0 .


This shows that all multiples of 4 4 work and no other. There are 249 \boxed{249} multiples of 4 4 below 1000 1000 .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...