## 20 Reputation

10 years, 100 days

## @Carl Love  Thank you veyr much. Th...

@Carl Love  Thank you veyr much. This is exactly what I needed.

## @Carl Love   Each element of t...

@Carl Love   Each element of this ring can be given as a 3-tuple (a,b,c). So a 27 x 27 matrix with each entry a 3-tuple would be great. Thank you so much. You have been very helpful.

## @Carl Love yes, 2 x 2. I am sorry that I...

@Carl Love yes, 2 x 2. I am sorry that I forgot to mention this.

## @Carl Love  Thank you so much. This...

@Carl Love  Thank you so much. This new function is computing at the speed of light and it is really made my day. Thank you so much.

## @Carl Love  Thank you for willing t...

@Carl Love  Thank you for willing to do this. I am not good at Maple myself and so if you can help me with the code that would be excellent.  Computing binomial coefficients mod 2 or mod p for any prime p is very easy. This is called Luca's theroem. Here is the wikipedia link for this

http://en.wikipedia.org/wiki/Lucas%27_theorem

So the input should be positive integers n and k and the output should be n choose k mod 2 (using Lucas method)

Thanks again and please let me know if you have any questions.

## @Markiyan Hirnyk  You are right if ...

@Markiyan Hirnyk  You are right if I was working over Z. But I am working over a quotient of Z[x]. More precisely, I am doing calculations in the group ring F_2C_p.

 Page 1 of 1
﻿