Integer Parities Generalization

If x 1 , x 2 , , x n x_1, x_2, \dots, x_n are integers, and the system of linear equations consists of all ( n k ) \binom{n}{k} possible sums of k k variables, where:

  • n 3 n \geq 3 and 1 < k < n 1 < k < n
  • The coefficients are all 1
  • Each of the sums equals an integer

Which of the following must be true about the system of equations?

The sum of all equations must be divisible by n n . The sum of all equations must be divisible by ( n k ) \dbinom{n}{k} . There is not enough information to conclude. The sum of all equations must be divisible by ( n 1 k 1 ) \dbinom{n-1}{k-1} . The sum of all equations must be divisible by ( n 1 ) (n - 1)

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.

0 solutions

No explanations have been posted yet. Check back later!

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...