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

I am trying to solve this problem for homework but unable to get anything. The question is to find the number of invertible 2x2 matrices in mod p? Each entery can bee from the set {0,1,2....(p-1)} where p is prime.

share|cite|improve this question
How many choices do you have for your first column? Then what about the second column once you've chosen a first? – Derek Allums Nov 19 '12 at 16:32
Sorry, in a hurry I left some information – Aman Deep Gautam Nov 19 '12 at 16:36
Right, I was asking those as hints to you mainly. It's just a counting problem once you interpret invertibility the right way. The answer below is precisely was I was getting at. – Derek Allums Nov 19 '12 at 16:47
up vote 5 down vote accepted

The answer is $(p^2-1)(p^2-p)$, since there are $(p^2-1)$ ways to choose the first column such that it is non-zero, then the second column can be chosen in any way out of the $p$ multiples of the first column.

share|cite|improve this answer

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.