Question #44529

Factorise 10 in two ways in Z[p

Expert's answer

Answer on Question #44529 – Math - Abstract Algebra

Problem.

Factorise 10 in two ways in Z[p]Z[p]

Solution.

We suppose that p>10p > 10, as there are no elements with residue 10 in Z[p]\mathbb{Z}[p], when p10p \leq 10.

10=2510 = 2 \cdot 5, 10=2510 = -2 \cdot -5 in Z\mathbb{Z}. To find two different factorization of 10 in Z[p]\mathbb{Z}[p] we should replace 5,2,2,5-5, -2, 2, 5 and 10 with their residue by modulo pp. We will obtain that 1025(modp)10 \equiv 2 \cdot 5 \pmod{p} and 10(p2)(p5)(modp)10 \equiv (p - 2) \cdot (p - 5) \pmod{p}.

2≢p2(modp)2 \not\equiv p - 2 \pmod{p}, 5≢p5(modp)5 \not\equiv p - 5 \pmod{p}, 2≢p5(modp)2 \not\equiv p - 5 \pmod{p}, 5≢p2(modp)5 \not\equiv p - 2 \pmod{p}, as p>10p > 10.

Answer: 1025(modp)10 \equiv 2 \cdot 5 \pmod{p} and 10(p2)(p5)(modp)10 \equiv (p - 2) \cdot (p - 5) \pmod{p}.

www.AssignmentExpert.com


Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

LATEST TUTORIALS
APPROVED BY CLIENTS