March 18th, 2018, 08:14 AM  #1 
Member Joined: Sep 2011 Posts: 99 Thanks: 1  Irreducibility
Hi all, I have done the question in two methods. The first method is done by rational root test and the second method is by modulo p (theorem is as attached). It seems that my answers for both methods do not tally. 1. Where have I done wrong in the attached for the methods? Which is the correct presentation of answer for this question (i.e. rational test method or modulo p ? 2. How do I tell when to use rational root test method or modulo p method? When modulo p method not applicable? Your advise is greatly appreciated. Thanks. 
March 18th, 2018, 01:35 PM  #2 
Global Moderator Joined: May 2007 Posts: 6,703 Thanks: 669 
The thumbnails are very hard to read.

March 18th, 2018, 01:45 PM  #3 
Math Team Joined: Dec 2013 From: Colombia Posts: 7,614 Thanks: 2603 Math Focus: Mainly analysis and algebra 
The first thing I notice is that your modulo $p$ theorem says that if for some prime $p$, $\bar f(X)$ is irreducible in $\mathbb Z_p[x]$ then $f(x)$ is irreducible in $\mathbb Q[x]$. It does not say that if $\bar f(X)$ is reducible, then $f(X)$ is reducible.


Tags 
irreducibility 
Thread Tools  
Display Modes  

Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Irreducibility and splitting fields of a polynomial  Diehardwalnut  Abstract Algebra  1  June 4th, 2017 07:56 AM 
The test of irreducibility  casablancahp  Abstract Algebra  6  March 20th, 2011 03:51 PM 
irreducibility criteria  Ann  Abstract Algebra  1  November 25th, 2006 07:24 PM 
irreducibility criteria  Ann  New Users  0  December 31st, 1969 04:00 PM 