Rearrange and multiply

Number Theory Level pending

Let n n be an odd integer greater than 1.

Let A ( 1 ) A(1) , A ( 2 ) A(2) ... A ( n ) A(n) be a rearrangement of the set { 1 1 , 2 2 , .... n n }

Consider the product ( A ( 1 ) 1 ) × ( A ( 2 ) 2 ) × . . . ( A ( n ) n ) (A(1) - 1) \times (A(2) - 2) \times ... (A(n)-n)

This product is...

Even Odd It can be either

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

Denton Young
Aug 20, 2017

Since n n is odd, let n = 2 k + 1 n = 2k +1 , where k k is a positive integer.

Then the set A ( 1 ) A(1) ... A ( n ) A(n) contains k k even numbers and k + 1 k+1 odd numbers.

For the product to not be even, every term has to be odd. But since there are k + 1 k+1 odd numbers in the set of A ( i ) A(i) 's and only k k even numbers, at least one odd A ( i ) A(i) has to have an odd number subtracted from it, making the term even and hence the entire product an even number.

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...