Wednesday, 5 August 2015

number theory - Congruence in $mathbb{Z}_5[x]$

I'm not really sure how to approach this problem, since it doesn't seem similar to solving linear congruences in $\mathbb{Z}_m$.



Find all solutions in $\mathbb{Z}_5[x]$ to the congruence $(x^2-1)a(x)\equiv x^2+x-2\pmod{x^3-1}$. Additionally, is it possible to count the number of solutions in $(\mathbb{Z}_5[x])_{x^3-1}$ without actually finding them?



Any help is appreciated.

No comments:

Post a Comment

real analysis - How to find $lim_{hrightarrow 0}frac{sin(ha)}{h}$

How to find $\lim_{h\rightarrow 0}\frac{\sin(ha)}{h}$ without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...