# Thread:

1. ## Show that all of these numbers are zero

Suppose you have $2n$ numbers $(n > 1)$ which have the following property : whenever you remove one of them (any one), you can split the remaining ones into two sets having equal sum.

Show that all of these numbers are zero.

2. Originally Posted by Bruno J.
Suppose you have $2n-1$ numbers $(n > 1)$ which have the following property : whenever you remove one of them (any one), you can split the remaining ones into two sets having equal sum.

Show that all of these numbers are zero.
by "zero" did you mean "equal"? also, each of those two sets with equal sum must have exactly $n-1$ elements. otherwise, the claim would be false.

3. Oh, yeah. I'm sorry! I made a mistake in the statement of the problem! I have fixed my post.

4. Originally Posted by Bruno J.
Suppose you have $2n$ numbers $(n > 1)$ which have the following property : whenever you remove one of them (any one), you can split the remaining ones into two sets having equal sum.

Show that all of these numbers are zero.
a weaker property: whenever you remove one of them (any one), either the sum of the remaining ones is zero or you can split the remaining ones into two sets having equal sum.

this problem is equivalen to this claim that the $2n \times 2n$ matrix $A=[a_{ij}]$ with $a_{ii}=0, \ a_{ij}=\pm 1, \ \forall i \neq j,$ is invertible. to prove this claim we'll show that $\det A \neq 0$:

$\det A = \sum_{\sigma \in S_{2n}} \text{sign}(\sigma) \prod_{i=1}^{2n} a_{i \sigma(i)}=\sum_{\sigma \in D} \text{sign}(\sigma) \prod_{i=1}^{2n} a_{i \sigma(i)},$ where $D = \{\sigma \in S_{2n}: \ \ \sigma(i) \neq i, \ \forall i \},$ because we're given that $a_{ii}=0.$ so $D$ is the set of derangements of $\{1,2, \cdots , 2n \}.$

but we know that the number of derangements of a set with even number of elements is odd. so $\det A$ is a sum of odd number of terms where each term is $\pm 1.$ clearly this sum can

never be zero and hence $A$ is invertible. Q.E.D.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 19, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9565723538398743, "perplexity_flag": "head"}