Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Consider the following matrix $$ A_{ij}= \begin{cases} 1\quad\text{ if }\space (i+j)\space\text{ is prime,}\\ 0\quad\text{ otherwise.} \end{cases} $$ How can one prove that $\left|\det A\right|$ is a complete square?

share|cite|improve this question
I assume we are talking here about an $n\times n$ matrix, with the indices satisfying $1\leq i,j \leq n$? – Old John Aug 30 '12 at 13:27
@OldJohn: Is the induction on $n$ applicable here? – Babak S. Aug 30 '12 at 13:30
probably, but I am not sure yet! – Old John Aug 30 '12 at 13:32
@OldJohn: It seems that this matrix looks symmetric. – Babak S. Aug 30 '12 at 13:41
For $6 \times 6$, the determinant is $-1$. See here.. Ah, but he's taking the modulus.. Anyway, some numerical data: For $n =4,5,6$, the answer is $0,1,-1$. – Rijul Saini Aug 30 '12 at 14:09
up vote 5 down vote accepted

It was a problem posed at an annual contest for undergraduates called IMC (International Mathematics Contest). The official site of the site . It was the fifth problem of the second day (year 2008), which means it is pretty hard to solve. Here is a reference of the official site . Also there is a discussion here at artofproblemsolving forum .

share|cite|improve this answer
I faces this problem on a mathematical battle at Saint-Petersburg. – Norbert Aug 30 '12 at 14:36
I think there are too many competitions for the problems to be all original.. – clark Aug 30 '12 at 14:42

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.