GCD Determinant Tango

Algebra Level 5

Let S 17 \mathcal{S}_{17} be the set of all 17 × 17 17\times 17 matrices, each of whose 289 289 entries is taken from the set { 1 , 1 } \{1,-1\} . Find the greatest common divisor of the determinants of all matrices in the set S 17 . \mathcal{S}_{17}.


The answer is 65536.

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

Mark Hennings
Aug 10, 2020

Consider the matrix X S X \in \mathcal{S} where X i j = { 1 i j 1 i > j X_{ij} \; = \; \left\{\begin{array}{lll} 1 & \hspace{1cm} & i \le j \\ -1 & & i > j \end{array}\right. If we add the first row of X X to the second, third, fourth, ..., seventeenth rows of X X , we deduce that X = Y |X| = |Y| , where Y Y is the triangular matrix Y i j = { 1 i = 1 2 2 i j 0 i 2 , j < i Y_{ij} \; = \; \left\{ \begin{array}{lll} 1 & \hspace{1cm} & i = 1 \\ 2 & & 2 \le i \le j \\ 0 & & i \ge 2\,,\, j < i \end{array}\right. and hence X = Y = 2 16 |X| = |Y| = 2^{16} . On the other hand, for any A S A \in \mathcal{S} , adding or subtracting the first row of A A from the other rows of A A gives us that A = B |A| = |B| , where B = ( ± 1 ± 1 ± 1 0 C 0 ) B \; = \; \left(\begin{array}{cccc}\pm1 & \pm1 & \cdots & \pm1 \\ 0 & & & & \\ \vdots & & C & \\ 0 & & & \end{array}\right) where each entry of C C is either 2 2 , 0 0 or 2 -2 . Thus each row of B B , except for the first one, is divisible by 2 2 , and hence A |A| is divisible by 2 16 2^{16} .

Thus we deduce that the greatest common divisor all the determinants of matrices in S \mathcal{S} is 2 16 = 65536 2^{16} = \boxed{65536} .

Very nice solution. One minor point - presumably the first row of B B could contain 1 -1 s, and the first column of B B (from row 2 2 down) could also contain ± 2 \pm2 s, just depending on the form of A A . Is that right, or have I missed something?

Chris Lewis - 10 months ago

Log in to reply

The first rows should be ± 1 \pm1 , yes. We can suitably add or subtract the first row from the later rows to ensure 0 0 s in the rest of the first column, but it does not really matter, since we still have a factor of 2 16 2^{16} .

Mark Hennings - 10 months ago

Log in to reply

Thanks for updating the solution. And again, very neat description - I went with induction on the size of the matrix but your direct approach is much more elegant.

Chris Lewis - 10 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...