![]() |
Available news archives:
comp.lang.tcl
-
comp.lang.python
-
comp.security.firewalls
-
sci.crypt -
comp.lang.php -
comp.lang.javascript
|
|
sci.crypt archiveRe: help! modular arith and matrixes
From: aleterra <aleterra@yahoo.com>
Date: Sun Sep 18 2005 - 23:50:51 CEST
Ok, here's what I got, but I am not sure whether it is ok, could you
Thanks!
A=(a b)
INV(A) = INV(det A) . (d -b)
I have splitted the solution into 4 sections, calculating the
-----------------------------------------------------------------
For det A=-1 modulo 13
a=-d
ad-bc= -1
-1 mod 26 = 12 mod 13
a.d + 12.bc = 12 (mod 13)
d = 12 a (mod 13)
=> a has to be a=0 or a=1, otherwise d would be bigger than 12
12.a.a + 12.b.c = 12
a.a+b.c=1
=> a = 1 and b=0 and c=n (being n={0,12})
or a = 1 and c=0 and b=n (being n={0,12})
or a = 0 and b=1 and c=1
counting all the possible matrixes we have 26 possibilities
--------------------------------------------
For det A=-1 mod 2:
a=-d
-1 mod 26 = 1 mod 2
ad-bc=-1
a=-d then a=-1.d mod 26
then a=1.d mod 2
a.a+bc=1
then the possible values are:
=> a = 1 and b=0 and c=n (being n={0,1})
or a = 1 and c=0 and b=n (being n={0,1})
or a = 0 and b=1 and c=1
counting all the possible matrixes we have 4 possibilities
------------------------------------------------------
For det A=1 mod 13:
a=d
b=0
ad=1 mod 13
1 mod 13 = 1,14,27,40,53,66,79....
Then, the possible values with b=0 and c=0 are:
a=1 d=1
counting all the possible matrixes we have 9 possibilities
----------------------------------------------------------
b=0
a.d-cb=1
ad=1 mod 2
1 mod 2= 1,3,....
Possible values a=1 d=1
counting all the possible matrixes we have 1 possibilities
----------------------------------------------------------
Now, if we find the number of matrixes for det A=-1:
quantity of matrixes in mod 13 x in mod 2: 26 x 4 = 104
Doing the same for det A=1
quantity of matrixes in mod 13 x in mod 2: 9 x 1 = 9
Adding both quantities: 104+9 = 113 matrixes
|