(Assuming you mean .)

If it is reducible it must have a linear factor so just evaluate the polynomial for each value and if all are nonzero than it is irreducible.

Results 1 to 13 of 13

- Dec 7th 2008, 11:30 PM #1

- Joined
- Dec 2008
- Posts
- 8

- Dec 8th 2008, 01:37 AM #2

- Joined
- Aug 2008
- Posts
- 120

- Dec 8th 2008, 01:07 PM #3

- Joined
- Dec 2008
- Posts
- 8

- Dec 8th 2008, 01:14 PM #4

- Dec 8th 2008, 01:17 PM #5

- Joined
- Dec 2008
- Posts
- 8

thank you very much.

i have others problems:

Does 144 mod 25 have an additive inverse mod 25. If yes, give it.

Does 144 mod 25 have an multiplicative inverse mod 25. If yes, give it.

I dont really understand about additive inverse and multiplicative inverse. could you help me please ?

- Dec 8th 2008, 01:31 PM #6

- Joined
- Aug 2008
- Posts
- 120

An additive inverse of 144 mod 25 is a number which you add to it to get 0 mod 25.

An multiplicative inverse of 144 mod 25 is a number which you multiply to it to get 1 mod 25. x has a multiplicative inverse modulo n iff gcd(x,n)=1.

Can you answer it now? You may want to note that 144 = 19 mod 25.

- Dec 8th 2008, 01:47 PM #7

- Joined
- Dec 2008
- Posts
- 8

- Dec 8th 2008, 02:35 PM #8

- Joined
- Aug 2008
- Posts
- 120

- Dec 8th 2008, 10:34 PM #9

- Joined
- Dec 2008
- Posts
- 8

- Dec 9th 2008, 02:08 AM #10
You got the right answer, namely 4, but you embedded it in an "explanation" that is complete nonsense.

What you should have said is that the multiplicative inverse of 144 (mod 25) is 4, because 144 = 19 (mod 25) and 19×4 = 76 = 75 + 1 = 1 (mod 25).

- Dec 11th 2008, 05:03 PM #11

- Joined
- Dec 2008
- Posts
- 8

- Dec 11th 2008, 07:00 PM #12

- Joined
- Dec 2008
- Posts
- 8

- Dec 12th 2008, 07:36 AM #13