Jump to content

modular reduction of polynomials

Featured Replies

I have seen asserted that for polynomials f and h, f divides h implies that fbar divides hbar, where "bar" indicates reduction modulo p, a prime number say.

 

But when I test this with sample polynomials, it does not seem to be true. For example modulo 3 and f = 2x + 1, h = 6x2 + 7x + 2, then fbar = 2x + 1, hbar = x + 2.

What is wrong here please ?

 

  • Author

Thank you. But how about this case (mod 3) :

f = 11x + 2, g = 5x + 7, then fg = 55x2 + 87x + 14, fbar = 2x + 2, gbar = 2x + 1, (fg)bar = x2 + 2.

How can fbar (or gbar) divide (fg)bar ?

Archived

This topic is now archived and is closed to further replies.

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.

Configure browser push notifications

Chrome (Android)
  1. Tap the lock icon next to the address bar.
  2. Tap Permissions → Notifications.
  3. Adjust your preference.
Chrome (Desktop)
  1. Click the padlock icon in the address bar.
  2. Select Site settings.
  3. Find Notifications and adjust your preference.